Pages that link to "Item:Q972625"
From MaRDI portal
The following pages link to A memetic algorithm for the team orienteering problem (Q972625):
Displaying 23 items.
- Heuristic solutions for the vehicle routing problem with time windows and synchronized visits (Q279819) (← links)
- The selective vehicle routing problem in a collaborative environment (Q322478) (← links)
- Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← 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)
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems (Q613510) (← links)
- A memetic algorithm for the team orienteering problem (Q972625) (← links)
- An efficient evolutionary algorithm for the orienteering problem (Q1652505) (← links)
- A general framework for assessing the value of social data for disaster response logistics planning (Q1750460) (← links)
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697) (← 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)
- A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit (Q2196083) (← links)
- An effective PSO-inspired algorithm for the team orienteering problem (Q2355862) (← links)
- A memetic algorithm for the multiperiod vehicle routing problem with profit (Q2355888) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- A memetic algorithm for the orienteering problem with hotel selection (Q2514808) (← links)
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (Q2664363) (← links)
- Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows (Q2664372) (← links)
- Trip planning for visitors in a service system with capacity constraints (Q2676374) (← links)
- Hybrid genetic algorithm for undirected traveling salesman problems with profits (Q6139377) (← links)
- A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application (Q6191670) (← links)