A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery

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:08:05Z
dc.date.available2020-03-26T18:08:05Z
dc.date.issued2011
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractThis paper addresses a location-routing problem with simultaneous pickup and delivery (LRPSPD) which is a general case of the location-routing problem. The LRPSPD is defined as finding locations of the depots and designing vehicle routes in such a way that pickup and delivery demands of each customer must be performed with same vehicle and the overall cost is minimized. We propose an effective branch-and-cut algorithm for solving the LRPSPD. The proposed algorithm implements several valid inequalities adapted from the literature for the problem and a local search based on simulated annealing algorithm to obtain upper bounds. Computational results, for a large number of instances derived from the literature, show that some instances with up to 88 customers and 8 potential depots can be solved in a reasonable computation time. (C) 2011 Elsevier B.V. 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 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.ejor.2011.01.003en_US
dc.identifier.endpage332en_US
dc.identifier.issn0377-2217en_US
dc.identifier.issn1872-6860en_US
dc.identifier.issue2en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage318en_US
dc.identifier.urihttps://dx.doi.org/10.1016/j.ejor.2011.01.003
dc.identifier.urihttps://hdl.handle.net/20.500.12395/26031
dc.identifier.volume211en_US
dc.identifier.wosWOS:000288308800010en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherELSEVIERen_US
dc.relation.ispartofEUROPEAN JOURNAL OF OPERATIONAL RESEARCHen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectLogisticsen_US
dc.subjectLocation-routing problemen_US
dc.subjectSimultaneous pickup and deliveryen_US
dc.subjectBranch-and-cuten_US
dc.subjectSimulated annealingen_US
dc.titleA branch and cut algorithm for the location-routing problem with simultaneous pickup and deliveryen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

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