The Pickup And Delivery Traveling Salesman Problem With First-in-first-out Loading

摘要

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.