An Improved Petal Heuristic for the Vehicle Routeing Problem

DOI10.1057/jors.1996.29zbMath0851.90032OpenAlexW1970715343MaRDI QIDQ4887791

Jacques Renaud, Gilbert Laporte, Fayez F. Boctor

Publication date: 5 August 1996

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1996.29

zbMATH Keywords

heuristicslocal searchvehicle routeingpetal method

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (26)

A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem ⋮ A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem ⋮ Thirty years of heterogeneous vehicle routing ⋮ The multi-depot vehicle routing problem with inter-depot routes ⋮ Managing platelet supply through improved routing of blood collection vehicles ⋮ Routing problems: A bibliography ⋮ A tabu search heuristic for the multi-depot vehicle routing problem ⋮ An efficient variable neighborhood search heuristic for very large scale vehicle routing problems ⋮ A hybrid adaptive large neighborhood search heuristic for the team orienteering problem ⋮ A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes ⋮ Vehicle routing on road networks: how good is Euclidean approximation? ⋮ The open vehicle routing problem with decoupling points ⋮ Efficient frameworks for greedy split and new depth first search split procedures for routing problems ⋮ Optimised crossover genetic algorithm for capacitated vehicle routing problem ⋮ Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand ⋮ Heuristics for vehicle routing problems: sequence or set optimization? ⋮ Heuristics for the lexicographic Max-ordering vehicle routing problem ⋮ The balanced billing cycle vehicle routing problem ⋮ Industrial aspects and literature survey: fleet composition and routing ⋮ A Novel Discrete Differential Evolution Algorithm for the Vehicle Routing Problem in B2C E-Commerce ⋮ A survey on matheuristics for routing problems ⋮ Extensions to the generalised assignment heuristic for vehicle routing ⋮ A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem ⋮ New Notation and Classification Scheme for Vehicle Routing Problems ⋮ A sweep-based algorithm for the fleet size and mix vehicle routing problem ⋮ A genetic algorithm for the vehicle routing problem

This page was built for publication: An Improved Petal Heuristic for the Vehicle Routeing Problem