Pages that link to "Item:Q415560"

The following pages link to Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (Q415560):

Displaying 23 items.

• 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)
• Heuristics for the time dependent team orienteering problem: application to tourist route planning (Q337623) (← links)
• A memetic algorithm for the team orienteering problem (Q972625) (← links)
• A path relinking approach for the team orienteering problem (Q975993) (← links)
• Bi-objective orienteering for personal activity scheduling (Q1652268) (← links)
• An effective large neighborhood search for the team orienteering problem with time windows (Q1691647) (← 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)
• 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)
• A Tabu search algorithm for the probabilistic orienteering problem (Q2026967) (← links)
• Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach (Q2080825) (← links)
• The synchronized multi-assignment orienteering problem (Q2097466) (← links)
• An iterative three-component heuristic for the team orienteering problem with time windows (Q2255940) (← links)
• Multi-period orienteering with uncertain adoption likelihood and waiting at customers (Q2282513) (← 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)
• An iterated local search algorithm for the team orienteering problem with variable profits (Q5058860) (← links)
• Genetic Algorithm with Path Relinking for the Orienteering Problem with Time Windows (Q5259301) (← links)
• The bus sightseeing problem (Q6080627) (← links)
• Centralized multi-visitor trip planning with activity reservations in crowded destinations (Q6568443) (← links)