带时间窗约束的集装箱接驳运输问题模型研究

Research on Container Feeder Transportation Model with Time Window Constraints

集装箱接驳运输是集装箱运输过程中的重要环节。针对带有时间窗约束的集装箱接驳运输问题,本文首先考虑四种集装箱接驳运输任务(进口重箱,出口重箱,进口空箱,出口空箱)的实际运输要求,确定其时间窗约束,其次,基于图论知识,采用一种确定的活动在顶点上的图的描述方法,将集装箱接驳运输问题转化为一个混合0-1线性规划模型,考虑其计算复杂度,设计了一种改进的遗传算法对该问题进行求解。最后给出算例,运用本文的求解方法进行计算,结果与其他方法相比较,本文所提出的算法比目前已知的最优解差了2.1%,但是计算速度提高了51.4%。总体上在目标函数值和计算时间上都较优。

Container feeder transportation is an important part of the whole container transportation system.In order to solve the problem of container feeder transportation with time window constraints,this paper first considers the actual transportation requirements of four kinds of container feeder transportion tasks(import heavy container,export heavy container,import empty container,exit empty container),and then determines the time window constraints.Secondly,based on graph theory knowledge,the container feeder transportation problem is transformed into a mixed 0-1 linear programming model by using a certain graph description method which is active on the vertex.Due to its computational complexity,an improved Genetic Algorithm is designed to solve the problem.Finally,a case study is given to solve the problem.Compared with other methods,the algorithm proposed in this paper is 2.1 percentage worse than the already known optimal solution,but the speed of calculation is increased by 51.4 percentage.On the whole,the quality of objective function value and calculation time in this paper are better.