The University of Southampton
University of Southampton Institutional Repository

An iterated local search algorithm for the Travelling Salesman Problem with Pickups and Deliveries

An iterated local search algorithm for the Travelling Salesman Problem with Pickups and Deliveries
An iterated local search algorithm for the Travelling Salesman Problem with Pickups and Deliveries
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 metaheuristic 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.
travelling salesman, pickup and delivery, heuristics, iterated local search
0160-5682
Subramanian, A.
f4b37d00-4fa3-4220-9caa-571595e37cb9
Battarra, M.
8d28765a-8e01-4c02-b266-2cc5847d7d77
Subramanian, A.
f4b37d00-4fa3-4220-9caa-571595e37cb9
Battarra, M.
8d28765a-8e01-4c02-b266-2cc5847d7d77

Subramanian, A. and Battarra, M. (2013) An iterated local search algorithm for the Travelling Salesman Problem with Pickups and Deliveries. Journal of the Operational Research Society, 64. (doi:10.1057/jors.2012.24).

Record type: Article

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

Text
jors201224a.html - Other
Restricted to Repository staff only

More information

Accepted/In Press date: May 2012
e-pub ahead of print date: 16 May 2012
Published date: 2013
Keywords: travelling salesman, pickup and delivery, heuristics, iterated local search
Organisations: Operational Research

Identifiers

Local EPrints ID: 338792
URI: http://eprints.soton.ac.uk/id/eprint/338792
ISSN: 0160-5682
PURE UUID: 9ecf22ea-dc29-479c-b9ba-919e95beabb2

Catalogue record

Date deposited: 17 May 2012 11:22
Last modified: 08 Jan 2022 14:57

Export record

Altmetrics

Contributors

Author: A. Subramanian
Author: M. Battarra

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×