基于改进禁忌搜索算法的整车混装配载优化方法  

An optimization approach of the finished vehicle mixed loading problem based on improved Tabu search algorithm

作　　者：黎雪芬[1] 瞿佳伟 刘建胜[2] Li Xuefen;Qu Jiawei;Liu Jiansheng(School of Control Technology,Wuxi Institute of Technology,Wuxi 214121;School of Mechanical and Electrical Engineering,Nanchang University,Nanchang 330031)

机构地区：[1]无锡职业技术学院控制技术学院,无锡214121 [2]南昌大学机电工程学院,南昌330031

出　　处：《高技术通讯》2021年第4期441-446,共6页Chinese High Technology Letters

基　　金：国家自然科学基金(51565036)资助项目。

摘　　要：根据商品车、轿运车主要几何特征,分别对商品车结构和轿运车结构建模。考虑多目的地不同订单需求、商品车配载三维尺寸约束和轿运车运输能力约束为限制条件,以混合配载利润最大化为目标函数,建立轿运车配载优化模型。针对禁忌搜索算法易局部收敛的缺点,引入贪心算法,并在禁忌搜索算法中采用两种置换操作生成领域,进而设计了一种改进的禁忌搜索算法进行求解,应用Matlab软件进行仿真计算,仿真实验结果证明了算法的有效性。According to the main geometric features of the finished vehicle and transport vehicle,the geometry structure modeling of finished vehicle and transport vehicle are carried out respectively.Considering the constraint of different orders of multi-destinations,three-dimensional of finished vehicle and the constraint of capacity of transport vehicle,a mixed loading optimization modeling of the transport vehicle is built in order to get the max profits.In view of the local converge shortcoming of tabu search algorithm,a greedy algorithm is introduced,and two permutation operations are used to generate the domain of Tabu search algorithm,and then an improved tabu search algorithm is designed to solve the problem with Matlab.Finally,the effectiveness of the algorithm is proved by simulation experiments.

关 键 词：整车配送 配载优化 贪心策略 禁忌搜索 

分 类 号：U468.8[机械工程—车辆工程]