Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading

DOI10.1016/j.cor.2009.08.003zbMath1177.90336OpenAlexW2033271291WikidataQ59222254 ScholiaQ59222254MaRDI QIDQ1046716

Jean-François Cordeau, Manuel Iori, Mauro Dell'Amico

Publication date: 22 December 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.08.003

zbMATH Keywords

traveling salesman problembranch-and-cutpickup and deliveryFIFO loading

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items

TSP race: minimizing completion time in time-sensitive applications, A hybrid approach for the vehicle routing problem with three-dimensional loading constraints, Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks, Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading, A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks, A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks, Routing problems with loading constraints, Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system, Efficient algorithms for the double traveling salesman problem with multiple stacks, Vehicle routing problems with loading constraints: state-of-the-art and future directions, New Imperialist Competitive Algorithm to solve the travelling salesman problem

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• The pickup and delivery traveling salesman problem with first-in-first-out loading
• An algorithm for the traveling salesman problem with pickup and delivery customers
• The pickup and delivery problem: Faces and branch-and-cut algorithm
• A new extension of local search applied to the Dial-A-Ride problem
• A heuristic for the pickup and delivery traveling salesman problem
• Perturbation heuristics for the pickup and delivery traveling salesman problem
• The precedence-constrained asymmetric traveling salesman polytope
• Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading