Skip to main content
SpringerLink
Log in

A Branch-and-Price Algorithm for Combined Location and Routing Problems Under Capacity Restrictions

  • Conference paper
Operations Research and Cyber-Infrastructure

Part of the book series: Operations Research/Computer Science Interfaces ((ORCS,volume 47))

Abstract

We investigate the problem of simultaneously determining the location of facilities and the design of vehicle routes to serve customer demands under vehicle and facility capacity restrictions. We present a set-partitioning-based formulation of the problem and study the relationship between this formulation and the graph-based formulations that have been used in previous studies of this problem. We describe a branch-and-price algorithm based on the set-partitioning formulation and discuss computational experience with both exact and heuristic variants of this algorithm.

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

Access this chapter

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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

References

  • Akca Z (2008) Location Routing and Scheduling Problems: Models and algorithms. Working paper, COR@L Lab, Lehigh University

    Google Scholar 

  • Akca Z, Berger RT, Ralphs TK (2008) Modeling and Solving Location Routing and Scheduling Problems. Working paper, COR @ L Lab, Lehigh University

    Google Scholar 

  • Barreto S (2003) LRP instances. URL http://sweet.ua.pt/iscfl43

  • Barreto S (2004) Analysis and Modelling of Location-Routing Problems (in portuguese). Phd thesis, University of Aveiro, Aveiro, Portugal

    Google Scholar 

  • Barreto S, Ferreira C, Paixao J, Santos BS (2007) Using Clustering Analysis in a Capacitated Location-Routing Problem. European Journal of Operational Research 127(3):968–977

    Article  Google Scholar 

  • Belenguer JM, Benavent E, Prins C, Prodhon C, Wolfler-Calvo R (2006) A Branch and Cut method for the Capacitated Location-Routing Problem. Service Systems and Service Management, 2006 International Conference on 2:1541–1546

    Article  Google Scholar 

  • Berger RT (1997) Location-Routing Models for Distribution System Design. PhD thesis, Department of Industrial Engineering and Management Sciences, North-western University

    Google Scholar 

  • Berger RT, Coullard CR, Daskin M (2007) Location-Routing Problems with Distance Constraints. Transportation Science 41:29–43

    Article  Google Scholar 

  • Desrochers M, Soumis F (1989) A Column Generation Approach to the Urban Transit Crew Scheduling Problem. Transportation Science 23(1):1–13

    Article  MATH  Google Scholar 

  • Desrochers M, Desrosiers J, Solomon MM (1992) A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows. Operations Research 40(2):342–354

    Article  MathSciNet  MATH  Google Scholar 

  • Dumitrescu I (2002) Constrained Path and Cycle Problems. PhD thesis, Department of Mathematics and Statistics, University of Melbourne

    Google Scholar 

  • Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints: Application to Some Vehicle Routing Problems. Networks 44(3):216–229

    Article  MathSciNet  MATH  Google Scholar 

  • Hansen PH, Hegedahl B, Hjortkjaer S, Obel B (1994) A Heuristic Solution to the Warehouse Location-Routing Problem. European Journal of Operational Research 76:111–127

    Article  MATH  Google Scholar 

  • Irnich S, Desaulniers G (2005) Column Generation, Springer, chap Shortest Path Problems with Resource Constraints, pp 33-65. GERAD 25th Anniversary Series

    Google Scholar 

  • Laporte G (1988) Location Routing Problems. In: Golden B, Assad A (eds) Vehicle Routing: Methods and Studies, North-Holland, Amsterdam, pp 293–318

    Google Scholar 

  • Laporte G, Nobert Y (1981) An Exact Algorithm for Minimizing Routing and Operating Cost in Depot Location. European Journal of Operational Research 6: 224–226

    Article  MATH  Google Scholar 

  • Laporte G, Nobert Y, Pelletier Y (1983) Hamiltonian Location Problems. European Journal of Operational Research 12:82–89

    Article  MATH  Google Scholar 

  • Laporte G, Nobert Y, Arpin D (1986) An Exact Algorithm for Solving a Capacitated Location-Routing Problem. Annals of Operations Research 6:293–310

    Article  Google Scholar 

  • Min H, Jayaraman V, Srivastava R (1998) Combined Location-Routing Problems: A Synthesis and Future Research Directions. European Journal of Operational Research 108(1):1–15

    Article  MATH  Google Scholar 

  • Perl J, Daskin MS (1985) A Warehouse Location-Routing Model. Transportation Research 19(B):381–396

    Google Scholar 

  • Vance PH, Barnhart C, Johnson E, Nemhauser GL (1994) Solving Binary Cutting Stock Problems by Column Generation and Branch and Bound. Computational Optimization and Applications 3:111–130

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, 18015

    Z. Akca & T. K. Ralphs

Authors
  1. Z. Akca
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. T. Berger
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. T. K. Ralphs
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. Systems & Computer Engineering, Carleton University, Ottawa, ON, K1S 5B6, Canada

    John W. Chinneck

  2. Maximal Software, Inc., 2111 Wilson Blvd., Arlington, VA, 22201, USA

    Bjarni Kristjansson

  3. Dept. of Mathematical Sciences College of Engineering and Science, Clemson University, 340975, Clemson, SC, 29634, USA

    Matthew J. Saltzman

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer Science+Business Media, LLC

About this paper

Cite this paper

Akca, Z., Berger, R.T., Ralphs, T.K. (2009). A Branch-and-Price Algorithm for Combined Location and Routing Problems Under Capacity Restrictions. In: Chinneck, J.W., Kristjansson, B., Saltzman, M.J. (eds) Operations Research and Cyber-Infrastructure. Operations Research/Computer Science Interfaces, vol 47. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-88843-9_16

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-88843-9_16

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-88842-2

  • Online ISBN: 978-0-387-88843-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation