Multi-start heuristics for unit-capacity orienteering problems

DOI10.1007/978-3-031-08623-6_37MaRDI QIDQ6606675zbMATH OpenFDO

Authors Alexander Beckmann, Jürgen Zimmermann

Publication date 17 September 2024

Full work available at URL https://doi.org/10.1007/978-3-031-08623-6_37

zbMATH Keywords

drayage problemorienteering problemunit-capacity

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Heuristics for the multi-period orienteering problem with multiple time windows
• The multi-district team orienteering problem
• A fast and effective heuristic for the orienteering problem
• The Orienteering Problem with Time Windows
• The capacitated team orienteering and profitable tour problems

Cites work

• Heuristic-based truck scheduling for inland container transportation
• Integrated planning of loaded and empty container movements
• Orienteering problem: a survey of recent variants, solution approaches and applications
• The selective travelling salesman problem

This page was built for publication: Multi-start heuristics for unit-capacity orienteering problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606675)