Erdogan, Gunes, Cordeau, Jean-Francois and Laporte, Gilbert
The traveling salesman problem with pickup and delivery and first-in-first-out loading
Computers & Operations Research, 36, (6), . (doi:10.1016/j.cor.2008.05.005).
Full text not available from this repository.
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
|Digital Object Identifier (DOI):
||traveling salesman problem, pickup and delivery, first-in-first-out, integer programming, tabu search, iterated local search
||Centre of Excellence for International Banking, Finance & Accounting
||02 Dec 2011 09:12
||18 Apr 2017 01:07
|Further Information:||Google Scholar|
Actions (login required)