Pages that link to "Item:Q1362944"

The following pages link to An adaptive memory heuristic for a class of vehicle routing problems with minmax objective (Q1362944):

Displayed 10 items.

• Greedy random adaptive memory programming search for the capacitated clustering problem (Q707129) ‎ (← links)
• The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations (Q814246) ‎ (← links)
• A GA based heuristic for the vehicle routing problem with multiple trips (Q928681) ‎ (← links)
• A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. (Q1417560) ‎ (← links)
• A framework for the description of evolutionary algorithms (Q1584807) ‎ (← links)
• A TABU search heuristic for the team orienteering problem (Q1764755) ‎ (← links)
• Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data (Q2433556) ‎ (← links)
• A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length (Q2495966) ‎ (← links)
• A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (Q2496041) ‎ (← links)
• Adaptive memory programming: a unified view of metaheuristics (Q5954822) ‎ (← links)