Tabu search embedded simulated annealing for the shortest route cut and fill problem |
| |
Authors: | A Lim B Rodrigues J Zhang |
| |
Institution: | 1.The Hong Kong University of Science and Technology,Kowloon,Hong Kong;2.Singapore Management University,Singapore;3.National University of Singapore,Singapore |
| |
Abstract: | The shortest route cut and fill problem proposed by Henderson et al 1 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |