The traveling salesman problem with pickup and delivery and first-in-first-out loading


Erdogan, Gunes, Cordeau, Jean-Francois and Laporte, Gilbert (2009) The traveling salesman problem with pickup and delivery and first-in-first-out loading. Computers & Operations Research, 36, (6), 1800-1808. (doi:10.1016/j.cor.2008.05.005).

Download

Full text not available from this repository.

Description/Abstract

This paper addresses a variation of the traveling salesman problem with pickup and delivery in which loading and unloading operations have to be executed in a first-in-first-out fashion. It provides an integer programming formulation of the problem. It also describes five operators for improving a feasible solution, and two heuristics that utilize these operators: a probabilistic tabu search algorithm, and an iterated local search algorithm. The heuristics are evaluated on data adapted from TSPLIB instances

Item Type: Article
Additional Information: traveling salesman problem, pickup and delivery, first-in-first-out, integer programming, tabu search, iterated local search
ISSNs: 0305-0548 (print)
Subjects: G Geography. Anthropology. Recreation > GA Mathematical geography. Cartography
Divisions: Faculty of Business and Law > Southampton Management School > Management Science
ePrint ID: 204815
Date Deposited: 02 Dec 2011 09:12
Last Modified: 27 Mar 2014 19:48
URI: http://eprints.soton.ac.uk/id/eprint/204815

Actions (login required)

View Item View Item