Logistics Distribution Path Optimization Using Support Vector Machine Algorithm under Different Constraints
Author(s) -
Li Chen
Publication year - 2022
Publication title -
wireless communications and mobile computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.42
H-Index - 64
eISSN - 1530-8677
pISSN - 1530-8669
DOI - 10.1155/2022/7260995
Subject(s) - computer science , mathematical optimization , algorithm , estimation of distribution algorithm , scheduling (production processes) , path (computing) , range (aeronautics) , product (mathematics) , mathematics , geometry , programming language , materials science , composite material
Accelerating product flow, improving service level, lowering logistics costs, reducing the possibility of product losses in circulation, and thus optimizing the logistics distribution system are the issues that enterprise managers should consider in logistics distribution. Traditional algorithms can only solve simple problems, while intelligent algorithms can solve the most complex combinatorial optimization problems. The optimization problem of logistics vehicle scheduling path with different constraints is studied in this paper using the SVM algorithm, and the improved algorithm is simulated to verify its effectiveness. The simulation results show that the logistics distribution path optimization method based on the SVM algorithm has good global searching ability, effectively avoids the algorithm falling into local optimum, and reduces total distribution cost, proving the algorithm’s effectiveness. This scheme can optimize vehicle routes, increase distribution efficiency, and reduce logistics costs, and it can be used in a wide range of logistics distribution route optimization applications.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom