Skip to main content
SpringerLink
Log in
Book cover

Freight Transport Planning and Logistics pp 210–257Cite as

Mathematical Models in Logistic System Design

  • Conference paper

  • 150 Accesses

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 317))

Abstract

The major goal of this paper is to underline the contribution of computer technology and quantitative methods to the development of logistics. After recalling the basic concepts of physical distribution and their evolution, the structure of a logistic system and the links with the business functions are illustrated. Then, the fundamental mathematical models, both for the logistic network design and for some key decision problems in logistic system design, are analyzed and discussed.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Agin N.I., Cullen D.E. (1975), An algorithm for transportation routing and vehicle loading. Logistics, M.A. Geisles (ed.), Studies in Management Sciences, Vol. 1 — American Elsevier.

    Google Scholar 

  • Armour R.G., Buffa E.S. (1963), A heuristic algorithm and simulation approach to the relative allocation of facilities. Management Science, 9: 294–309.

    Article  Google Scholar 

  • Ballou R.H. (1981), Reformulating a logistics strategy. International Journal of Physical Distribution and Materials Management, 11, No. 8: 71–83.

    Article  Google Scholar 

  • Ballou R.H. (1982), DISPLAN — A multiproduct facility location model with nonlinear inventory costs. Proceedings of the 12th annual transportation and logistics educator’s conference, S. Francisco.

    Google Scholar 

  • Bazaraa M.S., Sherali M.D. (1980), Bender’s partition scheme applied to a new formulation of the quadratic assignment problem. Naval Research Logistics Quarterly 27 (1): 29–41.

    Article  Google Scholar 

  • Belardo S., Duchessi P., Seagle J.P. (1985), Microcomputer graphics in support of vehicle fleet routing. Interfaces 15: 84–92.

    Article  Google Scholar 

  • Bender P.S. (1983), Resource management. John Wiley. New York.

    Google Scholar 

  • Bender P.S. (1985), Logistic system design. The distribution Handbook, Robeson J.F. House R.G. (eds): 143–224.

    Google Scholar 

  • Bodin L., Golden B.L., Assad B., Ball M. (1983), Routing and scheduling of vehicle and crews: the state of the art. Computers and Operations Research 10: 63–211.

    Article  Google Scholar 

  • Brown G.G., Graves G.W. (1980), Real-time dispatch of petroleum tank trucks. Working Paper No. 306; Western Management Science Institute, UCLA, Los Angeles.

    Google Scholar 

  • Burkard R.E., Bonninger T. (1983), A heuristic for quadratic boolean program with application to quadratic assignment problem.

    Google Scholar 

  • Carpaneto G., Dell’Amico M., Fischetti M., Toth P. (to appear), A branch and bound algorithm for the multiple depot vehicle scheduling problem. Networks.

    Google Scholar 

  • Chapleau L., Ferland J.A., Lapalme G., Rousseau J.M. (1984), A parallel insert method for the capacited arc routing problem. Operations Research Letters 3: 95–100.

    Article  Google Scholar 

  • Christofides N. (1976), Worst-case analysis of a new heuristic for the traveling salesman problem. Report 388, Graduate School of Industrial Administration Carnegie–Mellon University, Pittsburgh, PA.

    Google Scholar 

  • Christofides N., Mingozzi A., Toth P. (1979), The vehicle routing problem. Combinatorial optimization. Christofides N., Mingozzi A., Toth P., Sandi C. (eds) J. Wiley and Sons.

    Google Scholar 

  • Christofides N., Mingozzi A., Toth P. (1981), State space relaxation procedure for the computation of bounds to routing problems. Networks, 11: 145–164.

    Article  Google Scholar 

  • Christofides N. (1985), Vehicle Routing. The traveling salesman problem. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., Shmoys D.B. ( eds ), J. Wiley & Sons: 431–448.

    Google Scholar 

  • Christofides N., Mingozzi A., Ricciardelli S., Spadoni M. (1986), An algorithm for the solution of the route building problem. Technical Report of Progetto Finalizzato Trasporti. Italian National Research Council — Grant n. 85. 02705. 93.

    Google Scholar 

  • Clarke G., Wright J.W. (1964), Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12: 568–581.

    Article  Google Scholar 

  • Crowston W.B., Wagner M.H., Williams J.F. (1973), Economic lot size determination in multi-stage. assembly systems. Management Science, 19: 517–527.

    Article  Google Scholar 

  • Dror M., Levy L. (1986), A vehicle routing improvement algorithm comparison of a “greedy” and a matching implementation for inventory routing. Computers and Operations Research 13: 33–45.

    Article  Google Scholar 

  • Dzielinski B., Gomory R. (1965), Optimal programming of lot sizes, inventory and labor allocation. Management Science, 11: 874–890.

    Article  Google Scholar 

  • Efroymnson M.A., Roy T.L. (1966), A branch-bound algorithm for planning location.Operations Research, 14.

    Google Scholar 

  • Fisher M.L., Jaikumar R. (1978), A decomposition algorithm for large — scale vehicle routing. Working Paper No. 78-11-05 — Decision Sciences Department, The Wharton School, University of Pensylvania, Philadelphia.

    Google Scholar 

  • Fisher M.L., Jaikumar R. (1981), A generalized assignment heuristics for vehicle routing. Networks, 11: 109–124.

    Article  Google Scholar 

  • Francis R.L., White J.A. (1974), Facility layout and location: an analytical approach. Englewood Cliffs N.T.: Prentice Hall.

    Google Scholar 

  • Geoffrian A.M., Graves G.W. (1974), Multicommodity distribution system design by Benders decomposition — Management Science, 20: 822–844.

    Google Scholar 

  • Gilmore P.C. (1962), Optimal and suboptimal algorithms for the quadratic assignment problem. Journal of the Society for Industrial and Applied Mathematics 10: 305–313.

    Article  Google Scholar 

  • Golden B.L., Magnanti T.L., Nguyen H.Q. (1977), Implementing vehicle routing algorithms. Networks, 7: 113–148.

    Article  Google Scholar 

  • Golden B.L., Skiscim C.C. (1986), Using simulated amealing to solve routing and location problems. Naval Research Logistics Quarterly 33: 261–279.

    Article  Google Scholar 

  • Hart J.P., Shogan A.W. (1987), Semi-greedy heuristics: an empirical study. Operations Research Letters 6: 107–114.

    Article  Google Scholar 

  • Heskett J.L., Ivie, R.M., Glaskowsky N.A. (1973), Business Logistics. Ronald Press, New York.

    Google Scholar 

  • Hillier F.S., Connors M.M. (1966), Quadratic assignment problem algorithms and the location of individual facilities. Management Science, 13: 42–57.

    Article  Google Scholar 

  • Khumawala B.M. (1972), An efficient branch and bound algorithm fot the warehouse location problem. Management Science, 18.

    Google Scholar 

  • Kirkpatrick S., Gelatt G.D. Jr, Vecchi P.O. (1983), Optimization by simulated annealing. Science Reprint Series: 671–680.

    Google Scholar 

  • Kolen A.W.J., Rinnooy Kan A.H.G., Trienekens H.W.J.N. (1987), Vehicle routing with time windows. Operations Research 35: 266–273.

    Article  Google Scholar 

  • Kuehn A.A., Hamburger M.J. (1963), A heuristic program for locating wharehouse. Management Science, 9: 643–666.

    Article  Google Scholar 

  • Kusiak A., Heragu S.S. (1987), The facility layout problem. European Journal of Operational Research, 29 No. 3: 229–251.

    Article  Google Scholar 

  • Landson L., Terjung R. (1971), An efficient algorithm for multi-item scheduling. Operations Research, 19: 946–969.

    Article  Google Scholar 

  • La Londe B.J., Grabner J.R., Robeson J.F. (1970), Integrated distribution management; a management perspective. International Journal of Physical Distribution 1, No. 1: 44.

    Google Scholar 

  • La Londe B.J., Grabner J.R., Robeson J.F. (1985), Integrated distribution systems: past, present, and future. The distribution hanbook, Robeson J.F. and House R.G. (eds): 15-27. The Free Press — New York.

    Google Scholar 

  • Lawler E.L. (1963), The quadratic assignment problem. Management Science 9: 586–599.

    Article  Google Scholar 

  • Lin S., Kernighian B. (1973), An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21: 498.

    Article  Google Scholar 

  • Mabert V.A., Whybark D.C. (1977), Sampling as a solution methodology. Decision Science, 8, No. 1: 167–179.

    Article  Google Scholar 

  • Magnanti T.L. (1981), Combinatorial optimization and vehicle fleet planning: perspectives and prospects. Networks, 11: 179–213.

    Article  Google Scholar 

  • Marchetti Spaccamela A., Rinnooy Kan A.H.G., Stougie L. (1984), Hierarchical vehicle routing problems. Networks 14: 571–586.

    Article  Google Scholar 

  • Psaraftis H.N. (1984), On the practical importance of asymptatic optimality in certain heuristic algorithms. Networks 14: 587–596.

    Article  Google Scholar 

  • Ritzman L.P. (1972), The efficiency of computer algorithms for plant layout. Management Science, 19: 240–248.

    Article  Google Scholar 

  • Sassano A. (1988), Minimizing costs in crude oil transportation. Freight Transport Planning and Logistics. Bianco L., La Bella A. (eds ), Springer Verlag (forthcoming).

    Google Scholar 

  • Sciarrone G. (1988), Delivery problems in metropolitan areas optimizing the distribution of a daily newspaper: an application to the Turin daily “La Stampa”. Freight Transport Planning and Logistics. Bianco L. La Bella A. (eds ), Springer Verlag (forthcoming).

    Google Scholar 

  • Scriabin M., Vergin R.C. (1975), Comparison of computer algorithms and visual based methods for plant layout. Management Science, 22: 172–181.

    Article  Google Scholar 

  • Shapiro J.F. (1985), Quantitative methods in distribution. The distribution handbook, Robeson J.F. and House R.G. (eds): 373-427. The Free Press–New York.

    Google Scholar 

  • Shycon H.N., Maffei R.B. (1960), Simulation — Tool for better distribution. Harward Business Review, 39: 65–75.

    Google Scholar 

  • Solomon M.S. (1986), On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints. Networks 16: 161–174.

    Article  Google Scholar 

  • Solomon M.S. (1987), Algorithms for the vehicle routing and scheduling problem with time window constraints. Operations Research 35: 254–265.

    Article  Google Scholar 

  • Tyagi M. (1968), A practical method for the truck dispatching problem. Journal of the Operations Research Society of Japan, 10: 76–92.

    Google Scholar 

  • Wagner H.M., Whitin T.M. (1958), Dynamic version of the economic lot size model. Management Science, 5: 89–96.

    Article  Google Scholar 

  • Waters C.D.J. (1987), A solution procedure for the vehicle scheduling problem based on iterative route improvement. Journal of Operational Research Society 38: 833–839.

    Google Scholar 

  • Zangwill W.I. (1966), A deterministic multi-product, multi-facility production and inventory model. Operations Research, 14: 486–507.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Analisi dei Sistemi ed Informatica and Progetto Finalizzato Trasporti, Consiglio Nazionale delle Ricerche, Viale Manzoni 30, 00185, Roma, Italy

    Lucio Bianco

Authors
  1. Lucio Bianco
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Progetto Finalizzato Trasporti, Viale dell’Università 11, I-00185, Rome, Italy

    Lucio Bianco  & Agostino La Bella  & 

  2. Consiglio Nazionale delle Ricerche, Istituto di Analisi dei Sistemi ed Informatica, Italy

    Lucio Bianco  & Agostino La Bella  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bianco, L. (1988). Mathematical Models in Logistic System Design. In: Bianco, L., La Bella, A. (eds) Freight Transport Planning and Logistics. Lecture Notes in Economics and Mathematical Systems, vol 317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02551-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-02551-2_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50232-6

  • Online ISBN: 978-3-662-02551-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation