The Orienteering Problem with Time Windows
From MaRDI portal
Recommendations
- Solving the orienteering problem with time windows via the pulse framework
- The orienteering problem with variable profits
- An iterative three-component heuristic for the team orienteering problem with time windows
- A matheuristic approach to the orienteering problem with service time dependent profits
- Heuristics for the multi-period orienteering problem with multiple time windows
Cited in
(40)- A fast and effective heuristic for the orienteering problem
- The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
- A matheuristic approach to the orienteering problem with service time dependent profits
- Bi-objective orienteering for personal activity scheduling
- Formulations for the orienteering problem with additional constraints
- Solving the stochastic time-dependent orienteering problem with time windows
- Attractive orienteering problem with proximity and timing interactions
- Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search
- Coupling ant colony systems with strong local searches
- The synchronized multi-assignment orienteering problem
- Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
- An iterative three-component heuristic for the team orienteering problem with time windows
- A fast solution method for the time-dependent orienteering problem
- The time-dependent orienteering problem with time windows: a fast ant colony system
- The orienteering problem with time windows applied to robotic melon harvesting
- Orienteering problem with time-windows and updating delay
- Trip planning for visitors in a service system with capacity constraints
- Orienteering problem: a survey of recent variants, solution approaches and applications
- The multi-district team orienteering problem
- Scheduled penalty variable neighborhood search
- Solving the orienteering problem with time windows via the pulse framework
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
- Solving relaxation orienteering problem using DCA-CUT
- The directed orienteering problem
- Combining incomplete search and clause generation: an application to the orienteering problems with time windows
- Planning robust drone-truck delivery routes under road traffic uncertainty
- The orienteering problem: a survey
- The hazardous orienteering problem
- A cooperative team orienteering optimisation model and a customised resolution metaheuristic
- An effective hybrid evolutionary algorithm for the clustered orienteering problem
- Route recombination for deterministic and non-deterministic orienteering problems with time windows: a dynamic programming approach
- Multi-start heuristics for unit-capacity orienteering problems
- The team orienteering problem with variable time windows
- An effective multi-level memetic search with neighborhood reduction for the clustered team orienteering problem
- Domain-independent dynamic programming
- Heuristics for the multi-period orienteering problem with multiple time windows
- The orienteering problem with heterogeneous drones
- 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
This page was built for publication: The Orienteering Problem with Time Windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4014327)