应对紧急附加订单的汽车滚装堆场车位合并分配优化

利用汽车滚装码头可对车辆流通过程中的时间及空间加以压缩的属性,解决整车供应链系统中市场紧急需求问题.将汽车滚装堆场作为紧急附加订单与原计划订单进行合并的响应点,通过建立0-1整数规划模型,使两类订单中所有类型的汽车均达到集聚分配的状态,为集中高效装载提供必要条件.构建了车位合并分配算法获得问题的较优初始可行解,进而与吸引度搜索算法相融合,获得最优或次优的堆场车位合并分配方案.与分支定界方法及有序车位合并分配方式对比的数值实验证明了算法的优越性.实际应用实验,进一步验证了启发式算法求解大规模算例的高效性.

Optimization for incorporative distribution of parking space considering additional emergency order in automotive ro-ro storage yard

Utilizing the attribute that automotive ro-ro storage yard can compress time-space distance of vehicle transportation resolves the problem of market emergency demand in the vehicle supply chain system. In this paper, the storage yard is regarded as an important node, which combines the planned order and additional emergency order. An incorporative distribution problem of the planned and additional emergency orders is considered for the gathered distribution of vehicles in the yard. A 0-1 integer programming model is presented, so as to make all types of vehicles belonging to these two orders realize centralized distribution. Which provides conditions for centrally efficient loading. One parking spaces incorporative distribution algorithm is designed to obtain a satisfied initial vehicles distribution. Moreover, combined with attraction degree search, the suboptimal solution can be solved quickly. Numerical experiments show, the proposed method have better performance compared with the branch-and-bound method and the way of orderly distribution. Experiments of practical application make further certification that the heuristic algorithm can solve large-scale examples efficiently.