Extensions of the Petal Method for Vehicle Routeing
From MaRDI portal
Publication:5287233
DOI10.1057/jors.1993.54zbMath0804.90043OpenAlexW2015480187MaRDI QIDQ5287233
Curt Hjorring, David M. Ryan, Fred Glover
Publication date: 16 August 1993
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1993.54
Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Use of the BATA algorithm and MIS to solve the mail carrier problem ⋮ A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands ⋮ A choice function hyper-heuristic framework for the allocation of maintenance tasks in Danish railways ⋮ Routing problems: A bibliography ⋮ A multi-space sampling heuristic for the vehicle routing problem with stochastic demands ⋮ Efficient frameworks for greedy split and new depth first search split procedures for routing problems ⋮ Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand ⋮ The column-circular, subsets-selection problem: Complexity and solutions ⋮ A survey on matheuristics for routing problems ⋮ A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem ⋮ Stronger \(K\)-tree relaxations for the vehicle routing problem ⋮ A sweep-based algorithm for the fleet size and mix vehicle routing problem ⋮ An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
