GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows
From MaRDI portal
(Redirected from Publication:6079871)
Cites work
- A branch-and-cut algorithm for the team orienteering problem
- A robust optimization approach for humanitarian needs assessment planning under travel time uncertainty
- An adaptive large neighbourhood search for asset protection during escaped wildfires
- An effective PSO-inspired algorithm for the team orienteering problem
- An exact algorithm for team orienteering problems
- An iterative three-component heuristic for the team orienteering problem with time windows
- Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
- Dynamic rerouting of vehicles during cooperative wildfire response operations
- Greedy randomized adaptive search procedures
- Heuristic solutions for the vehicle routing problem with time windows and synchronized visits
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- Iterated local search for the team orienteering problem with time windows
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Solving routing problems with pairwise synchronization constraints
- Solving the team orienteering problem with cutting planes
- The capacitated team orienteering and profitable tour problems
- The clustered team orienteering problem
- The team orienteering problem
- The Transitive Reduction of a Directed Graph
Cited in
(6)- Enhanced iterated local search for the technician routing and scheduling problem
- A cooperative team orienteering optimisation model and a customised resolution metaheuristic
- Designing a sports orienteering contest: physical versus cognitive skills in rogaining
- A mathheuristic approach for the vehicle routing problem with queuing considerations
- Branch-price-and-cut algorithms for the team orienteering problem with interval-varying profits
- Scheduling and routing with degradation-triggered job arrivals: an application to forest firefighting with an unmanned aerial vehicle fleet
This page was built for publication: GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6079871)