Traveling salesman problem;
Pickup and delivery;
First-in-first-out;
Integer programming;
Tabu search;
Iterated local search;
HEURISTICS;
ALGORITHM;
SEARCH;
LIFO;
D O I:
10.1016/j.cor.2008.05.005
中图分类号:
TP39 [计算机的应用];
学科分类号:
081203 ;
0835 ;
摘要:
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. (C) 2008 Elsevier Ltd. All rights reserved.