An Iterated Local Search algorithm for the Traveling Salesman Problem with Pickups and Deliveries

Anand Subramanian, Maria Battarra

Research output: Contribution to journalArticle

23 Citations (Scopus)

Abstract

The Travelling Salesman Problem with Pickups and Deliveries (TSPPD) consists in designing a minimum cost tour that starts at the depot, provides either a pickup or delivery service to each of the customers and returns to the depot, in such a way that the vehicle capacity is not exceeded in any part of the tour. In this paper, the TSPPD is solved by considering a metaheuris-tic algorithm based on Iterated Local Search with Variable Neighbourhood Descent and Random neighbourhood ordering. Our aim is to propose a fast, flexible and easy to code algorithm, also capable of producing high quality solutions. The results of our computational experience show that the algorithm finds or improves the best known results reported in the literature within reasonable computational time.
Original languageEnglish
Pages (from-to)402-409
JournalJournal of the Operational Research Society
Volume64
Issue number3
DOIs
Publication statusPublished - 1 Mar 2013

Fingerprint

Traveling salesman problem
Pickups
Local search (optimization)
Iterated local search
Pickup and delivery
Costs

Cite this

An Iterated Local Search algorithm for the Traveling Salesman Problem with Pickups and Deliveries. / Subramanian, Anand; Battarra, Maria.

In: Journal of the Operational Research Society, Vol. 64, No. 3, 01.03.2013, p. 402-409.

Research output: Contribution to journalArticle

@article{f55e02e8262d44a797bdec26cbe730fe,
title = "An Iterated Local Search algorithm for the Traveling Salesman Problem with Pickups and Deliveries",
abstract = "The Travelling Salesman Problem with Pickups and Deliveries (TSPPD) consists in designing a minimum cost tour that starts at the depot, provides either a pickup or delivery service to each of the customers and returns to the depot, in such a way that the vehicle capacity is not exceeded in any part of the tour. In this paper, the TSPPD is solved by considering a metaheuris-tic algorithm based on Iterated Local Search with Variable Neighbourhood Descent and Random neighbourhood ordering. Our aim is to propose a fast, flexible and easy to code algorithm, also capable of producing high quality solutions. The results of our computational experience show that the algorithm finds or improves the best known results reported in the literature within reasonable computational time.",
author = "Anand Subramanian and Maria Battarra",
year = "2013",
month = "3",
day = "1",
doi = "10.1057/jors.2012.24",
language = "English",
volume = "64",
pages = "402--409",
journal = "Journal of the Operational Research Society",
issn = "0160-5682",
publisher = "Palgrave Macmillan",
number = "3",

}

TY - JOUR

T1 - An Iterated Local Search algorithm for the Traveling Salesman Problem with Pickups and Deliveries

AU - Subramanian, Anand

AU - Battarra, Maria

PY - 2013/3/1

Y1 - 2013/3/1

N2 - The Travelling Salesman Problem with Pickups and Deliveries (TSPPD) consists in designing a minimum cost tour that starts at the depot, provides either a pickup or delivery service to each of the customers and returns to the depot, in such a way that the vehicle capacity is not exceeded in any part of the tour. In this paper, the TSPPD is solved by considering a metaheuris-tic algorithm based on Iterated Local Search with Variable Neighbourhood Descent and Random neighbourhood ordering. Our aim is to propose a fast, flexible and easy to code algorithm, also capable of producing high quality solutions. The results of our computational experience show that the algorithm finds or improves the best known results reported in the literature within reasonable computational time.

AB - The Travelling Salesman Problem with Pickups and Deliveries (TSPPD) consists in designing a minimum cost tour that starts at the depot, provides either a pickup or delivery service to each of the customers and returns to the depot, in such a way that the vehicle capacity is not exceeded in any part of the tour. In this paper, the TSPPD is solved by considering a metaheuris-tic algorithm based on Iterated Local Search with Variable Neighbourhood Descent and Random neighbourhood ordering. Our aim is to propose a fast, flexible and easy to code algorithm, also capable of producing high quality solutions. The results of our computational experience show that the algorithm finds or improves the best known results reported in the literature within reasonable computational time.

U2 - 10.1057/jors.2012.24

DO - 10.1057/jors.2012.24

M3 - Article

VL - 64

SP - 402

EP - 409

JO - Journal of the Operational Research Society

JF - Journal of the Operational Research Society

SN - 0160-5682

IS - 3

ER -