An Iterated Local Search for the Traveling Salesman Problem with Pickup, Delivery and Handling Costs

Carlos Rey, Paolo Toth, Daniele Vigo

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

In this paper the Traveling Salesman Problem with pickup, delivery and handling costs is studied. We have to find a route from a depot to a set of customers, each of which requires a pickup and delivery service the goal is to minimize the global routing and handling cost. We have developed an Iterated Local Search for this problem combining different heuristics of the Traveling Salesman Problem, and using frequency of improvements and a perturbation with memory the proposed algorithm is tested on different benchmark instances from the literature with up to 200 vertices, obtaining high quality solutions in reasonable computing times.

Original languageEnglish
Title of host publication2020 39th International Conference of the Chilean Computer Science Society, SCCC 2020
PublisherIEEE Computer Society
ISBN (Electronic)9781728183282
DOIs
Publication statusPublished - 9 Dec 2020
Event39th International Conference of the Chilean Computer Science Society, SCCC 2020 - Coquimbo, Chile
Duration: 16 Nov 202020 Nov 2020

Publication series

NameProceedings - International Conference of the Chilean Computer Science Society, SCCC
Volume2020-November
ISSN (Print)1522-4902

Conference

Conference39th International Conference of the Chilean Computer Science Society, SCCC 2020
Country/TerritoryChile
CityCoquimbo
Period16/11/2020/11/20

Bibliographical note

Funding Information:
This work was funded by the National Agency for Research and Development (ANID)/ Scholarship Program/Doctorado Becas Chile/2018-72190600.

Publisher Copyright:
© 2020 IEEE.

Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.

Keywords

  • Combinatorial Optimization
  • Handling Cost
  • Iterated Local Search
  • Traveling Salesman Problem

Fingerprint

Dive into the research topics of 'An Iterated Local Search for the Traveling Salesman Problem with Pickup, Delivery and Handling Costs'. Together they form a unique fingerprint.

Cite this