Traveling salesman problem with drone and bicycle: multimodal last-mile e-mobility

Basit Öğe Kaydı
dc.authoridCAKMAK, Emre/0000-0002-3406-3144
dc.authoridKaradayi-Usta, Saliha/0000-0002-8348-4033
dc.authoridTirkolaee, Erfan Babaee/0000-0003-1664-9210
dc.authorwosidCAKMAK, Emre/HNQ-5290-2023
dc.authorwosidKaradayi-Usta, Saliha/U-8744-2018
dc.authorwosidTirkolaee, Erfan Babaee/U-3676-2017
dc.contributor.authorTirkolaee, Erfan Babaee
dc.contributor.authorCakmak, Emre
dc.contributor.authorKaradayi-Usta, Saliha
dc.date.accessioned2024-05-19T14:47:05Z
dc.date.available2024-05-19T14:47:05Z
dc.date.issued2024
dc.departmentİstinye Üniversitesien_US
dc.description.abstractRecently, the multimodal last-mile e-mobility concept has been at the center of attention for cleaner, greener, and more accessible urban deliveries. As part of sustainable transportation systems, multimodal e-mobility is proper for a variety of logistics operations as well as medical applications. This work tries to address a novel application of multimodal e-mobility through introducing and modeling the traveling salesman problem with drone and bicycle (TSP-D-B). Therefore, a novel mixed integer linear programming model is developed to formulate the problem wherein the total traveling time is minimized. As part of the last-mile delivery, a fleet of three vehicles including a truck, a drone, and a bicycle is taken into account to serve the customers in a single visit. The truck is considered as the main vehicle, while the drone and bicycle can be preferred in case of emergencies such as traffic or route failures. In order to assess the complexity, validity and applicability of the offered model, a dataset including 64 different benchmarks is generated, and according to the findings, the model is able to efficiently solve the benchmarks for up to 50 customers in 685 s maximum. A comparison is also made between TSP-D-B, the classic version of the TSP and the TSP-D, which reveals that TSP-D-B provides appropriate service time savings in all benchmarks. Finally, another comparative analysis is made using several instances adapted from the literature. It is revealed that TSP-D-B leads to significant time savings in most instances.en_US
dc.identifier.doi10.1111/itor.13452
dc.identifier.issn0969-6016
dc.identifier.issn1475-3995
dc.identifier.scopus2-s2.0-85188150753en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.urihttps://doi.org10.1111/itor.13452
dc.identifier.urihttps://hdl.handle.net/20.500.12713/5648
dc.identifier.wosWOS:001187622600001en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherWileyen_US
dc.relation.ispartofInternational Transactions In Operational Researchen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.snmz20240519_kaen_US
dc.subjectTraveling Salesman Problem With Drone And Bicycleen_US
dc.subjectMultimodal E-Mobilityen_US
dc.subjectLast-Mile Deliveryen_US
dc.subjectBike Deliveryen_US
dc.titleTraveling salesman problem with drone and bicycle: multimodal last-mile e-mobilityen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

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