A TSSP+1 decomposition strategy for the vehicle routing problem
From MaRDI portal
Publication:1342652
DOI10.1016/0377-2217(94)90063-9zbMath0813.90038OpenAlexW2093657312MaRDI QIDQ1342652
Rekha Pillai, Charles E. Noon, John Mittenthal
Publication date: 12 January 1995
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90063-9
Lagrangian relaxationset partitioningdecomposition strategycapacity-constrained vehicle routingtraveling salesman subset-tour problem
Related Items
A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem ⋮ A stabilized column generation scheme for the traveling salesman subtour problem
Uses Software
Cites Work
- A Lagrangean relaxation heuristic for vehicle routing
- The selective travelling salesman problem
- Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
- Algorithms to solve the orienteering problem: A comparison
- Strong linear programming relaxations for the orienteering problem
- The orienteering problem
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint
- An Integer Programming Approach to the Vehicle Scheduling Problem
- Implementing vehicle routing algorithms
- Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
- A generalized exchange heuristic for the capacitated vehicle routing problem
- A set‐partitioning‐based exact algorithm for the vehicle routing problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Unnamed Item
