Abstract
One of the most important operational management problems in a cross-docking terminal is truck scheduling problem. In this paper, we consider a truck scheduling problem for three types of trucks (inbound-only trucks, outbound-only trucks, and compound trucks) in a multi-door cross-docking terminal. The objective of the problem is to determine the door assignments and the docking sequences of all three types of trucks simultaneously to minimize the makespan. A mathematical model for optimal solution is derived and two meta-heuristics, genetic algorithm and self-evolution algorithm, are proposed. The performance of the meta-heuristic algorithms are evaluated using randomly generated several examples.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: The International Journal of Advanced Manufacturing Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
