A Bi-Objective Green Truck Routing and Scheduling Problem in a Cross Dock with the Learning Effect

Musavi, MirMohammad; Tavakkoli–Moghaddam, Reza; Rayat, Farnaz

doi:10.29252/iors.8.1.2

Cited by 4 publications

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…See e.g. Eliiyi et al [3], Hadjar et al [9], Kliewer et al [14], He et al [8] and Fallah et al [4] for exact algorithms and Shui et al [18], Shafahi and Khani [17], Musavi et al [15] and Kim and Kim [13] for heuristic solution. Also, the combination of exact and heuristic algorithms was proposed in Guedes and Borenstein [6], Wagale et al [19], Kulkarni et al [12] and Ibarra-Rojas et al [11].…”

Section: Introductionmentioning

confidence: 99%

Efficient Algorithm Based on Network Flows for Two-Depot Bus Scheduling Problem

Niksirat

2018

IJOR

View full text Add to dashboard Cite

In this paper bus scheduling problem under the constraints that the total number of buses needed to perform all trips is known in advance and the energy level of buses is limited, is considered. Each depot has a different time processing cost. The goal of this problem is to find a minimum cost feasible schedule for buses. A mathematical formulation of the problem is developed. When there are two depots, a polynomial time algorithm is developed for the problem and theoretical results about the complexity and correctness of the algorithm is presented. Also, several examples are introduced for illustrating validity of the algorithm.

show abstract

Section: Introductionmentioning

confidence: 99%

Efficient Algorithm Based on Network Flows for Two-Depot Bus Scheduling Problem

Niksirat

2018

IJOR

View full text Add to dashboard Cite

show abstract

Cross-Dock Scheduling by Considering Unloading Preemption and Fixed Departure Time for Outbound Trucks

Abedsoltan,

Mozaffari Doust,

Nasiri

2023

Preprint

View full text Add to dashboard Cite

Modelling Cross-Docking in a Three-Level Supply Chain with Stochastic Service and Queuing System: MOWFA Algorithm

2022

View full text Add to dashboard Cite

In today’s competitive world, it is essential to provide a new method through which maximum efficiency can be created in the production and supply cycle. In many production environments, sending goods directly from the producer to the consumer brings many problems. Therefore, an efficient transport system should be established between producers and consumers. Such a system is designed in the field of supply chain management knowledge. Supply chain management is the evolutionary result of warehousing management and is one of the important infrastructural foundations of business implementation, in many of which the main effort is to shorten the time between the customer’s order and the actual delivery of the goods. In this research, the supply chain consists of three levels. Suppliers are placed on the first level, cross-docks on the second level, and factories on the third level. In this system, a number of suppliers send different raw materials to several different cross-docks. Each channel is assigned to a cross-dock for a specific product. The main goal of this article is to focus on optimizing the planning of incoming and outgoing trucks with the aim of minimizing the total operation time within the supply chain. The arrival rate of goods from suppliers to the cross-dock is stochastic with a general probability distribution. On the other hand, the time required to prepare and send the goods is random with a general probability distribution. The service time in each cross-dock depends on the number of its doors. Therefore, each cross-dock can be modeled as a G/G/m queueing system where m represents the number of doors. The mathematical model of the research has been developed based on these assumptions. Since the problem is NP-hard, the time to solve it increases drastically with the increase in the dimensions of the problem. Therefore, three metaheuristics, including multi-objective water flow, non-dominated sorting genetic, and a multi-objective simulated annealing algorithm have been used to find near-optimal solutions to the problem. After adjusting the parameters of the algorithms using the Taguchi method, the results obtained from the algorithms were analyzed with a statistical test and the performance of the algorithms was evaluated. The results vividly demonstrate that non-dominated sorting genetics is the best of all.

show abstract

A Bi-Objective Green Truck Routing and Scheduling Problem in a Cross Dock with the Learning Effect

Abstract: We present a bi-objective model for a green truck scheduling and routing problem at a crossdocking system. This model determines three key decisions at the cross dock: (1)

Cited by 4 publications

References 20 publications

Efficient Algorithm Based on Network Flows for Two-Depot Bus Scheduling Problem

Efficient Algorithm Based on Network Flows for Two-Depot Bus Scheduling Problem

Cross-Dock Scheduling by Considering Unloading Preemption and Fixed Departure Time for Outbound Trucks

Modelling Cross-Docking in a Three-Level Supply Chain with Stochastic Service and Queuing System: MOWFA Algorithm

Contact Info

Product

Resources

About