关键词: 航线, 运输, 集装箱, 机会约束规划, 仿真

Abstract: The optimization of repositioning container stochastically on sea-bound is studied by use of chance-constrained programming. Both heavy and empty containers are combined into an integral system. The model that the objective function is to maximize the total profit of container repositioning is proposed. The profits caused by heavy containers repositioning subtracting costs resulting from both heavy and empty containers are equal to the total profit. The constraints to the modal inelude meeting the need of heavy and empty containers, the limit to transport ability of a line and the number of empty container supported. The number of empty container needed is stochastic. The chance-constrained programming is transferred into integer programming. LINGO 9.0 is used to solve the integer modal. The model in varied parameters are shown by simulation. The aim of the paper is to provide a reasonable project of repositioning container, so the container repositioning cost of a shipping company ean be reduced and the its profits made by container repositioning are maximized.

Key words: routing , transport , container , chance-constrained programming , simulation ;