首页 | 本学科首页   官方微博 | 高级检索  
     

考虑订单发货区域的物流配送调度问题研究
引用本文:王桢.考虑订单发货区域的物流配送调度问题研究[J].计算机应用研究,2016,33(1).
作者姓名:王桢
作者单位:北京交通大学 经济管理学院
基金项目:高等学校博士学科点专项科研基金
摘    要:研究了一种考虑订单发货区域的物流配送问题,针对问题建立了两阶段多目标整数规划模型:订单车辆指派模型和车辆配送调度模型。基于对模型及问题特点的分析,构造了一种两阶段优化算法:第一阶段,基于聚类-约束满足优化算法为待发货订单指派最佳车辆;第二阶段,基于单亲遗传算法为车辆指定最佳的物流配送方案。通过数据仿真验证,模型和算法是可行且有效的。

关 键 词:物流配送    约束满足    单亲遗传算法    区域
收稿时间:2014/8/27 0:00:00
修稿时间:2014/10/30 0:00:00

Logistics scheduling problem based on the order regions. Computer Engineering and Applications
wangzhen.Logistics scheduling problem based on the order regions. Computer Engineering and Applications[J].Application Research of Computers,2016,33(1).
Authors:wangzhen
Affiliation:School of Economics and Management, Beijing Jiaotong University
Abstract:A logistics scheduling problem based on order regions is studied in this paper and a two-stage multi-objective integer programming model is established. The model contains two parts as the orders assigned model of the vehicle and the vehicle routing scheduling model. For the characteristics of the model and the problem, a two-stage optimization algorithm is proposed. First, we design a clustering-constraint satisfaction algorithm to assign the best vehicles to orders. Second, a PGA algorithm is used to formulate the best logistics solution for the vehicles. Through the verification of the experiment, the model and algorithm are feasible and effective.
Keywords:logistics  constraint satisfaction  PGA  region
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号