Attractive orienteering problem with proximity and timing interactions
From MaRDI portal
Publication:1754098
DOI10.1016/j.ejor.2017.09.025zbMath1403.90638DBLPjournals/eor/FreemanKC18OpenAlexW2763072691WikidataQ59211858 ScholiaQ59211858MaRDI QIDQ1754098
Nickolas K. Freeman, Burcu B. Keskin, Ịbrahim Çapar
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.09.025
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Ants can orienteer a thief in their robbery ⋮ A reinforcement learning approach to the orienteering problem with time windows ⋮ A new accessibility based team orienteering approach for urban tourism routes optimization (a real life case) ⋮ A polynomial-time approximation scheme for thief orienteering on directed acyclic graphs
Uses Software
Cites Work
- Unnamed Item
- A minimum cost network flow model for the maximum covering and patrol routing problem
- Orienteering problem: a survey of recent variants, solution approaches and applications
- An improved formulation for the maximum coverage patrol routing problem
- The orienteering problem: a survey
- The selective travelling salesman problem
- The attractive traveling salesman problem
- The team orienteering problem
- A stabilized column generation scheme for the traveling salesman subtour problem
- A survey on matheuristics for routing problems
- Principles of scatter search
- The capacitated team orienteering and profitable tour problems
- The orienteering problem
- An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint
- The Orienteering Problem with Time Windows
This page was built for publication: Attractive orienteering problem with proximity and timing interactions
