A library of local search heuristics for the vehicle routing problem
From MaRDI portal
Publication:708775
DOI10.1007/s12532-010-0013-5zbMath1230.90033OpenAlexW1994940434MaRDI QIDQ708775
Chris Groër, Bruce L. Golden, Edward A. Wasil
Publication date: 14 October 2010
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-010-0013-5
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
The vehicle rescheduling problem, An iterated tabu search for the multi-compartment vehicle routing problem, An open source spreadsheet solver for vehicle routing problems, A multi-phase heuristic for the production routing problem, A two-phase hybrid heuristic algorithm for the capacitated location-routing problem, A two-phase solution algorithm for the flexible periodic vehicle routing problem, A critical analysis of the “improved Clarke and Wright savings algorithm”, A survey of the standard location-routing problem, A novel approach to solve the split delivery vehicle routing problem, A two-phase heuristic algorithm for the problem of scheduling and vehicle routing for delivery of medication to patients, Knowledge-guided local search for the vehicle routing problem, Routing by ranking: a link analysis method for the constrained dial-a-ride problem, BPPLIB: a library for bin packing and cutting stock problems, A cooperative parallel metaheuristic for the capacitated vehicle routing problem, A unified solution framework for multi-attribute vehicle routing problems, OAR lib: an open source arc routing library, VRPH, Analysis of effective sets of routes for the split-delivery periodic inventory routing problem, 2DPackLib: a two-dimensional cutting and packing library, A matheuristic for the truck and trailer routing problem
Uses Software
Cites Work
- Optimization by Simulated Annealing
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- On the capacitated vehicle routing problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- Probabilistic diversification and intensification in local search for vehicle routing
- Benchmarks for basic scheduling problems
- A user's guide to tabu search
- Very large-scale vehicle routing: new test problems, algorithms, and results
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
- TSPLIB—A Traveling Salesman Problem Library
- Parallel iterative search methods for vehicle routing problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
