Tabu Search Embedded Simulated Annealing for the Shortest Route Cut and Fill Problem

• المؤلفون الرئيسيون: LIM, Andrew, RODRIGUES, Brian, Zhang, J.
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2005
• الموضوعات: Operations and Supply Chain Management
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/lkcsb_research/2621; https://doi.org/10.1057/palgrave.jors.2601900

The shortest route cut and fill problem proposed by Henderson et al is studied in this paper where we extend the model to include multiple vehicles and a makespan objective. A new tabu search embedded simulated annealing algorithm for both models is developed. Computational experiments show that the...