Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants
From MaRDI portal
Publication:1734334
DOI10.1016/j.ejor.2019.01.047zbMath1430.90550OpenAlexW2912308641WikidataQ128449593 ScholiaQ128449593MaRDI QIDQ1734334
Robert Pěnička, Jan Faigl, Martin Saska
Publication date: 27 March 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.01.047
Programming involving graphs or networks (90C35) Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items (6)
Selective generalized travelling salesman problem ⋮ A general variable neighborhood search approach for the minimum load coloring problem ⋮ An adaptive memory matheuristic for the set orienteering problem ⋮ Physician scheduling problem in mobile cabin hospitals of China during Covid-19 outbreak ⋮ A biased random-key genetic algorithm for the set orienteering problem ⋮ Spatial coverage in routing and path planning problems
Cites Work
- The clustered orienteering problem
- Orienteering problem: a survey of recent variants, solution approaches and applications
- The orienteering problem: a survey
- Variable neighborhood search
- The set orienteering problem
- Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
- On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents
- Some Applications of the Generalized Travelling Salesman Problem
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
This page was built for publication: Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants
