针对船厂运输任务分段的平板车缺乏有效调度的现状，以多种类型平板车和任务分段的承重约束、任务时间窗约束作为约束条件，并考虑实际运输时单个大型分段质量超出现有单个平板车最大承重能力的情况，采用多个平板车合作运输的策略解决该问题.建立以平板车完成任务的空载行驶时间以及平板车的等待时间权重和作为优化目标的模型，设计禁忌搜索算法对模型进行求解.最后以某船厂实际数据为例，对模型的应用进行实例验证.研究结果表明，所提方法可以求解较优的调度方案，并解决大型分段的运输，以实现资源的高效利用.
This paper aims at solving the problem of ineffective dispatching status for flatcars in shipyard transportation tasks using the task time window and the loading constraints of various types of flatcars and blocks as constraints. Considering the fact that the weight of a single large block exceeds the maximum loading capacity of a flatcar during actual transportation, this paper proposes a method of cooperative transportation using multiple flatcars. Aimed at establishing an optimization model, the optimal objects set the no-load travel time and waiting time for the task as the weight of the flatcars. Then, a tabu search algorithm is designed to solve the model proposed. Taking the actual data of a shipyard as an example, the application of the model is verified by specific examples. The results show that the method proposed provides a better scheduling scheme which can solve the transportation problem of large blocks and better realize the efficient utilization of resources.
［1］钟宏才, 蒋如宏, 谭家华, 等. 造船专业化生产单元模型及其作业安排优化［J］. 中国造船, 2004, 45(2): 7-13.
ZHONG Hongcai, JIANG Ruhong, TAN Jiahua, et al. Research on cellular manufacturing model and production plan optimum in shipbuilding［J］. Shipbuilding of China, 2004, 45(2): 7-13.
［2］JOO C M, KIM B S. Block transportation scheduling under delivery restriction in shipyard using meta-heuristic algorithms［J］. Expert Systems with Applications, 2014, 41(6): 2851-2858.
［3］WANG C, MAO Y S, HU B Q, et al. Ship block transportation scheduling problem based on greedy algorithm［J］. Journal of Engineering Science & Technology Review, 2016, 9(2): 93-98.
［4］SALEHI M, JALALIAN M, VALI SIAR M M. Green transportation scheduling with speed control: Trade-off between total transportation cost and carbon emission［J］. Computers & Industrial Engineering, 2017, 113: 392-404.
［5］HU Z H, WEI C. Synchronizing vehicles for multi-vehicle and one-cargo transportation［J］. Computers & Industrial Engineering, 2018, 119: 36-49.
［6］张志英, 徐建祥, 计峰. 基于遗传算法的船舶分段堆场调度研究［J］. 上海交通大学学报, 2013, 47(7): 1036-1042.
ZHANG Zhiying, XU Jianxiang, JI Feng. Shipbuilding yard scheduling approach based on genetic algorithm［J］. Journal of Shanghai Jiao Tong University, 2013, 47(7): 1036-1042.
［7］王冲, 茅云生, 辛锺桂. 基于遗传算法的船舶分段运输调度方法［J］. 上海交通大学学报, 2017, 51(3): 338-343.
WANG Chong, MAO Yunsheng, SHIN Jonggye. Ship block transportation scheduling approach based on genetic algorithm［J］. Journal of Shanghai Jiao Tong University, 2017, 51(3): 338-343.
［8］TAILLARD , BADEAU P, GENDREAU M, et al. A tabu search heuristic for the vehicle routing problem with soft time windows［J］. Transportation Science, 1997, 31(2): 170-186.
［9］CORDEAU J F, LAPORTE G, MERCIER A. A unified tabu search heuristic for vehicle routing problems with time windows［J］. Journal of the Operational Research Society, 2001, 52(8): 928-936.
