Research on the Optimization of Electric Coal Transportation Routes Based on the Branch and Bound Method

This article focuses on the existing status in the process of electric coal allocation and transportation, considering how to reasonably integrate and optimize coal resources and transportation capacity to formulate the most economic resource allocation scheme and the most reasonable cross-regional allocation plan. By employing a series of theories and methods in logistics engineering, and based on the theory of cost minimization and the current characteristics of electric coal transportation, the research proposes optimization of electric coal transportation routes. This paper selects an appropriate modeling type for the specific scenario of large-scale transportation problems with interval parameters, multidimensionality, multiple constraints, multiple objectives, and considers the uncertainty of time in electric coal transportation. It establishes a transportation route planning model aimed at minimizing the delivered price during the electric coal allocation process, optimizing the many-to-many matching of coal mines and power plants, and the transportation routes. The Branch and Bound algorithm is used to solve and evaluate the problem, thereby verifying the feasibility of the electric coal transportation route optimization method based on minimizing the delivered price, and obtaining the scheme with the lowest delivered coal price and the transportation routes.

Authors

Institutions

Publication Details

Journal
Industry science and engineering.
Published
2024-12-01
DOI
https://doi.org/10.62381/i245c01
Primary Topic
Power Systems and Technologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on the Optimization of Electric Coal Transportation Routes Based on the Branch and Bound Method

Lu Sun
Industry science and engineering.
Power Systems and Technologies
article

Research on the Optimization of Electric Coal Transportation Routes Based on the Branch and Bound Method

Lu Sun
article en

Abstract

This article focuses on the existing status in the process of electric coal allocation and transportation, considering how to reasonably integrate and optimize coal resources and transportation capacity to formulate the most economic resource allocation scheme and the most reasonable cross-regional allocation plan. By employing a series of theories and methods in logistics engineering, and based on the theory of cost minimization and the current characteristics of electric coal transportation, the research proposes optimization of electric coal transportation routes. This paper selects an appropriate modeling type for the specific scenario of large-scale transportation problems with interval parameters, multidimensionality, multiple constraints, multiple objectives, and considers the uncertainty of time in electric coal transportation. It establishes a transportation route planning model aimed at minimizing the delivered price during the electric coal allocation process, optimizing the many-to-many matching of coal mines and power plants, and the transportation routes. The Branch and Bound algorithm is used to solve and evaluate the problem, thereby verifying the feasibility of the electric coal transportation route optimization method based on minimizing the delivered price, and obtaining the scheme with the lowest delivered coal price and the transportation routes.

Industry science and engineering.Vol. 1(12)
China Huadian Corporation (China) (CN)
Openalex Percentile: Top 72%
Power Systems and Technologies
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.