The pickup and delivery traveling salesman problem with first-in-first-out loading

DOI10.1016/j.cor.2008.05.005zbMath1179.90280OpenAlexW2010102206MaRDI QIDQ1000960

Jean-François Cordeau, Gilbert Laporte, Güneş Erdoğan

Publication date: 12 February 2009

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

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

zbMATH Keywords

integer programmingtabu searchtraveling salesman problemfirst-in-first-outpickup and deliveryiterated local search

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial optimization (90C27)

Related Items

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, Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints, Routing problems with loading constraints, Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system, The pickup and delivery traveling salesman problem with handling costs, The traveling salesman problem with draft limits, Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs, Vehicle routing problems with loading constraints: state-of-the-art and future directions, Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• An efficient implementation of local search algorithms for constrained routing problems
• An algorithm for the traveling salesman problem with pickup and delivery customers
• Heuristics for the traveling salesman problem with pickup and delivery
• 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
• Optimal routing of multiple-load AGV subject to LIFO loading constraints
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
• Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
• An Additive Bounding Procedure for Combinatorial Optimization Problems
• TSPLIB—A Traveling Salesman Problem Library
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• An Analysis of Several Heuristics for the Traveling Salesman Problem