Extensions of the Petal Method for Vehicle Routeing

DOI10.1057/JORS.1993.54MaRDI QIDQ5287233zbMATH OpenOpenAlexFDO

Authors David M. Ryan, Curt Hjorring, Fred Glover

Publication date 16 August 1993

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.1993.54

zbMATH Keywords

petal methodshortest path algorithmtraveling salesmanvehicle routeing

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06)

Recommendations

• An Improved Petal Heuristic for the Vehicle Routeing Problem
• The period vehicle routing problem and its extensions
• Extensions to the generalised assignment heuristic for vehicle routing
• Vehicle Routing
• scientific article; zbMATH DE number 3914114
• Path relinking for the vehicle routing problem
• Improved bounds for vehicle routing solutions
• Parallel solution methods for vehicle routing problems
• An exact solution framework for a broad class of vehicle routing problems
• Partially dynamic vehicle routing—models and algorithms

Cited in

(15)

• A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
• Use of the BATA algorithm and MIS to solve the mail carrier problem
• A choice function hyper-heuristic framework for the allocation of maintenance tasks in Danish railways
• Stronger K-tree relaxations for the vehicle routing problem
• A sweep-based algorithm for the fleet size and mix vehicle routing problem
• Routing problems: A bibliography
• The column-circular, subsets-selection problem: Complexity and solutions
• An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
• A survey on matheuristics for routing problems
• A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands
• A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
• Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
• An Improved Petal Heuristic for the Vehicle Routeing Problem
• Efficient frameworks for greedy split and new depth first search split procedures for routing problems
• Assigning airport ground handling operations: a data-driven matheuristic

This page was built for publication: Extensions of the Petal Method for Vehicle Routeing

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