Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
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)
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)
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)
Drexl, M., Schneider, M.: A survey of Location Routing Problem. Technical report LM-2013-03 (2013)
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)
Kara, I.: Two Indexed Polynomial Size Formulations for Vehicle Routing Problems. Technical report 2008/01. Baskent University, Ankara/Turkey (2008)
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)
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)
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)
Karasan, O., Mahjoub, A.R., Ozkok, O., Yaman, H.: Survivability in hierarchical telecommunications networks under dual homing. INFORMS J. Comput. 26, 1–15 (2014)
Min, H., Jayaraman, V., Srivastava, R.: Combined Location-Routing problems: a synthesis and future research directions. Eur. J. Oper. Res. 108, 1–15 (1998)
Nagy, G., Salhi, S.: Location-Routing: issues, models and methods. Eur. J. Oper. Res. 177, 649–672 (2007)
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)
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)
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)
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)
Prodhon, C., Prins, C.: A survey on recent research on Location-Routing problems. Eur. J. Oper. Res. 238, 1–17 (2014)
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)
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)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Demircan-Yildiz, E.A., Karaoglan, I., Altiparmak, F. (2016). Two Echelon Location Routing Problem with Simultaneous Pickup and Delivery: Mixed Integer Programming Formulations and Comparative Analysis. In: Paias, A., Ruthmair, M., Voß, S. (eds) Computational Logistics. ICCL 2016. Lecture Notes in Computer Science(), vol 9855. Springer, Cham. https://doi.org/10.1007/978-3-319-44896-1_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-44896-1_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-44895-4
Online ISBN: 978-3-319-44896-1
eBook Packages: Computer ScienceComputer Science (R0)