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):

Displaying 23 items.

• A multi-start algorithm for a balanced real-world open vehicle routing problem (Q296700) (← links)
• A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing (Q357949) (← links)
• A min-max vehicle routing problem with split delivery and heterogeneous demand (Q376008) (← links)
• Greedy random adaptive memory programming search for the capacitated clustering problem (Q707129) (← links)
• A hybrid chaos-particle swarm optimization algorithm for the vehicle routing problem with time window (Q742692) (← 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 largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty (Q1634054) (← links)
• A TABU search heuristic for the team orienteering problem (Q1764755) (← links)
• Planning sustainable routes: economic, environmental and welfare concerns (Q2140143) (← links)
• A lexicographic minimax approach to the vehicle routing problem with route balancing (Q2282498) (← links)
• An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← 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)
• A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2514732) (← links)
• Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach (Q2668611) (← links)
• EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM (Q3580197) (← links)
• Adaptive memory programming: a unified view of metaheuristics (Q5954822) (← links)
• A matheuristic for the MinMax capacitated open vehicle routing problem (Q6066715) (← links)
• Home health care facility location problem under demand uncertainty (Q6620392) (← links)