Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
475880 | Computers & Operations Research | 2009 | 9 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Güneş Erdoğan, Jean-François Cordeau, Gilbert Laporte,