考虑零件三维装载约束带时间窗的循环取货路径问题研究  

Vehicle Routing Problem with Time Windows under Three-Dimensional Loading Constraint Based on Milk-Run

作　　者：章勋宏 贾国柱[1] 孔继利[2] 

机构地区：[1]北京航空航天大学经济管理学院,北京100191 [2]北京邮电大学,北京100876

出　　处：《管理工程学报》2014年第4期207-218,共12页Journal of Industrial Engineering and Engineering Management

基　　金：国家自然科学基金资助项目(71372007);教育部博士点基金资助项目(20111102110025)

摘　　要：为提高车辆的可装载性,对考虑三维装载约束带时间窗的循环取货路径问题进行研究。在给定假设与约束条件的前提下,建立该问题的多目标数学模型,并设计用于问题求解的基于改进策略的启发式算法。数值实例的计算结果表明,该算法可有效求解考虑零件三维装载约束带时间窗的循环取货路径问题;且与时间窗优先法的求解结果相比,可大幅提高车辆的可装载性,并能有效减少不同车型车辆的投入数量。The extensively applied milk run system is a type of logistic system that can be used to take delivery of commodities on time.The logistics networks of this system could be abstracted as the classic vehicle routing model.The vehicle routing problem is an important branch and hotspot research field of logistics and supply chain management all the time.To effectively solve this problem plays an important role in the aspects of reducing logistics cost and improving customer satisfaction.One of the most common constraints of the vehicle routing problem is delivery or pickup time.The vehicle routing problem with time windows is therefore an important category of the vehicle muting problems.The existing research achievements for the vehicle routing problem with time windows generally only consider some simplex constraint conditions,such as nominal on-load capacity,maximum mileage,or total onload volume of one certain pickup vehicle.The optimization milk-run routes obtained by the existing research methods often lead to the usual results that the pickup vehicle cannot be loaded successfully in practice.Therefore,it is very urgent and necessary for the study of the vehicle routing problem with time windows under three-dimensional loading constrain to solve the former problem.First of all,we review the existing relevant literatures associated with this research topic and indicate the deficiency of the existing research results to lead to the research topic concerned by us in our paper.Secondly,in view of the characteristic the vehicle routing problem with hard time windows under three-dimensional loading constrain and with the premise of giving hypotheses and constraints,we put forward a multi-objective model,taking the rate of time windows satisfied,the total waiting time,the on-load rate,the total mileage,and the total number of pickup vehicles respectively into consideration,for the milk-run problem.Thirdly,given the challenge for users to solve the model,we design a heuristic algorithm based on improved strategy to so

关 键 词：三维装载约束 时间窗 循环取货路径 启发式算法 可装载性 

分 类 号：U492.312[交通运输工程—交通运输规划与管理] F274[交通运输工程—道路与铁道工程]