Load-dependent and precedence-based models for pickup and delivery problems. (November 2015)

• Record Type: Journal Article
• Authors: Gouveia, Luis; Ruthmair, Mario
• Is Part Of: Computers & operations research. Volume 63(2015)
• Page Start: 56
• Page End: 71
• Publication Date: 2015-11
• Subjects: Transportation -- Traveling salesman -- Sequential ordering problem -- Pickup and delivery -- Precedence constraints; Operations research -- Periodicals; Electronic digital computers -- Periodicals; 004.05
• DOI: 10.1016/j.cor.2015.04.008
• Languages: English
• ISSNs: 0305-0548

Abstract

Abstract: We address the one-to-one multi-commodity pickup and delivery traveling salesman problem ( m -PDTSP) which is a generalization of the TSP and arises in several transportation and logistics applications. The objective is to find a minimum-cost directed Hamiltonian path which starts and ends at given depot nodes and such that the demand of each given commodity is transported from the associated source to its destination and the vehicle capacity is never exceeded. In contrast, the many-to-many one-commodity pickup and delivery traveling salesman problem (1-PDTSP) just considers a single commodity and each node can be a source or target for units of this commodity. We show that the m -PDTSP is equivalent to the 1-PDTSP with additional precedence constraints defined by the source–destination pairs for each commodity and explore several models based on this equivalence. In particular, we consider layered graph models for the capacity constraints and introduce new valid inequalities for the precedence relations. Especially for tightly capacitated instances with a large number of commodities our branch-and-cut algorithms outperform the existing approaches. For the uncapacitated m -PDTSP (which is known as the sequential ordering problem) we are able to solve to optimality several open instances from the TSPLIB and SOPLIB. Abstract : Highlights: We present models for pickup and delivery traveling salesman problems. Important relations between different problem variants are shown. New valid inequalities for precedence relations are introduced. Our branch-and-cut algorithms outperform existing approaches. Several open instances for the sequential ordering problem are solved.