Perturbation heuristics for the pickup and delivery traveling salesman problem

DOI10.1016/S0305-0548(00)00109-XzbMath0994.90110MaRDI QIDQ1603311

Gilbert Laporte, Jacques Renaud, Fayez F. Boctor

Publication date: 11 July 2002

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

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

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, Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints, Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem, An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading, Planification des tournées dans le domaine de la messagerie rapide, Models for the single-vehicle preemptive pickup and delivery problem, 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, Recent Models and Algorithms for One-to-One Pickup and Delivery Problems, The pickup and delivery traveling salesman problem with handling costs, EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM, Models and algorithms for the dynamic-demand joint replenishment problem, The pickup and delivery traveling salesman problem with first-in-first-out loading, The multi-commodity one-to-one pickup-and-delivery traveling salesman problem, Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading, Heuristics for the traveling purchaser problem

Uses Software

• TSPLIB
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Simulated annealing: A tool for operational research
• An efficient implementation of local search algorithms for constrained routing problems
• An algorithm for the traveling salesman problem with pickup and delivery customers
• The vehicle routing problem with backhauls
• The pickup and delivery problem with time windows
• The noising method: A new method for combinatorial optimization
• Variable neighborhood search
• A new extension of local search applied to the Dial-A-Ride problem
• A heuristic for the pickup and delivery traveling salesman problem
• The traveling salesman problem with backhauls
• An Exact Method for the Vehicle Routing Problem with Backhauls
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• Pickup and Delivery of Partial Loads with “Soft” Time Windows
• Scheduling Large-Scale Advance-Request Dial-A-Ride Systems
• TSPLIB—A Traveling Salesman Problem Library
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
• An Approximation Algorithm for the Traveling Salesman Problem with Backhauls
• Genetic Algorithms-a Tool for OR?
• The General Pickup and Delivery Problem
• Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP
• A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
• Computer Solutions of the Traveling Salesman Problem
• Algorithmes génétiques hybrides pour l'optimisation combinatoire