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

Full description

Saved in:

Bibliographic Details
Main Authors:	LIM, Andrew, RODRIGUES, Brian, Zhang, J.
Format:	text
Language:	English
Published:	Institutional Knowledge at Singapore Management University 2005
Subjects:	Operations and Supply Chain Management
Online Access:	https://ink.library.smu.edu.sg/lkcsb_research/2621 https://doi.org/10.1057/palgrave.jors.2601900
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Singapore Management University
Language:	English

id	sg-smu-ink.lkcsb_research-3620
record_format	dspace
spelling	sg-smu-ink.lkcsb_research-36202016-03-11T13:37:46Z Tabu Search Embedded Simulated Annealing for the Shortest Route Cut and Fill Problem LIM, Andrew RODRIGUES, Brian Zhang, J. 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. 2005-07-01T07:00:00Z text https://ink.library.smu.edu.sg/lkcsb_research/2621 info:doi/10.1057/palgrave.jors.2601900 https://doi.org/10.1057/palgrave.jors.2601900 Research Collection Lee Kong Chian School Of Business eng Institutional Knowledge at Singapore Management University Operations and Supply Chain Management
institution	Singapore Management University
building	SMU Libraries
continent	Asia
country	Singapore Singapore
content_provider	SMU Libraries
collection	InK@SMU
language	English
topic	Operations and Supply Chain Management
spellingShingle	Operations and Supply Chain Management LIM, Andrew RODRIGUES, Brian Zhang, J. Tabu Search Embedded Simulated Annealing for the Shortest Route Cut and Fill Problem
description	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.
format	text
author	LIM, Andrew RODRIGUES, Brian Zhang, J.
author_facet	LIM, Andrew RODRIGUES, Brian Zhang, J.
author_sort	LIM, Andrew
title	Tabu Search Embedded Simulated Annealing for the Shortest Route Cut and Fill Problem
title_short	Tabu Search Embedded Simulated Annealing for the Shortest Route Cut and Fill Problem
title_full	Tabu Search Embedded Simulated Annealing for the Shortest Route Cut and Fill Problem
title_fullStr	Tabu Search Embedded Simulated Annealing for the Shortest Route Cut and Fill Problem
title_full_unstemmed	Tabu Search Embedded Simulated Annealing for the Shortest Route Cut and Fill Problem
title_sort	tabu search embedded simulated annealing for the shortest route cut and fill problem
publisher	Institutional Knowledge at Singapore Management University
publishDate	2005
url	https://ink.library.smu.edu.sg/lkcsb_research/2621 https://doi.org/10.1057/palgrave.jors.2601900
_version_	1770570492309143552

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

Similar Items