An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections

DOI10.1002/net.10079zbMath1023.90050OpenAlexW2105006450MaRDI QIDQ4422622

Aristide Mingozzi, Roberto Baldacci, Eleni Hadjiconstantinou

Publication date: 20 August 2003

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.10079

zbMATH Keywords

branch and cuttraveling salesman problemvalid inequalitiesdelivery and collection

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (14)

TSP race: minimizing completion time in time-sensitive applications ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping ⋮ Decentralized production-distribution planning in multi-echelon supply chain network using intelligent agents ⋮ Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search ⋮ One-to-Many-to-One Single Vehicle Pickup and Delivery Problems ⋮ A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows ⋮ A new VRPPD model and a hybrid heuristic solution approach for e-tailing ⋮ Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking ⋮ The multi-commodity pickup-and-delivery traveling salesman problem ⋮ Single-commodity vehicle routing problem with pickup and delivery service ⋮ Unified heuristics to solve routing problem of reverse logistics in sustainable supply chain ⋮ IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem ⋮ Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections