An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
From MaRDI portal
Publication:1362944
DOI10.1016/S0305-0548(96)00065-2zbMath0882.90031MaRDI QIDQ1362944
Bruce L. Golden, Gilbert Laporte, Éric D. Taillard
Publication date: 10 March 1998
Published in: Computers \& Operations Research (Search for Journal in Brave)
Related Items
A multi-start algorithm for a balanced real-world open vehicle routing problem, A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty, Planning sustainable routes: economic, environmental and welfare concerns, A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing, A min-max vehicle routing problem with split delivery and heterogeneous demand, Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach, A matheuristic for the MinMax capacitated open vehicle routing problem, Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data, A multi-phase constructive heuristic for the vehicle routing problem with multiple trips., A GA based heuristic for the vehicle routing problem with multiple trips, EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM, A TABU search heuristic for the team orienteering problem, Greedy random adaptive memory programming search for the capacitated clustering problem, A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length, A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem, Adaptive memory programming: a unified view of metaheuristics, A lexicographic minimax approach to the vehicle routing problem with route balancing, A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem, An approximation algorithm for vehicle routing with compatibility constraints, A hybrid chaos-particle swarm optimization algorithm for the vehicle routing problem with time window, A framework for the description of evolutionary algorithms, The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The vehicle routing problem: An overview of exact and approximate algorithms
- Probabilistic diversification and intensification in local search for vehicle routing
- Parallel iterative search methods for vehicle routing problems
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Vehicle Routeing with Multiple Use of Vehicles
- A Tabu Search Heuristic for the Vehicle Routing Problem
- The m-Traveling Salesman Problem with Minmax Objective
