甩箱模式下集装箱卡车路径规划问题研究  

The Container Drayage Problem under a Separation Mode

作　　者：张建同[1] 刘晓哲 宋玉坚 ZHANG Jiantong;LIU Xiaozhe;SONG Yujian(School of Economics and Management,Tongji University,Shanghai 200092,China;School of Business Administration,Shanghai Lixin University of Accounting and Finance,Shanghai 201620,China)

机构地区：[1]同济大学经济与管理学院,上海200092 [2]上海立信会计金融学院工商管理学院,上海201620

出　　处：《工业工程与管理》2020年第6期1-8,共8页Industrial Engineering and Management

基　　金：国家自然科学基金面上项目(71971156,71771179)。

摘　　要：以进口港口为背景,研究甩箱模式下的集装箱卡车路径规划问题,通过图建模方法,定义出发/返回节点、运输任务节点、运输弧和装卸弧,将问题转化为非对称多旅行商问题,以最小化总作业时间为目标建立混合整数规划模型。设计改进蚁群算法求解,考虑路径切割限制并通过限制性生成访问序列以提高算法效率,数值实验验证了算法的有效性。甩箱模式相比车箱一体模式能有效减少总作业时间和所需集卡数量。通过敏感性分析发现当客户和堆场位置离港口较近时,总作业时间和所需集卡数量均呈减少趋势。Based on the background of import port,the container truck problem in a separation mode was studied.By graph modeling method,the depot node,task node,transportation arc,loading or unloading arc were defined,the problem was transformed into an asymmetric multi-traveling salesman problem. A mixed integer programming model was formulated with the objective of minimizing the total operation time.Considering the restriction of path cutting and sequence generating,an improved ant colony algorithmwas designed to solve the problem. The numerical experiments show that the proposed algorithm is effective. Compared with the integration mode,the separation mode can effectively reduce total operation time and the number of trucks. Through sensitivity analysis,the operation time and number of trucks are decreasing when customers and depot are near to the port.

关 键 词：集装箱卡车路径规划 甩箱 图建模 蚁群算法 

分 类 号：C931[经济管理—管理学]