Scheduling trucks in cross-docking systems: A robust meta-heuristics approach
In 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.
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|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic|
When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:46:y:2010:i:5:p:650-666. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.