循环取货带有时间窗约束的入库道口车辆调度  

Vehicle Scheduling with Time Windows and Inbound Crossing Restrictions in the Milk Run

作　　者：蔺宇[1] 徐天依 

机构地区：[1]天津大学管理与经济学部,天津300072

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

摘　　要：研究了循环取货模式下带有时间窗约束的入库道口车辆调度问题,为使车辆运输成本和取货时间成本、卸货时间成本最小,建立混合整数规划数学模型,设计了两阶段算法求解模型,第一阶段产生满足容量约束的较好初始解,第二阶段通过发车时间与路径同时编码的模拟退火算法进行求解,根据某汽车制造商循环取货的实际运作情况,构造算例并验证了该模型和算法的有效性。结论表明,制造商处的道口限制对循环取货发车时间与路径调度有较大影响,同时对发车时间和路径进行调度更有利于降低循环取货的运输费用。With the objective of minimize transportation costs and pickup time costs,unloading time costs,a mathematical model of mixed integer programming is set up for the problem of the vehicle scheduling with time windows and inbound crossing restrictions in the milk run.And a two-phase algorithm model is designed to solve the model.In the first phase a good initial solution is produced to meet capacity constraints.In the next phase,based on departure time and path coding,a simulated annealing algorithm is designed to deal with the model.Combined with the actual operation of an automobile manufacturer,an example is given to prove that the model and the algorithm are effective.The conclusions indicate that the crossing restrictions of manufacturer can influence scheduling departure time and path.Scheduling departure time and path at the same time is helpful to reduce the milk-run transportation costs.

关 键 词：循环取货 时间窗 车辆调度 道口 二阶段算法 

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