Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
This paper studies the Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs. The subproblem of minimizing the handling cost for a fixed route is analyzed in detail. It is solved by means of an exact dynamic programming algorithm with quadratic complexity and by an approximate linear time algorithm. Three metaheuristics integrating these solution methods are developed. These are based on tabu search, iterated local search and iterated tabu search. The three heuristics are tested and compared on instances adapted from the related literature. The results show that the combination of tabu search and exact dynamic programming performs the best, but using the approximate linear time algorithm considerably decreases the CPU time at the cost of slightly worse solutions
traveling salesman problem, handling cost, pickup and delivery, metaheuristics
1074-1086
Erdogan, Gunes
468310a1-5c36-4c3d-8b39-079bd621b34b
Battarra, Maria
0498dc58-e9d5-4ad2-a141-040f7bcebbc2
Laporte, Gilbert
b8210b8f-e942-4c5c-98b1-b55bd916aa70
Vigo, Daniele
0bc6db04-0bff-438e-91ca-947171d0604e
May 2011
Erdogan, Gunes
468310a1-5c36-4c3d-8b39-079bd621b34b
Battarra, Maria
0498dc58-e9d5-4ad2-a141-040f7bcebbc2
Laporte, Gilbert
b8210b8f-e942-4c5c-98b1-b55bd916aa70
Vigo, Daniele
0bc6db04-0bff-438e-91ca-947171d0604e
Erdogan, Gunes, Battarra, Maria, Laporte, Gilbert and Vigo, Daniele
(2011)
Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs.
Computers & Operations Research, 39 (5), .
(doi:10.1016/j.cor.2011.07.013).
Abstract
This paper studies the Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs. The subproblem of minimizing the handling cost for a fixed route is analyzed in detail. It is solved by means of an exact dynamic programming algorithm with quadratic complexity and by an approximate linear time algorithm. Three metaheuristics integrating these solution methods are developed. These are based on tabu search, iterated local search and iterated tabu search. The three heuristics are tested and compared on instances adapted from the related literature. The results show that the combination of tabu search and exact dynamic programming performs the best, but using the approximate linear time algorithm considerably decreases the CPU time at the cost of slightly worse solutions
This record has no associated files available for download.
More information
Published date: May 2011
Keywords:
traveling salesman problem, handling cost, pickup and delivery, metaheuristics
Organisations:
Centre of Excellence for International Banking, Finance & Accounting
Identifiers
Local EPrints ID: 204837
URI: http://eprints.soton.ac.uk/id/eprint/204837
ISSN: 0305-0548
PURE UUID: 92c310e7-e3c9-4fb4-a7a4-719a77bbc0a8
Catalogue record
Date deposited: 02 Dec 2011 11:11
Last modified: 14 Mar 2024 04:33
Export record
Altmetrics
Contributors
Author:
Gunes Erdogan
Author:
Maria Battarra
Author:
Gilbert Laporte
Author:
Daniele Vigo
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics