Pages that link to "Item:Q975993"

The following pages link to A path relinking approach for the team orienteering problem (Q975993):

Displaying 36 items.

• A matheuristic for the team orienteering arc routing problem (Q319589) (← links)
• The selective vehicle routing problem in a collaborative environment (Q322478) (← links)
• Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem (Q336737) (← links)
• The multi-district team orienteering problem (Q336760) (← links)
• Solving the team orienteering problem with cutting planes (Q342446) (← 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)
• Local search for the undirected capacitated arc routing problem with profits (Q531469) (← links)
• The orienteering problem: a survey (Q617509) (← links)
• A GRASP with evolutionary path relinking for the truck and trailer routing problem (Q632678) (← 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)
• The vehicle routing problem with service level constraints (Q1681277) (← links)
• Simplified swarm optimization in disassembly sequencing problems with learning effects (Q1761143) (← 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)
• Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem (Q2027061) (← links)
• Algorithm selection for the team orienteering problem (Q2163778) (← 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)
• The multi-vehicle profitable pickup and delivery problem (Q2362250) (← links)
• A guided local search metaheuristic for the team orienteering problem (Q2378455) (← 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)
• Memory and Learning in Metaheuristics (Q2866122) (← links)
• A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem (Q4922922) (← 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 orienteering problem with variable profits (Q5326782) (← links)
• Solving the team orienteering problem with nonidentical agents: A Lagrangian approach (Q6065837) (← links)
• Solving the stochastic team orienteering problem: comparing simheuristics with the sample average approximation method (Q6495385) (← links)
• Route recombination for deterministic and non-deterministic orienteering problems with time windows: a dynamic programming approach (Q6568479) (← links)