A memetic algorithm for the capacitated location-routing problem with mixed backhauls

Basit Öğe Kaydı
dc.contributor.authorKaraoğlan, İsmail
dc.contributor.authorAltıparmak, Fulya
dc.date.accessioned2020-03-26T19:00:24Z
dc.date.available2020-03-26T19:00:24Z
dc.date.issued2015
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractThe design of distribution networks is one of the most important problems in supply chain and logistics management. The main elements in designing a distribution network are location and routing decisions. As these elements are interdependent in many distribution networks, the overall system cost can decrease if location and routing decisions are simultaneously tackled. In this paper, we consider a Capacitated Location-Routing Problem with Mixed Backhauls (CLRPMB) which is a general case of the capacitated location-routing problem. CLRPMB 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 the same vehicle and the overall cost is minimized. Since CLRPMB is an NP-hard problem, we propose a memetic algorithm to solve the problem. To evaluate the performance of the proposed approach, we conduct an experimental study and compare its results with the lower bounds obtained by the branch-and-cut algorithm on a set of instances derived from the literature. Computational results indicate that the proposed approach is able to find optimal or very good quality solutions in a reasonable computation time. (C) 2014 Elsevier Ltd. All rights reserved.en_US
dc.description.sponsorshipThe Scientific and Technological Research Council of TurkeyTurkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) [108E069]en_US
dc.description.sponsorshipWe thank to the Associate Editor and anonymous referee for their helpful comments and suggestions, which greatly contributed to the improvement of the paper. This research is fully supported by The Scientific and Technological Research Council of Turkey as Scientific Research Project (No. 108E069).en_US
dc.identifier.doi10.1016/j.cor.2014.06.009en_US
dc.identifier.endpage216en_US
dc.identifier.issn0305-0548en_US
dc.identifier.issn1873-765Xen_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage200en_US
dc.identifier.urihttps://dx.doi.org/10.1016/j.cor.2014.06.009
dc.identifier.urihttps://hdl.handle.net/20.500.12395/31763
dc.identifier.volume55en_US
dc.identifier.wosWOS:000348020600016en_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.ispartofCOMPUTERS & OPERATIONS 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.subjectCapacitated location-routing problemen_US
dc.subjectMixed backhaulsen_US
dc.subjectMemetic algorithmen_US
dc.titleA memetic algorithm for the capacitated location-routing problem with mixed backhaulsen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

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