基于改进和声搜索算法的越库车辆排序

Improved harmony search algorithm on truck scheduling for cross docking system

实现越库的关键是如何衔接集货车辆和送货车辆,合理的车辆排序可以有效减少越库作业时间。提出采用改进的和声搜索算法(IHS)解决最优化模型,根据和声搜索算法参数值在求解过程中的局限性,采用动态调节方法设定参数;固定参数采用田口试验优化进一步提高运行结果的准确性。仿真结果表明:改进的和声搜索算法在解决越库车辆排序问题上比和声搜索算法(HS)和禁忌搜索算法(TS)寻优能力更强,搜索结果更加接近整体最优解。

The key of realizing the cross dock is to design the joint of inbound trucks and out bound trucks.A proper sequence makes the cross docking more efficient and needs less makespan.Regarding the number of items in the temporary inventory was proportional to the makespan,this paper transfers the objective function of minimizing the makespan into minimizing the number of items in the temporary inventory.An Improved Harmony Search（IHS）algorithm is proposed to solve the optimization problem.Based on the solving limitation on the parameter value of harmony search algorithm,dynamic adjustment method is used to set parameters.The fixed parameters optimized by Taguchi experiments effectively improve the accuracy of solutions further.The simulation results show that the IHS solutions are more close to the overall optimal solutions than the Harmony Search and Tabu Search.HIS is better in terms of searching for optimal solutions to solve the problem of sequencing among inbound and outbound trucks.