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 modal, 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. Lingo9.0 is used to solve the modal 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 words: routing, transport, container, integer programming, simulation

摘要： 应用整数规划研究航运集装箱路径选择问题，并将重箱和空箱统一在一个系统中研究。在本文模型中，以集装箱运输总利润最大化为目标函数，利润是重箱运输利润减去重、空箱运输成本。约束条件考虑到满足空集装箱需求和重集装箱需求、航线运输能力限制及空箱供给数量等。应用LINGO9.0求解模型，并通过数值仿真来证明不同参数影响下的调运策略。本文旨在为船公司提供合理的航运集装箱运输方案，从而降低船公司的集装箱运输成本，实现船公司集装箱运输效益最大化。

关键词: 航线, 运输, 集装箱, 整数规划, 仿真