Attractive orienteering problem with proximity and timing interactions

DOI10.1016/J.EJOR.2017.09.025MaRDI QIDQ1754098zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

zbMATH Keywords

heuristicsmathematical modelingorienteering problemOR in entertainmentattractive salesman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)

Recommendations

• The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
• Heuristics for the time dependent team orienteering problem: application to tourist route planning
• On the tour planning problem
• The orienteering problem
• The orienteering problem: a survey

Cites work

• scientific article; zbMATH DE number 1769325 (Why is no real title available?)
• A minimum cost network flow model for the maximum covering and patrol routing problem
• A stabilized column generation scheme for the traveling salesman subtour problem
• A survey on matheuristics for routing problems
• An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint
• An improved formulation for the maximum coverage patrol routing problem
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Principles of scatter search
• The Orienteering Problem with Time Windows
• The attractive traveling salesman problem
• The capacitated team orienteering and profitable tour problems
• The orienteering problem
• The orienteering problem: a survey
• The selective travelling salesman problem
• The team orienteering problem

Cited in

(5)

• Ants can orienteer a thief in their robbery
• A polynomial-time approximation scheme for thief orienteering on directed acyclic graphs
• 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)
• Algorithms for the thief orienteering problem on directed acyclic graphs

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Attractive orienteering problem with proximity and timing interactions

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