ScholarLens Back to search
2007•Journal of Zhejiang University(Science Edition)Requires access

Network flow problem with carrier

Enyu Yao

Open publisher page 0 citations

Abstract

A network flow problem with carrier is proposed, which is about transferring cargo from one or multiple points to multiple demanding points by some carrier like truck or ship etc.The goal is to decrease the transferring cost.A mixed integer programming model is used to describe the problem.Lagrangian relaxation with network simplex method is used to get a lower bound of the problem,and furthermore,get a feasible solution to the problem by a heuristic method.

About this research paper

What this paper is about

A network flow problem with carrier is proposed, which is about transferring cargo from one or multiple points to multiple demanding points by some carrier like truck or ship etc.The goal is to decrease the transferring cost.A mixed integer programming model is used to describe the problem.Lagrangian relaxation with network simplex method is used to get a lower bound of the problem,and furthermore,get a feasible solution to the problem by a heuristic method.

Why it matters

A significance statement is not available in the OpenAlex record.

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

A network flow problem with carrier is proposed, which is about transferring cargo from one or multiple points to multiple demanding points by some carrier like truck or ship etc.The goal is to decrease the transferring cost.A mixed integer programming model is used to describe the problem.Lagrangian relaxation with network simplex method is used to get a lower bound of the problem,and furthermore,get a feasible solution to the problem by a heuristic method.

Key concepts: Lagrangian relaxation, Minimum-cost flow problem, Mathematical optimization, Flow network, Integer programming, Simplex algorithm, Heuristic, Flow (mathematics)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Network flow problem with carrier — Research Paper | ScholarLens