论文部分内容阅读
对港口和发货人/收货人之间的集装箱卡车运输问题给出了基于图的建模方法.该图不仅可以描述进出口空箱或满箱的运输,而且可以描述空集装箱作为运输资源的属性.这种图将确定的活动描述为顶点,将不确定的活动描述为弧,称为确定活动在顶点上的图(DAOV图).基于这种方法,建立了集装箱卡车运输问题的基本情形、多堆场多港口情形以及堆场上的空箱数目给定情形的数学模型;相应问题被描述为带时间窗的多旅行商问题(m-TSPTW)、多堆场的m-TSPTW以及带资源约束的m-TSPTW.而且这种方法可以扩展到集装箱卡车运输问题的更一般情形,这体现出该建模方法的有效性.
A diagram-based modeling approach to container truck transport between ports and consignors / consignees is given, which not only describes the transport of empty or full boxes, but also describes empty containers as transport resources This plot describes the identified activity as a vertex and an indeterminate activity as an arc, a graph that defines the activity’s apex (DAOV graph). Based on this method, the basic problem of container truck transport is established M-TSPTW, multi-reactor m-TSPTW, and multi-reactor m-TSPTW with multi-traveling salesman problem (m-TSPTW) M-TSPTW with resource constraints and this approach can be extended to the more general case of container truck transport problems, demonstrating the effectiveness of this modeling approach.