Tabu Search Embedded Simulated Annealing for the Shortest Route Cut and Fill Problem
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...
محفوظ في:
| المؤلفون الرئيسيون: | , , |
|---|---|
| التنسيق: | text |
| اللغة: | English |
| منشور في: |
Institutional Knowledge at Singapore Management University
2005
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://ink.library.smu.edu.sg/lkcsb_research/2621 https://doi.org/10.1057/palgrave.jors.2601900 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| المؤسسة: | Singapore Management University |
| اللغة: | English |
| الملخص: | 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 new approach is robust and achieves better solutions when compared with those found using Henderson et al's algorithm for larger test cases within significantly shorter times. |
|---|