Two echelon location routing problem with simultaneous pickup and delivery: Mixed integer programming formulations and comparative analysis
Küçük Resim Yok
Tarih
2016
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Springer Verlag
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
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. © Springer International Publishing Switzerland 2016.
Açıklama
7th International Conference on Computational Logistics, ICCL 2016 -- 7 September 2016 through 9 September 2016 -- 179939
Anahtar Kelimeler
Integer programming, Simultaneous pickup and delivery, Two-echelon location routing problem
Kaynak
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
WoS Q Değeri
Scopus Q Değeri
Q3
Cilt
9855 LNCS
