Optimization Methods and Routing Algorithm in Transport Logistics

The article analyzes the key optimization and planning methods used for transport logistics. An algorithm using graph models for the formation of optimal transportation routes, taking into account the main logistical factors, is considered. In contrast to the classical routing problem for transport logistics, the authors use multifactorial assessment and adap-tive heuristics in the presented work. The heuristics proposed by the authors takes into account not only the distance, but also important logistic parameters, such as fuel costs and the time of passage of the route section. The applied mul-tifactorial assessment allows us to build a refined graph model and obtain optimal routes that take into account many factors, which increases efficiency, reduces costs and delivery time. The problem of multi-criteria route optimization solved by the authors has practical application for routing the delivery of goods from large marketplaces to pick-up points taking into account many factors. To solve the problem, the authors present a multi-factor route optimization method A* with adaptive heuristics. For instrumental support of logistics systems in the object-oriented programming language C#, an algorithm is implemented in the form of a library. The developed algorithm and software allow solving problems of optimization, planning and development of the transport and logistics services sector.

Authors

Publication Details

Journal
Economics Law Innovaion
Published
2024-12-29
DOI
https://doi.org/10.17586/2713-1874-2024-4-21-29
Citations
2
Primary Topic
E-commerce and Technology Innovations
Type
article
Field-Weighted Citation Impact
1.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimization Methods and Routing Algorithm in Transport Logistics

Larisa Nikolaevna Ivanova, Stepan E. Ivanov
2 citations
Economics Law Innovaion
E-commerce and Technology Innovations
1.35
article

Optimization Methods and Routing Algorithm in Transport Logistics

Larisa Nikolaevna Ivanova, Stepan E. Ivanov
article en
2 citations

Abstract

The article analyzes the key optimization and planning methods used for transport logistics. An algorithm using graph models for the formation of optimal transportation routes, taking into account the main logistical factors, is considered. In contrast to the classical routing problem for transport logistics, the authors use multifactorial assessment and adap-tive heuristics in the presented work. The heuristics proposed by the authors takes into account not only the distance, but also important logistic parameters, such as fuel costs and the time of passage of the route section. The applied mul-tifactorial assessment allows us to build a refined graph model and obtain optimal routes that take into account many factors, which increases efficiency, reduces costs and delivery time. The problem of multi-criteria route optimization solved by the authors has practical application for routing the delivery of goods from large marketplaces to pick-up points taking into account many factors. To solve the problem, the authors present a multi-factor route optimization method A* with adaptive heuristics. For instrumental support of logistics systems in the object-oriented programming language C#, an algorithm is implemented in the form of a library. The developed algorithm and software allow solving problems of optimization, planning and development of the transport and logistics services sector.

Economics Law Innovaion(4)
Openalex Percentile: Top 14%
E-commerce and Technology Innovations
1.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.