The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach

Basit Öğe Kaydı
dc.contributor.authorKaraoğlan, İsmail
dc.contributor.authorAltıparmak, Fulya
dc.contributor.authorKara, İmdat
dc.contributor.authorDengiz, Berna
dc.date.accessioned2020-03-26T18:31:47Z
dc.date.available2020-03-26T18:31:47Z
dc.date.issued2012
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractIn this paper, we consider a variant of the Location-Routing Problem (LRP), namely the LRP with simultaneous pickup and delivery (LRPSPD). The LRPSPD seeks to minimize total cost by simultaneously locating the depots and designing the vehicle routes that satisfy pickup and delivery demand of each customer at the same time. We propose two polynomial-size mixed integer linear programming formulations for the problem and a family of valid inequalities to strengthen the formulations. While the first formulation is a node-based formulation, the second one is a flow-based formulation. Furthermore, we propose a two-phase heuristic approach based on simulated annealing, tp_SA, to solve the large-size LRPSPD and two initialization heuristics to generate an initial solution for the tp_SA. We then empirically evaluate the strengths of the proposed formulations with respect to their ability to find optimal solutions or strong lower bounds, and investigate the performance of the proposed heuristic approach. Computational results show that the flow-based formulation performs better than the node-based formulation in terms of the solution quality and the computation time on small-size problems. However, the node-based formulation can yield competitive lower bounds in a reasonable amount of time on medium-size problems. Meantime, the proposed heuristic approach is computationally efficient in finding good quality solutions for the LRPSPD. (C) 2011 Elsevier Ltd. All rights reserved.en_US
dc.description.sponsorshipScientific and Technological Research Council of Turkey (TUBITAK)Turkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) [108E069]en_US
dc.description.sponsorshipThe authors are indebted to the area editor and anonymous referees for their helpful comments and suggestions. This research is supported by The Scientific and Technological Research Council of Turkey (TUBITAK) under Grant no: 108E069.en_US
dc.identifier.doi10.1016/j.omega.2011.09.002en_US
dc.identifier.endpage477en_US
dc.identifier.issn0305-0483en_US
dc.identifier.issue4en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage465en_US
dc.identifier.urihttps://dx.doi.org/10.1016/j.omega.2011.09.002
dc.identifier.urihttps://hdl.handle.net/20.500.12395/28536
dc.identifier.volume40en_US
dc.identifier.wosWOS:000297781600006en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherPERGAMON-ELSEVIER SCIENCE LTDen_US
dc.relation.ispartofOMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCEen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectLocation-routing problemen_US
dc.subjectSimultaneous pickup and deliveryen_US
dc.subjectMixed integer programming formulationen_US
dc.subjectSimulated annealingen_US
dc.titleThe location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approachen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu