[go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Location Routing Problem

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Introduction

Variants of the Location Routing Problem

Exact Algorithms for the Solution of the Location Routing Problem

Heuristic Algorithms for the Solution of the Location Routing Problem

Metaheuristic Algorithms for the Solution of the Location Routing Problem

References

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 3,759.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Similar content being viewed by others

References

  1. Aarts E, Korst J (1989) Simulated Annealing and Boltzmann Machines – A Stochastic Approach to Combinatorial Optimization and Neural Computing. John Wiley and Sons, Chichester

    MATH  Google Scholar 

  2. Aarts E, Korst J, Van Laarhoven P (1997) Simulated Annealing. In: Aarts E, Lenstra JK (eds) Local Search in Combinatorial Optimization. Wiley, Chichester, pp 91–120

    Google Scholar 

  3. Aarts E, Ten Eikelder HMM (2002) Simulated Annealing. In: Pardalos PM, Resende MGC (eds) Handbook of Applied Optimization. Oxford University Press, New York, pp 209–221

    Google Scholar 

  4. Albareda-Sambola M, Diaz JA, Fernandez E (2005) A Compact Model and Tight Bounds for a Combined Location-Routing Problem. Comput Oper Res 32(3):407–428

    Article  MathSciNet  MATH  Google Scholar 

  5. Averbakh I, Berman O (1994) Routing and Location‐Routing p‑Delivery Men Problems on a Path. Transp Sci 28(2):162–166

    MathSciNet  MATH  Google Scholar 

  6. Barreto S, Ferreira C, Paixao J, Santos BS (2007) Using Clustering Analysis in a Capacitated Location-Routing Problem. Eur J Oper Res 179(3):968–977

    Article  MATH  Google Scholar 

  7. Bookbinder JH, Reece KE (1988) Vehicle Routing Considerations in Distribution System Design. Eur J Oper Res, 37:204-213

    Google Scholar 

  8. Bouhafs L, Hajjam A, Koukam A (2006) A Combination of Simulated Annealing and Ant Colony System for the Capacitated Location-Routing Problem. Knowl-Based Intelligent Inf Eng Syst, LNCS 4251:409–416

    Google Scholar 

  9. Burness RC, White JA (1976) The Traveling Salesman Location Problem. Transp Sci 10(4):348–360

    Google Scholar 

  10. Caballero R, Gonzalez M, Guerrero FM, Molina J, Paralera C (2007) Solving a Multiobjective Location Routing Problem with a Metaheuristic Based on Tabu Search. Application to a Real Case in Andalusia. Eur J Oper Res 177(3):1751–1763

    Article  MATH  Google Scholar 

  11. Chan Y, Carter WB, Burnes MB (2001) A Multiple-Depot, Multiple-Vehicle, Location-Routing Problem with Stochastically Processed Demands. Comput Oper Res 28:803–826

    Article  MathSciNet  MATH  Google Scholar 

  12. Cappanera P, Gallo G, Maffioli F (2003) Discrete Facility Location and Routing of Obnoxious Activities. Discret Appl Math 133(1–3):3–28

    Article  MathSciNet  MATH  Google Scholar 

  13. Chan Y, Baker SF (2005) The Multiple Depot, Multiple Traveling Salesmen Facility-Location Problem: Vehicle Range, Service Frequency, Heuristic Implementations. Math Comput Model 41(8-9):1035–1053

    Article  MathSciNet  MATH  Google Scholar 

  14. Chiang WC, Russell RA (2004) Integrating Purchasing and Routing in a Propane Gas Supply Chain. Eur J Oper Res 154(3):710–729

    Article  MATH  Google Scholar 

  15. Chien TW (1993) Heuristic Procedures for Practical-sized Uncapacitated Location-Capacitated Routing Problems. Decis Sci 24(5):995–1021

    Article  MathSciNet  Google Scholar 

  16. Christofides N, Eilon S (1969) Expected Distances for Distribution Problems. Oper Res Q 20:437–443

    Article  Google Scholar 

  17. Daskin MS (1987) Location, Dispatching, Routing Models for Emergency Services with Stochastic Travel Times. In: Ghosh A, Rushton G (eds) Spatial Analysis and Location-Allocation Models. Von Nostrand Reinhold Company, NY, pp 224–265

    Google Scholar 

  18. Dondo R, Cerda J (2007) A Cluster-Based Optimization Approach for the Multi-Depot Heterogeneous Fleet Vehicle Routing Problem with Time Windows. Eur J Oper Res 176(3):1478–1507

    Article  MATH  Google Scholar 

  19. Dorigo M, Stutzle T (2004) Ant Colony Optimization, A Bradford Book. MIT Press Cambridge, MA, London

    Google Scholar 

  20. Ghosh JK, Sinha SB, Acharya D (1981) A Generalized Reduced Gradient Based Approach to Round-trip Location Problem. In: Jaiswal NK (eds) Scientific Management of Transport Systems. Amsterdam, Holland, pp 209–213

    Google Scholar 

  21. Gillett B, Johnson J (1976) Multi-Terminal Vehicle-Dispatch Algorithm. Omega 4(6):711–718

    Article  Google Scholar 

  22. Glover F (1989) Tabu Search I. ORSA J Compu 1(3):190–206

    MATH  Google Scholar 

  23. Glover F (1990) Tabu Search II. ORSA J Compu 2(1):4–32

    MATH  Google Scholar 

  24. Glover F, Laguna M, Taillard E, de Werra D (eds) (1993) Tabu Search. JC Baltzer AG, Science Publishers, Basel

    Google Scholar 

  25. Goldberg DE (1989) Genetic Algorithms in Search, Optimization, Machine Learning. Addison-Wesley, Reading Massachussets

    Google Scholar 

  26. Hansen P, Mladenovic N (2001) Variable Neighborhood Search: Principles and Applications. Eur J Oper Res 130:449–467

    Article  MathSciNet  MATH  Google Scholar 

  27. Hansen PH, Hegedahl B, Hjortkajaer S, Obel B (1994) A Heuristic Solution to the Warehouse Location-Routing Problem. Eur J Oper Res 76:111–127

    Article  MATH  Google Scholar 

  28. Holland JH (1975) Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI

    Google Scholar 

  29. Hwang HS (2002) Design of Supply-Chain Logistics System Considering Service Level. Comput Ind Eng 43(1–2):283–297

    Article  Google Scholar 

  30. Jacobsen SK, Madsen OBG (1978) On the Location of Transfer Points in a Two-Level Newspaper Delivery System – A Case Study. Presented at The International Symposium on Locational Decisions. The Institute of Mathematical Statistics and Operations Research, The Technical University of Denmark, Lyngbyn Denmark, pp 24–28

    Google Scholar 

  31. Jacobsen SK, Madsen OBG (1980) A Comparative Study of Heuristics for Two Level Routing Location Problem. Eur J Oper Res 5:378–387

    Article  MATH  Google Scholar 

  32. Kirkpatrick S, Gelatt CD, Vecchi MP (1982) Optimization by Simulated Annealing. Science 220:671–680

    Article  MathSciNet  Google Scholar 

  33. Laoutaris N, Zissimopoulos V, Stavrakakis I (2005) On the Optimization of Storage Capacity Allocation for Content Distribution. Comput Netw 47(3):409–428

    Article  Google Scholar 

  34. Laporte G (1988) Location Routing Problems. In: Golden BL et al (eds) Vehicle Routing: Methods and Studies. North-Holland, Amsterdam, pp 163–198

    Google Scholar 

  35. Laporte G, Dejax PJ (1989) Dynamic Location-Routing Problems. J Oper Res Soc 40(5):471–482

    Article  MATH  Google Scholar 

  36. Laporte G, Nobert Y (1981) An Exact Algorithm for Minimizing Routing and Operating Costs in Depot Location. Eur J Oper Res 6:224–226

    Article  MATH  Google Scholar 

  37. Laporte G, Nobert Y, Arpin D (1986) An Exact Algorithm for Solving a Capacitated Location-Routing Problem. Ann Oper Res 6:293–310

    Article  Google Scholar 

  38. Laporte G, Nobert Y, Pelletier P (1983) Hamiltonian Location Problems. Eur J Oper Res 12(1):82–89

    Article  MATH  Google Scholar 

  39. Laporte G, Nobert Y, Taillefer S (1988) Solving a Family of Multi-depot Vehicle Routing and Location Routing Problems. Transp Sci 22:161–172

    MathSciNet  MATH  Google Scholar 

  40. Lin CKY, Chow CK, Chen A (2002) A Location-Routing-Loading Problem for Bill Delivery Services. Comput Ind Eng 43(1–2):5–25

    Article  Google Scholar 

  41. Lin CKY, Kwok RCW (2006) Multi-Objective Metaheuristics for a Location-Routing Problem with Multiple Use of Vehicles on Real Data and Simulated Data. Eur J Oper Res 175(3):1833–1849

    Article  MATH  Google Scholar 

  42. Liu SC, Lee SB (2003) A Two-Phase Heuristic Method for the Multi-Depot Location Routing Problem Taking Inventory Control Decisions Into Consideration. Int J Adv Manuf Technol 22(11-12):941–950

    Article  Google Scholar 

  43. Madsen OBG (1983) Methods for Solving Combined Two Level Location Routing Problems of Realistic Dimension. Eur J Oper Res 12(3):295–301

    Article  Google Scholar 

  44. Marinakis Y, Marinaki M (2008) A Bilevel Genetic Algorithm for a Real Life Location Routing Problem. Int J Logist 11(1):49–65

    MathSciNet  Google Scholar 

  45. Melechovsky J, Prins C, Calvo RW (2005) A Metaheuristic to Solve a Location-Routing Problem with Non-Linear Costs. J Heurist 11(5-6):375–391

    Article  MATH  Google Scholar 

  46. Min H (1996) Consolidation Terminal Location-Allocation and Consolidated Routing Problems. J Bus Logist 17(2):235–263

    Google Scholar 

  47. Min H, Jayaraman V, Srivastava R (1998) Combined Location-Routing Problems: A Synthesis and Future Research Directions. Eur J Oper Res 108:1–15

    Article  MATH  Google Scholar 

  48. Nagy G, Salhi S (2007) Location-Routing: Issues, Models and Methods. Eur J Oper Res 177:649–672

    Article  MathSciNet  MATH  Google Scholar 

  49. Nambiar JM, Gelders LF, Van Wassenhove LN (1981) A Large Scale Location-Allocation Problem in the Natural Rubber Industry. Eur J Oper Res 6:183–189

    Article  MATH  Google Scholar 

  50. Perl J, Daskin MS (1984) A Unified Warehouse Location-Routing Methodology. J Bus Logist 5(1):92–111

    Google Scholar 

  51. Perl J, Daskin MS (1985) A Warehouse Location Routing Model. Transp Res B 19:381–396

    Article  Google Scholar 

  52. Prins C, Prodhon C, Calvo RW (2006) Solving the Capacitated Location-Routing Problem by a GRASP Complemented by a Learning Process and a Path Relinking, 4OR 4:221–238

    Google Scholar 

  53. Prins C, Prodhon C, Calvo RW (2006) A Memetic Algorithm with Population Management (MA|PM) for the Capacitated Location-Routing Problem. Evol Comput Combinatorial Optim, LNCS 3906:183–194

    Google Scholar 

  54. Reeves CR (1995) Genetic Algorithms. In: Reeves CR (eds) Modern Heuristic Techniques for Combinatorial Problems. McGraw-Hill, London, pp 151–196

    Google Scholar 

  55. Reeves CR (2003) Genetic Algorithms. In: Glover F, Kochenberger GA (eds) Handbooks of Metaheuristics. Kluwer, Dordrecht, pp 55–82

    Chapter  Google Scholar 

  56. Resende MGC, Ribeiro CC (2003) Greedy Randomized Adaptive Search Procedures. In: Glover F, Kochenberger GA (eds) Handbook of Metaheuristics. Kluwer, Boston, pp 219–249

    Chapter  Google Scholar 

  57. Russell R, Chiang WC, Zepeda D (2006) Integrating Multi-Product Production and Distribution in Newspaper Logistics. Comput Oper Res 35(5): 1576–1588

    Google Scholar 

  58. Simchi-Levi D, Berman O (1988) A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks. Eur J Oper Res 36:478–484

    MATH  Google Scholar 

  59. Srisvastava R (1993) Alternate Solution Procedures for the Location-Routing Problem. Omega 21(4):497–506

    Article  Google Scholar 

  60. Srivastava R, Benton WC (1990) The Location-Routing Problem: Consideration in Physical Distribution System Design. Comput Oper Res 6:427–435

    Article  Google Scholar 

  61. Stowers CL, Palekar US (1993) Location Models with Routing Considerations for a Single Obnoxious Facility. Transp Sci 27(4):350–362

    MATH  Google Scholar 

  62. Tuzun D, Burke LI (1999) A Two-Phase Tabu Search Approach to the Location Routing Problem. Eur J Oper Res 116:87–99

    Article  MATH  Google Scholar 

  63. Watson-Gandy CTD, Dohrn PJ (1973) Depot Location with Van Salesman – A Practical Approach. Omega 1:321–329

    Article  Google Scholar 

  64. Wu TH, Low C, Bai JW (2002) Heuristic Solutions to Multi-Depot Location-Routing Problems. Comput Oper Res 29:1393–1415

    Article  MATH  Google Scholar 

  65. Zografos KG, Samara S (1989) Combined Location-Routing Model for Hazardous Waste Transportation and Disposal. Transp Res Record 1245:52–59

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Production Engineering and Management, Decision Support Systems Laboratory, Technical University of Crete, Chania, Greece

    Yannis Marinakis

Authors
  1. Yannis Marinakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Marinakis, Y. (2008). Location Routing Problem . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_345

Download citation

Publish with us

Policies and ethics

Search

Navigation