A Hybrid Metaheuristic Solution Method to Traveling Salesman Problem with Drone

Basit Öğe Kaydı
dc.authoridGunay-Sezer, Noyan Sebla/0009-0003-1508-1165
dc.authoridCAKMAK, Emre/0000-0002-3406-3144
dc.authorwosidGunay-Sezer, Noyan Sebla/JDD-3207-2023
dc.authorwosidCAKMAK, Emre/HNQ-5290-2023
dc.contributor.authorGunay-Sezer, Noyan Sebla
dc.contributor.authorCakmak, Emre
dc.contributor.authorBulkan, Serol
dc.date.accessioned2024-05-19T14:47:05Z
dc.date.available2024-05-19T14:47:05Z
dc.date.issued2023
dc.departmentİstinye Üniversitesien_US
dc.description.abstractThe challenging idea of using drones in last-mile delivery systems of logistics addresses a new routing problem referred to as the traveling salesman problem with drone (TSP-D). TSP-D aims to construct a route to deliver parcels to a set of customers by either a truck or a drone, thereby minimizing operational costs. Since TSP-D is considered NP-hard, using metaheuristics is one of the most promising solutions. This paper presents a hybrid metaheuristic solution method of TSP-D based on two state-of-the-art algorithms: the genetic algorithm and ant colony optimization algorithm. Heuristics in TSP-D literature are based on two consequent decisions: truck routing and drone assignment. Unlike those in the existing literature, the proposed metaheuristic constructs both truck and drone routes simultaneously. Additionally, to the best of our knowledge, we introduce for the first time a solution method on the basis of an ant colony optimization approach to TSP-D. Additionally, we propose a binary pheromone framework for both drone and truck, diverging from the traditional pheromone structure. Computational experiments indicate that the proposed hybrid metaheuristic algorithm is able to generate optimal routes for provided instances of TSP-D benchmarking. In addition, the algorithm improves the best-known solutions of some instances found by rival heuristics.en_US
dc.identifier.doi10.3390/systems11050259
dc.identifier.issn2079-8954
dc.identifier.issue5en_US
dc.identifier.scopus2-s2.0-85160064625en_US
dc.identifier.scopusqualityQ2en_US
dc.identifier.urihttps://doi.org10.3390/systems11050259
dc.identifier.urihttps://hdl.handle.net/20.500.12713/5649
dc.identifier.volume11en_US
dc.identifier.wosWOS:000997897800001en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherMdpien_US
dc.relation.ispartofSystemsen_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 Droneen_US
dc.subjectLast-Mile Deliveryen_US
dc.subjectGenetic Algorithmen_US
dc.subjectAnt Colony Optimizationen_US
dc.titleA Hybrid Metaheuristic Solution Method to Traveling Salesman Problem with Droneen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

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