单车场无时间窗甩挂运输车辆调度的启发式算法  

Study on Heuristic Algorithm for Single-yard Dispatching of Drop-and-pull Transportation Vehicles without Time Window

作　　者：张振华[1] 贾淑娟[2] 顾九春[1] 

机构地区：[1]鲁东大学交通学院,山东烟台264025 [2]鲁东大学土木工程学院,山东烟台264025

出　　处：《物流技术》2014年第9期152-155,165,共5页Logistics Technology

基　　金：国家自然科学基金项目(61374108);山东省科技发展项目(2012YD05008);山东省自然科学基金项目(ZR2011FM016)

摘　　要：考虑了牵引车空驶、带空挂车行驶和带重挂车行驶所引起的成本差异,定义了牵引车运行成本的概念,将总运行成本最小作为调度方案优劣的判别指标,并同时考虑牵引车数量最少。将牵引任务分为四种类型,定义了任务链、虚拟任务、链内交叉和链间交叉的概念,提出了一种求解该类单车场甩挂运输车辆调度无时间窗约束的启发式算法,包括初始调运方案、链内优化、空车调运交叉、牵引车数量优化和链间交叉。最后给出了仿真算例,算法优化后的最终方案与初始方案相比,牵引车数量减少,总运行成本降低,验证了算法的有效性和可行性。In this paper, we defined the concept of the operational cost of the tow trucks, then with the minimization of the total operational cost and minimal truck number as the indexes for the judgment of dispatching plans, proposed a heuristic algorithm for the solution of the dispatching problem of the single-yard drop-and-pull transportation vehicles without time window constraint, and at the end, presented a simulation example to demonstrate the validity and feasibility of the algorithm.

关 键 词：甩挂运输 车辆调度 启发式算法 时间窗 单车场 

分 类 号：U492.331[交通运输工程—交通运输规划与管理]