Pages that link to "Item:Q833556"
From MaRDI portal
The following pages link to Iterated local search for the team orienteering problem with time windows (Q833556):
Displayed 50 items.
- An iterated local search algorithm for the single-vehicle cyclic inventory routing problem (Q296579) (← 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)
- The multi-district team orienteering problem (Q336760) (← links)
- Scheduled penalty variable neighborhood search (Q337204) (← links)
- Solving the orienteering problem with time windows via the pulse framework (Q337360) (← links)
- A tabu search algorithm for the multi-period inspector scheduling problem (Q337536) (← links)
- Heuristics for the time dependent team orienteering problem: application to tourist route planning (Q337623) (← links)
- The capacitated team orienteering problem with incomplete service (Q375974) (← 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)
- The orienteering problem: a survey (Q617509) (← links)
- ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness (Q670296) (← links)
- Planning in tourism and public transportation. Attraction selection by means of a personalised electronic tourist guide and train transfer scheduling (Q1041406) (← links)
- A matheuristic approach to the orienteering problem with service time dependent profits (Q1622800) (← links)
- A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints (Q1652104) (← links)
- Bi-objective orienteering for personal activity scheduling (Q1652268) (← links)
- An efficient evolutionary algorithm for the orienteering problem (Q1652505) (← links)
- Formulations for the orienteering problem with additional constraints (Q1686508) (← links)
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
- Efficient metaheuristics for the mixed team orienteering problem with time windows (Q1736755) (← links)
- Solving the stochastic time-dependent orienteering problem with time windows (Q1751260) (← 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)
- Anticipative dynamic slotting for attended home deliveries (Q2068855) (← links)
- The synchronized multi-assignment orienteering problem (Q2097466) (← links)
- New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources (Q2106718) (← 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)
- Algorithm selection for the team orienteering problem (Q2163778) (← 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)
- Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times (Q2273657) (← links)
- Capacitated ring arborescence problems with profits (Q2284638) (← links)
- The multi-vehicle profitable pickup and delivery problem (Q2362250) (← links)
- Evolution-inspired local improvement algorithm solving orienteering problem (Q2399337) (← links)
- An iterated local search algorithm for the vehicle routing problem with backhauls (Q2514876) (← links)
- Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows (Q2664372) (← links)
- A reinforcement learning approach to the orienteering problem with time windows (Q2668790) (← links)
- Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion (Q2669719) (← links)
- Trip planning for visitors in a service system with capacity constraints (Q2676374) (← links)
- The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm (Q4995073) (← links)
- An Exact Solution Framework for Multitrip Vehicle-Routing Problems with Time Windows (Q5130490) (← links)
- An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem (Q5174415) (← links)
- Combining incomplete search and clause generation: an application to the orienteering problems with time windows (Q6057284) (← links)
- GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows (Q6079871) (← links)
- The in‐house logistics routing problem (Q6079881) (← links)
- New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule (Q6176400) (← links)