Developing a Learning Hybrid NoSql Algorithm for Vehicle Routing Problem

In this study, a learning Vehicle Routing Algorithm was developed to optimize the delivery of the products in the warehouses located in one or more central locations to the customers in various locations using a certain number of vehicles, and the return of the vehicles to the warehouse/home, and th...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2023 8th International Conference on Computer Science and Engineering (UBMK) s. 420 - 425
Hlavní autoři: Ozdemir, Rustu Hilmi, Sertbas, Ahmet
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 13.09.2023
Témata:
Big Data
Computer science
Constraint optimization
Hybrid Learning Algorithm
Layout
NOSQL Database Algorithm
Planning
Roads
Vehicle routing
Vehicle Routing Problem
ISSN:2521-1641
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this study, a learning Vehicle Routing Algorithm was developed to optimize the delivery of the products in the warehouses located in one or more central locations to the customers in various locations using a certain number of vehicles, and the return of the vehicles to the warehouse/home, and the results were compared with other algorithms used in the literature in terms of accuracy and time performance. A hybrid algorithm that works on a hierarchical database has been developed for the distribution of multiple locations according to the Time Intervals, Types, In-Route Constraints, Optimization Purposes, Road Structure, Fleet Structure and Layout, Inter-Route Constraints. Past plans help to create new plans. New plans are versions of old plans adapted to the new situation. This process is called "learning by planning". 25% increase in accuracy and 97% increase in time performance was observed.
ISSN:2521-1641
DOI:10.1109/UBMK59864.2023.10286629