The dynamic team orienteering problem
From MaRDI portal
Cites work
- A general framework for assessing the value of social data for disaster response logistics planning
- A general vehicle routing problem
- A heuristic for the multiple tour maximum collection problem
- A review of dynamic vehicle routing problems
- A simulated annealing heuristic for the team orienteering problem with time windows
- A TABU search heuristic for the team orienteering problem
- An effective PSO-inspired algorithm for the team orienteering problem
- An iterative three-component heuristic for the team orienteering problem with time windows
- Ant colony system for a dynamic vehicle routing problem
- Dynamic transportation of patients in hospitals
- Heuristics for the multi-period orienteering problem with multiple time windows
- scientific article; zbMATH DE number 6676558 (Why is no real title available?)
- Iterated local search for the team orienteering problem with time windows
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Partially dynamic vehicle routing—models and algorithms
- Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
- Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review
- The orienteering problem: a survey
- The team orienteering problem
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search
This page was built for publication: The dynamic team orienteering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6981694)