Containership stowage plans are a pivotal teaches in the system of container transportation.With the increasing containers shipping,planning containership stowage has become more and more complicated.So intelligent st...Containership stowage plans are a pivotal teaches in the system of container transportation.With the increasing containers shipping,planning containership stowage has become more and more complicated.So intelligent stowage planning for containerships is of great significance.An effective stowage plan may improve efficiency of transportation system.First,the progress of containership stowage plan at home and abroad is reviewed,including the latest developments,such as the application of various optimization methods and computer techniques to the problem.Then,the complexities of the problem are discussed and areas where investigations are still needed are pointed out.This will provide a reference for further research on the subject.展开更多
In a general case, container ship serves many different ports on each voyage. A stowage planning for container ship made at one port must take account of the influence on subsequent ports. So the complexity of stowage...In a general case, container ship serves many different ports on each voyage. A stowage planning for container ship made at one port must take account of the influence on subsequent ports. So the complexity of stowage planning problem increases due to its multi-ports nature. This problem is NP-hard problem. In order to reduce the computational complexity, the problem is decomposed into two sub-problems in this paper. First, container ship stowage problem (CSSP) is regarded as 'packing problem', ship-bays on the board of vessel are regarded as bins, the number of slots at each bay are taken as capacities of bins, and containers with different characteristics (homogeneous containers group) are treated as items packed. At this stage, there are two objective functions, one is to minimize the number of bays packed by containers and the other is to minimize the number of overstows. Secondly, containers assigned to each bays at first stage are allocate to special slot, the objective functions are to minimize the metacentric height, heel and overstows.The taboo search heuristics algorithm are used to solve the subproblem. The main focus of this paper is on the first subproblem. A case certifies the feasibility of the model and algorithm.展开更多
文摘在分析影响集装箱的装载效率时,考虑场内拖车在码头堆场和岸边装卸桥之间的移动距离,将配载问题看成是以码头堆场B ay位上的集装箱为供给、船舶B ay上的空箱位为需求的运输问题,以场内拖车将码头堆场集装箱送到岸边装卸桥所运行的距离最短为目标,建立配载模型并应用Hop fie ld神经网络模型进行计算机模拟.模拟结果说明,所提出的优化模型可以减少场内拖车运行的距离,提高集装箱装载效率,为合理进行集装箱船配载提供了一个参考模型.
基金Supported by High-tech Research of Educational Department of Liaoning Province (No.05L091)a Special Fund Support Item of Doctor Subject of Colleges and Universities(No.2000014125)
文摘Containership stowage plans are a pivotal teaches in the system of container transportation.With the increasing containers shipping,planning containership stowage has become more and more complicated.So intelligent stowage planning for containerships is of great significance.An effective stowage plan may improve efficiency of transportation system.First,the progress of containership stowage plan at home and abroad is reviewed,including the latest developments,such as the application of various optimization methods and computer techniques to the problem.Then,the complexities of the problem are discussed and areas where investigations are still needed are pointed out.This will provide a reference for further research on the subject.
基金Supported by a Special Fund Support Item of Doctor Subject of Colleges and Universities (No. 2000014125)
文摘In a general case, container ship serves many different ports on each voyage. A stowage planning for container ship made at one port must take account of the influence on subsequent ports. So the complexity of stowage planning problem increases due to its multi-ports nature. This problem is NP-hard problem. In order to reduce the computational complexity, the problem is decomposed into two sub-problems in this paper. First, container ship stowage problem (CSSP) is regarded as 'packing problem', ship-bays on the board of vessel are regarded as bins, the number of slots at each bay are taken as capacities of bins, and containers with different characteristics (homogeneous containers group) are treated as items packed. At this stage, there are two objective functions, one is to minimize the number of bays packed by containers and the other is to minimize the number of overstows. Secondly, containers assigned to each bays at first stage are allocate to special slot, the objective functions are to minimize the metacentric height, heel and overstows.The taboo search heuristics algorithm are used to solve the subproblem. The main focus of this paper is on the first subproblem. A case certifies the feasibility of the model and algorithm.
