Pages that link to "Item:Q1266618"
From MaRDI portal
The following pages link to A fast and effective heuristic for the orienteering problem (Q1266618):
Displayed 50 items.
- The clustered orienteering problem (Q296772) (← links)
- Efficient meta-heuristics for the multi-objective time-dependent orienteering problem (Q323359) (← links)
- Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
- A two-stage approach to the orienteering problem with stochastic weights (Q336923) (← links)
- Solving the orienteering problem with time windows via the pulse framework (Q337360) (← links)
- Multi-directional local search (Q339654) (← links)
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (Q415560) (← links)
- A simulated annealing heuristic for the team orienteering problem with time windows (Q439335) (← links)
- Modeling recreational systems using optimization techniques and information technologies (Q478052) (← links)
- Robust UAV mission planning (Q490224) (← links)
- The orienteering problem: a survey (Q617509) (← links)
- The orienteering problem with stochastic travel and service times (Q646634) (← links)
- Heuristics for the multi-period orienteering problem with multiple time windows (Q732904) (← links)
- Iterated local search for the team orienteering problem with time windows (Q833556) (← links)
- Heuristic algorithms for visiting the customers in a rolling schedule environment (Q850656) (← links)
- The effective application of a new approach to the generalized orienteering problem (Q972648) (← links)
- A path relinking approach for the team orienteering problem (Q975993) (← links)
- The team orienteering problem (Q1266617) (← links)
- Managing platelet supply through improved routing of blood collection vehicles (Q1651648) (← links)
- An efficient evolutionary algorithm for the orienteering problem (Q1652505) (← links)
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
- Application of fuzzy optimization to the orienteering problem (Q1750202) (← links)
- Solving the stochastic time-dependent orienteering problem with time windows (Q1751260) (← links)
- A TABU search heuristic for the team orienteering problem (Q1764755) (← links)
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697) (← links)
- Coupling ant colony systems with strong local searches (Q1926808) (← links)
- Column generation based heuristics for a generalized location routing problem with profits arising in space exploration (Q1926985) (← links)
- A Tabu search algorithm for the probabilistic orienteering problem (Q2026967) (← links)
- A biased random-key genetic algorithm for the set orienteering problem (Q2030452) (← links)
- Optimal joint maintenance and orienteering strategy for complex mission-oriented systems: a case study in offshore wind energy (Q2108109) (← links)
- Boosting ant colony optimization via solution prediction and machine learning (Q2147035) (← links)
- Time dependent orienteering problem with time windows and service time dependent profits (Q2147060) (← links)
- UAV routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections (Q2147172) (← links)
- Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem (Q2158007) (← links)
- Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach (Q2184040) (← links)
- An iterative three-component heuristic for the team orienteering problem with time windows (Q2255940) (← links)
- A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times (Q2270448) (← links)
- The multi-visit team orienteering problem with precedence constraints (Q2282540) (← links)
- Capacitated ring arborescence problems with profits (Q2284638) (← links)
- Research on a novel minimum-risk model for uncertain orienteering problem based on uncertainty theory (Q2318262) (← links)
- An effective PSO-inspired algorithm for the team orienteering problem (Q2355862) (← links)
- A fast solution method for the time-dependent orienteering problem (Q2356249) (← links)
- A guided local search metaheuristic for the team orienteering problem (Q2378455) (← links)
- Evolution-inspired local improvement algorithm solving orienteering problem (Q2399337) (← links)
- The time-dependent orienteering problem with time windows: a fast ant colony system (Q2400030) (← links)
- Ants can orienteer a thief in their robbery (Q2661549) (← links)
- A dynamic and probabilistic orienteering problem (Q2669558) (← links)
- A two-stage vehicle routing model for large-scale bioterrorism emergencies (Q3057125) (← links)
- An iterated local search algorithm for the team orienteering problem with variable profits (Q5058860) (← links)
- The orienteering problem with variable profits (Q5326782) (← links)