考虑订单发货区域的物流配送调度问题研究  

Research of logistics scheduling problem based on order regions

作　　者：王桢[1] 黄磊[1] 

机构地区：[1]北京交通大学经济管理学院,北京100082

出　　处：《计算机应用研究》2016年第1期82-86,共5页Application Research of Computers

基　　金：中央高校基本科研业务费专项资金项目(FRF-SD-12-012B;FRF-SD-12-011B)

摘　　要：研究了一种考虑订单发货区域的物流配送问题,针对问题建立了两阶段多目标整数规划模型:订单车辆指派模型和车辆配送调度模型;基于对模型及问题特点的分析,构造了一种两阶段优化算法。第一阶段,基于聚类—约束满足优化算法为待发货订单指派最佳车辆;第二阶段,基于单亲遗传算法为车辆指定最佳的物流配送方案。数据仿真验证表明,通过模型和算法能够得到切实可行配送调度方案,该模型及算法是可行且有效的。This paper studied a logistics scheduling problem based on order regions, and established a two-stage multi-objec- tive integer programming model. The model contained two parts as the orders assigned model of the vehicle and the vehicle rou- ting scheduling model. For the characteristics of the model and the problem, it proposed a two-stage optimization algorithm. First, it designed a clustering-constraint satisfaction algorithm to assign the best vehicles to orders. Second, it used a PGA al- gorithm to formulate the best logistics solution for the vehicles. Through the verification of the experiment, it can get the practi- cal distribution scheduling scheme, the model and algorithm are feasible and effective.

关 键 词：物流配送 约束满足 聚类算法 单亲遗传算法 发货区域 调度 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] TP181[自动化与计算机技术—计算机科学与技术]