An iterated local search heuristic for the capacitated prize-collecting travelling salesman problem

DOI10.1057/palgrave.jors.2602357zbMath1153.90405OpenAlexW2047020140MaRDI QIDQ5387396

Lixin Tang, Xianpeng Wang

Publication date: 9 May 2008

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602357

zbMATH Keywords

iterated local searchcapacitated prize-collecting travelling salesman problemcolour-coating production scheduling

Mathematics Subject Classification ID

Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (3)

Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem ⋮ An efficient optimal solution to the coil sequencing problem in electro-galvanizing line ⋮ A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem

This page was built for publication: An iterated local search heuristic for the capacitated prize-collecting travelling salesman problem