An Improved Petal Heuristic for the Vehicle Routeing Problem
From MaRDI portal
DOI10.1057/JORS.1996.29zbMATH Open0851.90032OpenAlexW1970715343MaRDI QIDQ4887791FDOQ4887791
Jacques Renaud, G. Laporte, Fayez F. Boctor
Publication date: 5 August 1996
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1996.29
Recommendations
Cited In (28)
- Heuristics for vehicle routing problems: sequence or set optimization?
- A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem
- The balanced billing cycle vehicle routing problem
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- New Notation and Classification Scheme for Vehicle Routing Problems
- Optimised crossover genetic algorithm for capacitated vehicle routing problem
- A new fuzzy approach of vehicle routing problem for disaster-stricken zones
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems
- A genetic algorithm for the vehicle routing problem
- A novel discrete differential evolution algorithm for the vehicle routing problem in B2C e-commerce
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
- Industrial aspects and literature survey: fleet composition and routing
- Thirty years of heterogeneous vehicle routing
- A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- Vehicle routing on road networks: how good is Euclidean approximation?
- The multi-depot vehicle routing problem with inter-depot routes
- Routing problems: A bibliography
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
- The open vehicle routing problem with decoupling points
- Managing platelet supply through improved routing of blood collection vehicles
- Extensions to the generalised assignment heuristic for vehicle routing
- A tabu search heuristic for the multi-depot vehicle routing problem
- Heuristics for the lexicographic Max-ordering vehicle routing problem
- Extensions of the Petal Method for Vehicle Routeing
- A survey on matheuristics for routing problems
- A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem
This page was built for publication: An Improved Petal Heuristic for the Vehicle Routeing Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887791)
