Scheduling trucks in cross-docking systems: A robust meta-heuristics approach
AbstractIn a cross-docking system, trucks must be scheduled to minimize the total flow time of the system. This problem is NP-hard, and this study proposes two hybrid meta-heuristics--hybrid simulated annealing and hybrid variable neighborhood search--to solve it by achieving the best sequence of truck pairs. The Taguchi method serves to reveal the best robustness of these algorithms. To demonstrate the effectiveness of the proposed methods, especially for large-sized problems, this study solves various test problems, and the computational results clearly reveal that the proposed methods outperform previous approaches.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Elsevier in its journal Transportation Research Part E: Logistics and Transportation Review.
Volume (Year): 46 (2010)
Issue (Month): 5 (September)
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Liao, T.W. & Egbelu, P.J. & Chang, P.C., 2013. "Simultaneous dock assignment and sequencing of inbound trucks under a fixed outbound truck schedule in multi-door cross docking operations," International Journal of Production Economics, Elsevier, vol. 141(1), pages 212-229.
- Jesus Gonzalez-Feliu, 2013. "Multi-stage LTL transport systems in supply chain management," Post-Print halshs-00796714, HAL.
If references are entirely missing, you can add them using this form.