ScholarLens Back to search
2008•Journal of Guangzhou UniversityRequires access

A research on the transportation problem based on transport order

Cheng Guo

Open publisher page 3 citations

Abstract

We researched a new transportation problem—the transportation problem based on transport order,established a network flow model based on the new transportation problem,proved its effect,and according to the minimum cost flow problem designed an effective algorithm to solve the problem.The predigest method which converts negative weight into positive weight is adopted,so that we can use Dijkstra’s algorithm to seek the shortest path.Therefore,the algorithm is promoted.

About this research paper

What this paper is about

We researched a new transportation problem—the transportation problem based on transport order,established a network flow model based on the new transportation problem,proved its effect,and according to the minimum cost flow problem designed an effective algorithm to solve the problem.The predigest method which converts negative weight into positive weight is adopted,so that we can use Dijkstra’s algorithm to seek the shortest path.Therefore,the algorithm is promoted.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We researched a new transportation problem—the transportation problem based on transport order,established a network flow model based on the new transportation problem,proved its effect,and according to the minimum cost flow problem designed an effective algorithm to solve the problem.The predigest method which converts negative weight into positive weight is adopted,so that we can use Dijkstra’s algorithm to seek the shortest path.Therefore,the algorithm is promoted.

Key concepts: Dijkstra's algorithm, Transportation theory, Flow network, Mathematical optimization, Minimum-cost flow problem, Shortest path problem, Order (exchange), Path (computing)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A research on the transportation problem based on transport order — Research Paper | ScholarLens