An iterated local search heuristic for the capacitated prize-collecting travelling salesman problem
DOI10.1057/PALGRAVE.JORS.2602357zbMATH Open1153.90405OpenAlexW2047020140MaRDI QIDQ5387396FDOQ5387396
Authors: Lixin Tang, Xianpeng Wang 
Publication date: 9 May 2008
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602357
Recommendations
- A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem
- The prize collecting traveling salesman problem
- A branch-and-cut and MIP-based heuristics for the prize-collecting travelling salesman problem
- On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
- A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection
iterated local searchcapacitated prize-collecting travelling salesman problemcolour-coating production scheduling
Deterministic scheduling theory in operations research (90B35) Search theory (90B40) Production models (90B30)
Cited In (7)
- Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem
- An efficient optimal solution to the coil sequencing problem in electro-galvanizing line
- A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem
- Scheduling of parallel continuous annealing lines with alternative processing modes to optimize efficiency under tardiness constraints
- Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem
- A variable neighborhood search algorithm for cost-balanced travelling salesman problem
- Analysing the run-time behaviour of iterated local search for the travelling salesman problem.
This page was built for publication: An iterated local search heuristic for the capacitated prize-collecting travelling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387396)
