Two-echelon vehicle routing problem with simultaneous pickup and delivery: Mathematical model and heuristic approach

Basit Öğe Kaydı
dc.contributor.authorBelgin, Önder
dc.contributor.authorKaraoğlan, İsmail
dc.contributor.authorAltıparmak, Fulya
dc.date.accessioned2020-03-26T20:11:38Z
dc.date.available2020-03-26T20:11:38Z
dc.date.issued2018
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractThe vehicle routing problem is one of the most important areas of logistics management. This study considers two-echelon vehicle routing problem with simultaneous pickup and delivery (2E-VRPSPD) which is a variant of vehicle routing problem. In the 2E-VRPSPD, the pickup and delivery activities are performed simultaneously by the same vehicles through depot to satellites in the first echelon and from satellites to customers in the second echelon. To solve the problem, firstly, a node-based mathematical model is proposed and three valid inequalities from the literature are adapted to strengthen the model. Because of the NP-hardness of the 2E-VRPSPD, secondly, a hybrid heuristic algorithm based on variable neighborhood descent (VND) and local search (LS), called VND_LS, is developed to solve medium- and large-size instances of the 2E-VRPSPD. We conduct an experimental study to investigate the effectiveness of the valid inequalities on the mathematical model and also to evaluate the effectiveness and efficiency of the VND_LS. Computational results show that valid inequalities have significant effect to strengthen the mathematical formulation. Furthermore, the VND_LS finds good solutions for the problem efficiently. Finally, we apply the VND_LS to compare single- and two-echelon distribution systems for a supermarket chain located in Turkey. The results indicate that the VND_LS can easily be applied for real-world problems.en_US
dc.identifier.doi10.1016/j.cie.2017.10.032en_US
dc.identifier.endpage16en_US
dc.identifier.issn0360-8352en_US
dc.identifier.issn1879-0550en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage1en_US
dc.identifier.urihttps://dx.doi.org/10.1016/j.cie.2017.10.032
dc.identifier.urihttps://hdl.handle.net/20.500.12395/37106
dc.identifier.volume115en_US
dc.identifier.wosWOS:000425075400001en_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 & INDUSTRIAL ENGINEERINGen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectTwo-echelon vehicle routingen_US
dc.subjectSimultaneous pickup and deliveryen_US
dc.subjectVariable neighborhood descenten_US
dc.subjectLocal searchen_US
dc.titleTwo-echelon vehicle routing problem with simultaneous pickup and delivery: Mathematical model and heuristic approachen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

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