Two Echelon Location Routing Problem with Simultaneous Pickup and Delivery: Mixed Integer Programming Formulations and Comparative Analysis

  • Ece Arzu Demircan-YildizEmail author
  • Ismail Karaoglan
  • Fulya Altiparmak
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9855)


This paper addresses the two-echelon location routing problem with simultaneous pickup and delivery (2E-LRPSPD). The 2E-LRPSPD deals with optimally locating primary and secondary facilities, and integrating goods distribution from depots and collection from customers and secondary depots. To the best of our knowledge there is no previous study on this problem. We propose two mixed integer programming formulations for the 2E-LRPSPD. While the first formulation is a two-index node-based formulation, the second one is a two-index flow-based formulation. Moreover, a family of valid inequalities are adapted from the literature to strengthen the formulations. In order to evaluate the performances of the formulations and valid inequalities, we conduct an experimental study on the instances derived from the literature. The computational results show that the flow-based formulation produces better lower bounds than the node-based formulation on small and medium-size problems.


Two-Echelon location routing problem Simultaneous pickup and delivery Integer programming 


  1. 1.
    Boccia, M., Crainic, T.G., Sforza, A., Sterle, C.: A metaheuristic for a two echelon Location-Routing problem. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 288–301. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  2. 2.
    Boccia, M., Crainic, T.G., Sforza, A., Sterle, C.: Location-Routing Models for Designing a Two-Echelon Freight Distribution System. Technical report 2011- 06, CIRRELT, Montréal (2011)Google Scholar
  3. 3.
    Contardo, C., Hemmelmayr, V., Crainic, T.G.: Lower and upper bounds for the two-echelon capacitated Location-Routing problem. Comput. Oper. Res. 39, 3185–3199 (2012)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Drexl, M., Schneider, M.: A survey of Location Routing Problem. Technical report LM-2013-03 (2013)Google Scholar
  5. 5.
    Govindan, K., Jafarian, A., Khodaverdi, R., Devika, K.: Two echelon multiple vehicle Location-Routing problem with time windows for optimization of sustainable supply chain network of perishable food. Int. J. Prod. Econ. 152, 9–28 (2014)CrossRefGoogle Scholar
  6. 6.
    Kara, I.: Two Indexed Polynomial Size Formulations for Vehicle Routing Problems. Technical report 2008/01. Baskent University, Ankara/Turkey (2008)Google Scholar
  7. 7.
    Kara, I., Laporte, G., Bektas, T.: A note on the lifted miller–tucker–zemlin subtour elimination constraints for the capacitated vehicle routing problem. Eur. J. Oper. Research. 158, 793–795 (2004)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Karaoglan, I., Altıparmak, F., Kara, I., Dengiz, B.: A branch and cut algorithm for the Location-Routing problem with simultaneous pickup and delivery. Eur. J. Oper. Res. 211, 318–332 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Karaoglan, I., Altiparmak, F., Kara, I., Dengiz, B.: The Location-Routing problem with simultaneous pickup and delivery: formulations and a heuristic approach. Omega 40, 465–477 (2012)CrossRefzbMATHGoogle Scholar
  10. 10.
    Karasan, O., Mahjoub, A.R., Ozkok, O., Yaman, H.: Survivability in hierarchical telecommunications networks under dual homing. INFORMS J. Comput. 26, 1–15 (2014)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Min, H., Jayaraman, V., Srivastava, R.: Combined Location-Routing problems: a synthesis and future research directions. Eur. J. Oper. Res. 108, 1–15 (1998)CrossRefzbMATHGoogle Scholar
  12. 12.
    Nagy, G., Salhi, S.: Location-Routing: issues, models and methods. Eur. J. Oper. Res. 177, 649–672 (2007)CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    Nguyen, V.-P., Prins, C., Prodhon, C.: A multi-start evolutionary local search for the two-echelon location routing problem. In: Blesa, M.J., Blum, C., Raidl, G., Roli, A., Sampels, M. (eds.) HM 2010. LNCS, vol. 6373, pp. 88–102. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  14. 14.
    Nguyen, V.P., Prins, C., Prodhon, C.: A multi start iterative local search with tabu list and path relinking for the two-echelon location routing problem. Eng. Appl. Artif. Intell. 25, 56–71 (2012)CrossRefGoogle Scholar
  15. 15.
    Nguyen, V.P., Prins, C., Prodhon, C.: Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking. Eur. J. Oper. Res. 216, 113–126 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  16. 16.
    Nikbakhsh, E., Zegordi, S.: A heuristic algorithm and a lower bound for the two-echelon Location-Routing problem with soft time window constraints. Sci. Iranica Trans. E Ind. Eng. 17, 36–47 (2010)Google Scholar
  17. 17.
    Prodhon, C., Prins, C.: A survey on recent research on Location-Routing problems. Eur. J. Oper. Res. 238, 1–17 (2014)CrossRefzbMATHMathSciNetGoogle Scholar
  18. 18.
    Rahmani, Y., Cherif-Khettaf, W.R., Oulamara, A.: The two-echelon multi-products Location-Routing problem with pickup and delivery: formulation and heuristic approaches. Int. J. Prod. Res. 54(4), 999–1019 (2016)CrossRefGoogle Scholar
  19. 19.
    Rodríguez-Martín, I., Salazar-González, J.-J., Yaman, H.: A branch-and-cut algorithm for two-level survivable network design problems. Comput. Oper. Res. 67, 102–112 (2016)CrossRefMathSciNetGoogle Scholar
  20. 20.
    Salhi, S., Nagy, G.: A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. J. Oper. Res. Soc. 50, 1034–1042 (1999)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Ece Arzu Demircan-Yildiz
    • 1
    Email author
  • Ismail Karaoglan
    • 2
  • Fulya Altiparmak
    • 1
  1. 1.Faculty of Engineering, Department of Industrial EngineeringGazi UniversityAnkaraTurkey
  2. 2.Faculty of Engineering, Department of Industrial EngineeringSelçuk UniversityKonyaTurkey

Personalised recommendations