An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint
DOI10.1057/JORS.1992.37zbMATH Open0751.90079OpenAlexW2062493427MaRDI QIDQ4006902FDOQ4006902
John Mittenthal, Charles E. Noon
Publication date: 27 September 1992
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1992.37
Recommendations
- New classes of efficiently solvable generalized traveling salesman problems
- A generalized insertion heuristic for the travelling salesman problem with time windows
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Reoptimizing the traveling salesman problem
- A New Formulation for the Travelling Salesman Problem
Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10)
Cited In (9)
- Heuristic algorithms for visiting the customers in a rolling schedule environment
- Attractive orienteering problem with proximity and timing interactions
- A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem
- The median tour and maximal covering tour problems: Formulations and heuristics
- A fast and effective heuristic for the orienteering problem
- A stabilized column generation scheme for the traveling salesman subtour problem
- Routing problems: A bibliography
- A TSSP+1 decomposition strategy for the vehicle routing problem
- A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs
This page was built for publication: An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4006902)
