Pages that link to "Item:Q2378455"
From MaRDI portal
The following pages link to A guided local search metaheuristic for the team orienteering problem (Q2378455):
Displaying 42 items.
- The selective vehicle routing problem in a collaborative environment (Q322478) (← links)
- Solving the team orienteering problem with cutting planes (Q342446) (← 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)
- Optimized load planning of trains in intermodal transportation (Q443814) (← links)
- How to park freight trains on rail-rail transshipment yards: the train location problem (Q443824) (← links)
- Local search for the undirected capacitated arc routing problem with profits (Q531469) (← links)
- The orienteering problem: a survey (Q617509) (← links)
- Heuristics for the multi-period orienteering problem with multiple time windows (Q732904) (← links)
- On the tour planning problem (Q763203) (← links)
- Iterated local search for the team orienteering problem with time windows (Q833556) (← links)
- A path relinking approach for the team orienteering problem (Q975993) (← links)
- Planning in tourism and public transportation. Attraction selection by means of a personalised electronic tourist guide and train transfer scheduling (Q1041406) (← links)
- Managing platelet supply through improved routing of blood collection vehicles (Q1651648) (← links)
- A VNS approach to multi-location inventory redistribution with vehicle routing (Q1652123) (← links)
- The vehicle routing problem with service level constraints (Q1681277) (← links)
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
- A general framework for assessing the value of social data for disaster response logistics planning (Q1750460) (← links)
- Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans (Q1761229) (← links)
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697) (← links)
- Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem (Q2027061) (← links)
- Consistent vehicle routing with pickup decisions -- insights from sport academy training transfers (Q2076943) (← links)
- Algorithm selection for the team orienteering problem (Q2163778) (← links)
- An effective hybrid search algorithm for the multiple traveling repairman problem with profits (Q2171586) (← links)
- Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach (Q2184040) (← links)
- An effective PSO-inspired algorithm for the team orienteering problem (Q2355862) (← links)
- The multi-vehicle profitable pickup and delivery problem (Q2362250) (← links)
- Evolution-inspired local improvement algorithm solving orienteering problem (Q2399337) (← links)
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (Q2664363) (← links)
- Trip planning for visitors in a service system with capacity constraints (Q2676374) (← links)
- A two-stage vehicle routing model for large-scale bioterrorism emergencies (Q3057125) (← links)
- An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations (Q3065626) (← links)
- Some aspects on solving transportation problem (Q3388797) (← links)
- An iterated local search algorithm for the team orienteering problem with variable profits (Q5058860) (← links)
- The orienteering problem with variable profits (Q5326782) (← links)
- A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem (Q5357744) (← links)
- Solving the team orienteering problem with nonidentical agents: A Lagrangian approach (Q6065837) (← links)
- Variable neighborhood search to solve the generalized orienteering problem (Q6070415) (← links)
- The bus sightseeing problem (Q6080627) (← links)
- Applying topological data analysis to local search problems (Q6154230) (← links)
- A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application (Q6191670) (← links)
- Solving the stochastic team orienteering problem: comparing simheuristics with the sample average approximation method (Q6495385) (← links)