Optimization Algorithm for Enlarging Capacity of Transportation Network
Qi Song
Abstract
Qi Song
Abstract
It is an important problem how to choose an economic and reasonable method to improve the capacity of the transportation network when the expected net flow has already exceeded the maximum capacity of the transportation network.An optimization model is set up for expanding the capacity of the transportation network,then an algorithm is designed to solve it through iterative shortest path of enlarging cost.Finally,an example is performed to verify the validity of the model and the algorithm which give a reference for solving the real problem.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
It is an important problem how to choose an economic and reasonable method to improve the capacity of the transportation network when the expected net flow has already exceeded the maximum capacity of the transportation network.An optimization model is set up for expanding the capacity of the transportation network,then an algorithm is designed to solve it through iterative shortest path of enlarging cost.Finally,an example is performed to verify the validity of the model and the algorithm which give a reference for solving the real problem.
Key concepts: Flow network, Shortest path problem, Mathematical optimization, Transportation theory, Computer science, Set (abstract data type), Algorithm, Maximum flow problem