Comparison of Optimal Solutions of Clusters Created Using Clustering Algorithm with Meta-Heuristic Algorithms in Capacity Vehicle Routing Problem

dc.contributor.authorSehitoglu, Adem
dc.contributor.authorAghayeva, Charkaz
dc.date.accessioned2024-12-14T22:04:52Z
dc.date.available2024-12-14T22:04:52Z
dc.date.issued2023
dc.description5th International Conference on Problems of Cybernetics and Informatics, PCI 2023 -- 28 August 2023 through 30 August 2023 -- Baku -- 195003en_US
dc.description.abstractVehicle Routing Problem (VRP) has been recognized as an important segment in logistics transportation. Selection of suitable vehicle routes plays a crucial role in improving the economic benefits of logistics operations. The Capacity Vehicle Routing Problem (CVRP) is one of the most popular routing problems. At CVRP, a fleet of capable vehicles located in a central warehouse is used to deliver products to a range of geographically dispersed customers with known demand. The routing problem discussed in this study will be examined in two stages. First, k subsets will be created with the k-means algorithm for a customer set consisting of N numbers. In the second stage, each of the clusters created will be compared in terms of distance and time, and the solution performances obtained by the Ant Colony, Tabu Search and Simulated Annealing algorithm. © 2023 IEEE.en_US
dc.identifier.doi10.1109/PCI60110.2023.10325974
dc.identifier.isbn979-835031906-4
dc.identifier.scopus2-s2.0-85179885370
dc.identifier.scopusqualityN/A
dc.identifier.urihttps://doi.org/10.1109/PCI60110.2023.10325974
dc.identifier.urihttps://hdl.handle.net/20.500.12639/6391
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers Inc.en_US
dc.relation.ispartof2023 5th International Conference on Problems of Cybernetics and Informatics, PCI 2023en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.snmzKA_20241214
dc.subjectk-means algorithmen_US
dc.subjectMeta-Heuristic Algorithmen_US
dc.subjectOptimizationen_US
dc.subjectVehicle Routing Problemen_US
dc.titleComparison of Optimal Solutions of Clusters Created Using Clustering Algorithm with Meta-Heuristic Algorithms in Capacity Vehicle Routing Problemen_US
dc.typeConference Object

Dosyalar

Orijinal paket

Listeleniyor 1 - 1 / 1
Yükleniyor...
Küçük Resim
İsim:
6391.pdf
Boyut:
1.3 MB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam Metin / Full Text