A Repeated Matching Heuristic for the Vehicle Routeing Problem

DOI10.1057/JORS.1994.185MaRDI QIDQ4319782zbMATH OpenOpenAlexFDO

Authors

Publication date 12 January 1995

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

zbMATH Keywords

heuristicrepeated matchingvehicle routeing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Recommendations

• A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing
• Vehicle Routeing with Multiple Use of Vehicles
• A guide to vehicle routing heuristics
• A Tabu Search Heuristic for the Vehicle Routing Problem
• scientific article; zbMATH DE number 4181146

Cited in

(11)

• An exact algorithm for the capacitated facility location problems with single sourcing
• Aircrew schedule generation using repeated matching
• A repeated matching heuristic for the single-source capacitated facility location problem
• Use of the BATA algorithm and MIS to solve the mail carrier problem
• A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing
• Semi-greedy heuristics: An empirical study
• Routing problems: A bibliography
• DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
• A stochastic optimization approach for staff scheduling decisions at inpatient units
• Evaporation and transport of non-dilute, multi-component liquid mixtures in porous wicks: simulation and experimental validation
• \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care

This page was built for publication: A Repeated Matching 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 Q4319782)