Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs

DOI10.1016/j.cor.2011.07.013zbMath1251.90316OpenAlexW2106831393MaRDI QIDQ1762084

Daniele Vigo, Maria Battarra, Gilbert Laporte, Güneş Erdoğan

Publication date: 15 November 2012

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

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

zbMATH Keywords

metaheuristicstraveling salesman problempickup and delivery\texttt{ITS}handling cost

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

The pickup and delivery problem with time windows, multiple stacks, and handling operations, The multiple vehicle pickup and delivery problem with LIFO constraints, A hybrid approach for the vehicle routing problem with three-dimensional loading constraints, A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading, The pickup and delivery problem with time windows and handling operations, Comments on: Routing problems with loading constraints, A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs, Route choice model considering generalized travel cost based on game theory, The pickup and delivery traveling salesman problem with handling costs, The vehicle routing problem with simultaneous pickup and delivery and handling costs

Cites Work

• Routing problems with loading constraints
• Comments on: Routing problems with loading constraints
• General solutions to the single vehicle routing problem with pickups and deliveries
• The pickup and delivery traveling salesman problem with first-in-first-out loading
• Lasso solution strategies for the vehicle routing problem with pickups and deliveries
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• Heuristics for the traveling salesman problem with pickup and delivery
• The travelling salesman problem with pick-up and delivery
• Future paths for integer programming and links to artificial intelligence
• 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
• Exact solutions to the double travelling salesman problem with multiple stacks
• One-to-Many-to-One Single Vehicle Pickup and Delivery Problems
• Unnamed Item
• Unnamed Item