An adaptive memory heuristic for a class of vehicle routing problems with minmax objective

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)

zbMATH Keywords

tabu search; vehicle routing; heuristic; minmax objective

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

Related Items

Adaptive memory programming: a unified view of metaheuristics, A multi-start algorithm for a balanced real-world open vehicle routing problem, 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, Greedy random adaptive memory programming search for the capacitated clustering problem, A hybrid chaos-particle swarm optimization algorithm for the vehicle routing problem with time window, The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations, A GA based heuristic for the vehicle routing problem with multiple trips, A multi-phase constructive heuristic for the vehicle routing problem with multiple trips., A framework for the description of evolutionary algorithms, A TABU search heuristic for the team orienteering problem, Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data, 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, A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem, EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM

Uses Software

• VRP

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