2008Journal of Transportation Systems Engineering and Information TechnologyRequires access

Optimization of Shipping Container Route Choice

Tang Guo-chun

Open publisher page 1 citations

Abstract

This paper studies the optimization of choosing shipping container route by integer programming.Both heavy and empty containers are combined into a system.In the model,the objective function is to maximize the total profit of container transport.The profit caused by the heavy transport minus the cost caused by the heavy and empty container transport equals to the total profit.The constraints to the modal include meeting the need of heavy and empty containers,the limit to transport ability of a line and the number of empty containers supported.Lingo 9.0 is used to solve the model and shipping methods in varied parameters are shown by simulation.The aim of the paper is to provide a reasonable project of shipping container route choice,so the container transportation cost of a shipping company can be reduced and its profit made by container transport is maximized.

About this research paper

What this paper is about

This paper studies the optimization of choosing shipping container route by integer programming.Both heavy and empty containers are combined into a system.In the model,the objective function is to maximize the total profit of container transport.The profit caused by the heavy transport minus the cost caused by the heavy and empty container transport equals to the total profit.The constraints to the modal include meeting the need of heavy and empty containers,the limit to transport ability of a line and the number of empty containers supported.Lingo 9.0 is used to solve the model and shipping methods in varied parameters are shown by simulation.The aim of the paper is to provide a reasonable project of shipping container route choice,so the container transportation cost of a shipping company can be reduced and its profit made by container transport is maximized.

Why it matters

OpenAlex reports 1 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

This paper studies the optimization of choosing shipping container route by integer programming.Both heavy and empty containers are combined into a system.In the model,the objective function is to maximize the total profit of container transport.The profit caused by the heavy transport minus the cost caused by the heavy and empty container transport equals to the total profit.The constraints to the modal include meeting the need of heavy and empty containers,the limit to transport ability of a line and the number of empty containers supported.Lingo 9.0 is used to solve the model and shipping methods in varied parameters are shown by simulation.The aim of the paper is to provide a reasonable project of shipping container route choice,so the container transportation cost of a shipping company can be reduced and its profit made by container transport is maximized.

Key concepts: Container (type theory), Profit (economics), Integer programming, Operations research, Transport engineering, Computer science, Engineering, Microeconomics

Related papers

Back to paper searchBrowse research topicsOriginal source
Optimization of Shipping Container Route Choice — Research Paper | ScholarLens