Abstract
In this paper the many to many location routing problem is introduced, and its relationship to various problems in distribution management is emphasised. Useful mathematical formulations which can be easily extended to cater for other related problems are produced. Techniques for tackling this complex distribution problem are also outlined.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balakrishnan, A., J.E. Ward and R.T. Wong (1987): Integrated facility location and vehicle routing models: recent work and future prospects,American Journal of Mathematical and Management Sciences, Vol.7, pp. 35–61.
Campbell J.F. (1994): A survey of network hub location,Studies in Locational Analysis, Issue6, pp. 31–49.
Daganzo, C.F. (1996):Logistics Systems Analysis, Springer, Berlin.
Eilon S., C.D.T. Watson-Gandy and N. Christofides (1971):Distribution Management: Mathematical Modelling and Practical Analysis, Griffin, London.
Kara B.Y. and B.C. Tansel (1996): On the equivalence of the allocation part of the hub location and the multimedian location problems,paper presented at the EWGLA'9 meeting, Birmingham.
Kuehn, A.A. and M.J. Hamburger (1963): A heuristic program for locating warehouses,Management Science, Vol9, pp. 643–666.
Laporte G. (1989): A survey of algorithms for location-routing problems,Investigacion Operativa, Vol.1, pp. 93–123.
Laporte G. (1992): The vehicle routing problem: an overview of exact and approximate algorithms, it European Journal of Operational Research, Vol.59, pp. 345–358.
Min H-K (1989): The multiple vehicle routing problem with simultaneous delivery and pick-up points,Transportation Research A, Vol.23A, pp. 377–386.
Mirchandani P.B. and R.L. Francis (1990):Discrete Location Theory, Wiley, New York.
Nagy G. (1996):Heuristic Methods for the Many-to-Many Location-Routing Problem, PhD thesis, University of Birmingham.
Nagy G. and S. Salhi (1996a): Nested heuristic methods for the location-routeing problem.Journal of the Operational Research Society, Vol.47, pp. 1166–1174.
Nagy, G. and S. Salhi (1996b): A nested location-routing heuristic using route length estimation,Studies in Locational Analysis, Issue10, pp. 109–127.
Nagy G. and S.Salhi (1996c): The multi-depot vehicle routing problem with pickups and deliveries,paper presented at IFORS'96, Vancouver.
Salhi S. and M. Fraser (1996): An integrated heuristic approach for the combined location-vehicle fleet mix problems,Studies in Locational Analysis, Vol.8, pp. 3–22.
Salhi S. and G. Nagy (1998): Consistency and robustness in location-routing,Studies in Locational Analysis, Issue13. (in press).
Salhi S. and G.K. Rand (1989): The effect of ignoring routes when locating depots,European Journal of Operational Research, Vol.39., pp. 150–156.
Salhi S. and M. Sari (1997): Models for the multi-depot vehicle fleet mix problem,European Journal of Operational Research, Vol.103, pp. 95–112.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Nagy, G., Salhi, S. The many-to-many location-routing problem. Top 6, 261–275 (1998). https://doi.org/10.1007/BF02564791
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02564791