Orienteering problem: a survey of recent variants, solution approaches and applications
DOI10.1016/j.ejor.2016.04.059zbMath1346.90703OpenAlexW2346699423MaRDI QIDQ323527
Hoong Chuin Lau, Aldy Gunawan, Pieter Vansteenwegen
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://ink.library.smu.edu.sg/sis_research/3271
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items (84)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An iterated local search algorithm for the single-vehicle cyclic inventory routing problem
- The clustered orienteering problem
- A priori orienteering with time windows and stochastic wait times at customers
- A matheuristic for the team orienteering arc routing problem
- The multi-district team orienteering problem
- A two-stage approach to the orienteering problem with stochastic weights
- Solving the orienteering problem with time windows via the pulse framework
- A branch-and-cut algorithm for the orienteering arc routing problem
- The capacitated team orienteering problem with incomplete service
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
- A simulated annealing heuristic for the team orienteering problem with time windows
- Approximation algorithms for the arc orienteering problem
- A worst-case analysis for the split delivery capacitated team orienteering problem with minimum delivery amounts
- The orienteering problem: a survey
- The orienteering problem with stochastic travel and service times
- Heuristics for the multi-period orienteering problem with multiple time windows
- Iterated local search for the team orienteering problem with time windows
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
- A memetic algorithm for the team orienteering problem
- The effective application of a new approach to the generalized orienteering problem
- The attractive traveling salesman problem
- The fleet size and mix problem for capacitated arc routing
- The team orienteering problem
- A fast and effective heuristic for the orienteering problem
- Approximation algorithms for time-dependent orienteering.
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search
- Coupling ant colony systems with strong local searches
- Optimal solutions for routing problems with profits
- The capacitated team orienteering problem: a bi-level filter-and-fan method
- An iterative three-component heuristic for the team orienteering problem with time windows
- An effective PSO-inspired algorithm for the team orienteering problem
- A fast solution method for the time-dependent orienteering problem
- An exact algorithm for team orienteering problems
- A memetic algorithm for the orienteering problem with hotel selection
- The split delivery capacitated team orienteering problem
- Optimization Approaches for Solving Chance Constrained Stochastic Orienteering Problems
- Exploiting Tabu Search Memory in Constrained Problems
- The Team Orienteering Problem: Formulations and Branch-Cut and Price
- Vehicle Routing
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
- The capacitated team orienteering and profitable tour problems
- Integer Programming Formulation of Traveling Salesman Problems
- Using a Genetic Algorithm to Solve the Generalized Orienteering Problem
- Locating a cycle in a transportation or a telecommunications network
- The orienteering problem
- The Orienteering Problem with Time Windows
- TSPLIB—A Traveling Salesman Problem Library
- Solving the Orienteering Problem through Branch-and-Cut
- Generalized orienteering problem with resource dependent rewards
- A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
- A Fictitious Play Approach to Large-Scale Optimization
- The orienteering problem with variable profits
- A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem
- Ejection chain and filter-and-fan methods in combinatorial optimization
This page was built for publication: Orienteering problem: a survey of recent variants, solution approaches and applications