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...

全面介紹

Saved in:
書目詳細資料
Main Authors: LIM, Andrew, RODRIGUES, Brian, Zhang, J.
格式: 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