A heuristic solution to the warehouse location-routing problem
- 6 July 1994
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 76 (1), 111-127
- https://doi.org/10.1016/0377-2217(94)90010-8
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Dynamic Location-routeing ProblemsJournal of the Operational Research Society, 1989
- Design of multiple-vehicle delivery tours satisfying time constraintsTransportation Research Part B: Methodological, 1989
- Implementing vehicle routing algorithmsNetworks, 1977
- A Sequential Route-building Algorithm Employing a Generalised Savings CriterionJournal of the Operational Research Society, 1976
- Multi-terminal vehicle-dispatch algorithmOmega, 1976
- Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery PointsJournal of the Operational Research Society, 1972
- Relative Performance of Some Sequential Methods of Planning Multiple Delivery JourneysJournal of the Operational Research Society, 1972
- A Heuristic Programming Algorithm for Warehouse LocationA I I E Transactions, 1970
- An Algorithm for the Vehicle-dispatching ProblemJournal of the Operational Research Society, 1969
- Cost Functions in the Location of Depots for Multiple-Delivery JourneysJournal of the Operational Research Society, 1968