Research on Approval and Global Optimal Path Planning Strategy for Bulk Transportation Based on Greedy Algorithm

Under the new situation of continuous and stable development of China's economy, large products have extremely high requirements on transportation safety due to their high price, complex transportation technical requirements, which determines that large products should be delivered to customers in the safest and most economical way, which poses a difficult problem for decision makers to choose the optimal path.In this paper, we constructed an intelligent approval framework for bulky transportation, made technical and economic analysis of transportation routes, and established a multi-objective optimization mathematical model for path selection of bulky transportation vehicles.A hybrid genetic algorithm incorporating greedy strategy is proposed to solve the problem, which strengthens the ability of the algorithm to jump out of the local extremes and selects the optimal chromosome in the final population as the resulting optimal solution.The results of the approval and optimal route planning for bulky transportation are verified by the method of example experimental analysis.The volume of bulky transportation increases with the increase of years until 2023, and the GDP, value added of tertiary industry, total population, and road mileage are 1015987.54, 553948.15,140563, and 536.48, respectively.In the instances where the number of orders is 2000 or more, the transportation distance, the maximum number of service bundles of orders on the route, and the maximum service hours of vehicles the mean values are 50, 3.56, and 14.33, respectively.According to the constructed mathematical model, the optimal line for the bulky transportation scheme is 02478, and the total transportation cost is 670,500,000 yuan, of which the transportation costs are 116,500,000 yuan, 320,000 yuan, 151,000,000 yuan, and 83,000,000 yuan, respectively.

Publication Details

Journal
Journal of Combinatorial Mathematics and Combinatorial Computing
Published
2025-04-18
DOI
https://doi.org/10.61091/jcmcc127b-167
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on Approval and Global Optimal Path Planning Strategy for Bulk Transportation Based on Greedy Algorithm

Journal of Combinatorial Mathematics and Combinatorial Computing
Robotic Path Planning Algorithms
article

Research on Approval and Global Optimal Path Planning Strategy for Bulk Transportation Based on Greedy Algorithm

article en

Abstract

Under the new situation of continuous and stable development of China's economy, large products have extremely high requirements on transportation safety due to their high price, complex transportation technical requirements, which determines that large products should be delivered to customers in the safest and most economical way, which poses a difficult problem for decision makers to choose the optimal path.In this paper, we constructed an intelligent approval framework for bulky transportation, made technical and economic analysis of transportation routes, and established a multi-objective optimization mathematical model for path selection of bulky transportation vehicles.A hybrid genetic algorithm incorporating greedy strategy is proposed to solve the problem, which strengthens the ability of the algorithm to jump out of the local extremes and selects the optimal chromosome in the final population as the resulting optimal solution.The results of the approval and optimal route planning for bulky transportation are verified by the method of example experimental analysis.The volume of bulky transportation increases with the increase of years until 2023, and the GDP, value added of tertiary industry, total population, and road mileage are 1015987.54, 553948.15,140563, and 536.48, respectively.In the instances where the number of orders is 2000 or more, the transportation distance, the maximum number of service bundles of orders on the route, and the maximum service hours of vehicles the mean values are 50, 3.56, and 14.33, respectively.According to the constructed mathematical model, the optimal line for the bulky transportation scheme is 02478, and the total transportation cost is 670,500,000 yuan, of which the transportation costs are 116,500,000 yuan, 320,000 yuan, 151,000,000 yuan, and 83,000,000 yuan, respectively.

Journal of Combinatorial Mathematics and Combinatorial ComputingVol. 127b
Science and Technology Department of Guangxi Zhuang Autonomous
Openalex Percentile: Top 94%
Robotic Path Planning Algorithms
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.

Research on Approval and Global Optimal Path Planning Strategy for Bulk Transportation Based on Greedy Algorithm · Journal of Combinatorial Mathematics and Combinatorial Computing (2025) | TGRS Research Map | TGRS