A heuristic for the pickup and delivery traveling salesman problem

DOI10.1016/S0305-0548(99)00066-0zbMath0957.90030OpenAlexW2061233155MaRDI QIDQ1571039

Jamal Ouenniche, Fayez F. Boctor, Jacques Renaud

Publication date: 9 July 2000

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

Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00066-0

zbMATH Keywords

heuristicsimprovement procedurepickup and delivery traveling salesman problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Related Items

A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem, Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem, The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm, A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping, Method of scaling in approximate solution of the traveling salesman problem, Self-organizing feature maps for the vehicle routing problem with backhauls, Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints, An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading, The tree representation for the pickup and delivery traveling salesman problem with LIFO loading, A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem, Collaborative transportation planning of less-than-truckload freight, The pickup and delivery traveling salesman problem with handling costs, EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM, The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms, The pickup and delivery traveling salesman problem with first-in-first-out loading, Request evaluation strategies for carriers in auction-based collaborations, The multi-commodity one-to-one pickup-and-delivery traveling salesman problem, Shipper collaboration in forward and reverse logistics, Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading, An efficient genetic algorithm for the traveling salesman problem with precedence constraints, Perturbation heuristics for the pickup and delivery traveling salesman problem

Uses Software

• TSPLIB

Cites Work

• Solution of large-scale symmetric travelling salesman problems
• An efficient implementation of local search algorithms for constrained routing problems
• An algorithm for the traveling salesman problem with pickup and delivery customers
• A new extension of local search applied to the Dial-A-Ride problem
• k-interchange procedures for local search in a precedence-constrained routing problem
• The traveling salesman problem with backhauls
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• TSPLIB—A Traveling Salesman Problem Library
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• The General Pickup and Delivery Problem
• An Effective Tour Construction and Improvement Procedure for the Traveling Salesman Problem
• A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
• Computer Solutions of the Traveling Salesman Problem