The pickup and delivery traveling salesman problem with first-in-first-out loading |
| |
| Authors: | Gü neş Erdoğan,Jean-Franç ois Cordeau,Gilbert Laporte |
| |
| Affiliation: | 1. Canada Research Chair in Logistics and Transportation and CIRRELT, HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7;2. Canada Research Chair in Distribution Management and CIRRELT, HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7 |
| |
| 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: | Traveling salesman problem Pickup and delivery First-in-first-out Integer programming Tabu search Iterated local search |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
