Scheduling Trucks in Multi-Door Cross Docking Systems: An Adaptive Genetic Algorithm with a Dispatching Rule

2015 ◽  
Vol 32 (03) ◽  
pp. 1550016 ◽  
Author(s):  
Byung Soo Kim ◽  
Cheol Min Joo
Keyword(s):  
Genetic Algorithms ◽  
Heuristic Algorithms ◽  
Optimal Solution ◽  
Operation Time ◽  
Adaptive Genetic Algorithm ◽  
Scheduling Problem ◽  
Cross Docking ◽  
Truck Scheduling ◽  
Total Operation Time ◽  
Management Concept

One of the most important operational management problems of a cross docking system is the truck scheduling problem. Cross docking is a logistics management concept in which products delivered to a distribution center by inbound trucks are immediately sorted out, routed and loaded into outbound trucks for delivery to customers. The truck scheduling problem in a multi-door cross docking system considered in this paper comprises the assignment of trucks to dock doors and the determination of docking sequences for all inbound and outbound trucks in order to minimize the total operation time. A mathematical model for optimal solution is derived, and the genetic algorithms (GAs) and the adaptive genetic algorithms (AGAs) as solution approaches with different types of chromosomes are proposed. The performance of the meta-heuristic algorithms are evaluated using randomly generated several examples.

Developing a lower bound and strong heuristics for a truck scheduling problem in a cross-docking center

2017 ◽  
Vol 129 ◽  
pp. 17-38 ◽  
Author(s):  
Amir Golshahi-Roudbaneh ◽  
Mostafa Hajiaghaei-Keshteli ◽  
Mohammad Mahdi Paydar
Keyword(s):  
Lower Bound ◽  
Scheduling Problem ◽  
Cross Docking ◽  
Truck Scheduling

scholarly journals Novel modifications of social engineering optimizer to solve a truck scheduling problem in a cross-docking system

2019 ◽  
Vol 137 ◽  
pp. 106103 ◽  
Author(s):  
Amir Mohammad Fathollahi-Fard ◽  
Mehdi Ranjbar-Bourani ◽  
Naoufel Cheikhrouhou ◽  
Mostafa Hajiaghaei-Keshteli
Keyword(s):  
Social Engineering ◽  
Scheduling Problem ◽  
Cross Docking ◽  
Truck Scheduling

scholarly journals Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem

2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Mohammed Al-Salem ◽  
Leonardo Bedoya-Valencia ◽  
Ghaith Rabadi
Keyword(s):  
Job Shop ◽  
Heuristic Algorithms ◽  
Job Shop Scheduling ◽  
Optimal Solution ◽  
Approximate Solutions ◽  
Exact Algorithms ◽  
Just In Time ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling

The problem addressed in this paper is the two-machine job shop scheduling problem when the objective is to minimize the total earliness and tardiness from a common due date (CDD) for a set of jobs when their weights equal 1 (unweighted problem). This objective became very significant after the introduction of the Just in Time manufacturing approach. A procedure to determine whether the CDD is restricted or unrestricted is developed and a semirestricted CDD is defined. Algorithms are introduced to find the optimal solution when the CDD is unrestricted and semirestricted. When the CDD is restricted, which is a much harder problem, a heuristic algorithm is proposed to find approximate solutions. Through computational experiments, the heuristic algorithms’ performance is evaluated with problems up to 500 jobs.

Sign in / Sign up

Export Citation Format

Share Document