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

DOI10.1016/S0305-0548(96)00065-2zbMATH Open0882.90031MaRDI QIDQ1362944FDOQ1362944

Bruce Golden, G. Laporte, Éric D. Taillard

Publication date: 10 March 1998

Published in: Computers \& Operations Research (Search for Journal in Brave)

Recommendations

• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A Tabu Search Heuristic for the Vehicle Routing Problem
• scientific article; zbMATH DE number 1082107
• Vehicle Routeing with Multiple Use of Vehicles

zbMATH Keywords

heuristictabu searchvehicle routingminmax objective

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cites Work

• The vehicle routing problem: An overview of exact and approximate algorithms
• Title not available (Why is that?)
• 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
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Title not available (Why is that?)
• Vehicle Routeing with Multiple Use of Vehicles
• The m-Traveling Salesman Problem with Minmax Objective

Cited In (25)

• A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length
• EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM
• An approximation algorithm for vehicle routing with compatibility constraints
• Solving the vehicle routing problem with adaptive memory programming methodology
• A multi-start algorithm for a balanced real-world open vehicle routing problem
• A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty
• A matheuristic for the MinMax capacitated open vehicle routing problem
• Planning sustainable routes: economic, environmental and welfare concerns
• A GA based heuristic for the vehicle routing problem with multiple trips
• A lexicographic minimax approach to the vehicle routing problem with route balancing
• Home health care facility location problem under demand uncertainty
• A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing
• A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
• Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach
• A min-max vehicle routing problem with split delivery and heterogeneous demand
• Greedy random adaptive memory programming search for the capacitated clustering problem
• The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
• A self-tuning heuristic for a multi-objective vehicle routing problem
• A TABU search heuristic for the team orienteering problem
• A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
• Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data
• Adaptive memory programming: a unified view of metaheuristics
• A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
• A framework for the description of evolutionary algorithms
• A hybrid chaos-particle swarm optimization algorithm for the vehicle routing problem with time window

Uses Software

• VRP

This page was built for publication: An adaptive memory heuristic for a class of vehicle routing problems with minmax objective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362944)