A Repeated Matching Heuristic for the Vehicle Routeing Problem
From MaRDI portal
Publication:4319782
DOI10.1057/jors.1994.185zbMath0813.90040OpenAlexW2075620294MaRDI QIDQ4319782
No author found.
Publication date: 12 January 1995
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1994.185
Related Items (9)
\textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care ⋮ Use of the BATA algorithm and MIS to solve the mail carrier problem ⋮ Routing problems: A bibliography ⋮ An exact algorithm for the capacitated facility location problems with single sourcing ⋮ 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 ⋮ Aircrew schedule generation using repeated matching ⋮ A repeated matching heuristic for the single-source capacitated facility location problem
This page was built for publication: A Repeated Matching Heuristic for the Vehicle Routeing Problem
