|
|||||
|
|
| 带服务优先级的煤矿物资配送车辆路径问题 | |
| 引用本文： | 郭海湘,杨娟,於世为,廖貅武.带服务优先级的煤矿物资配送车辆路径问题[J].系统管理学报,2012,21(1):133-144. |
| 作者姓名： | 郭海湘 杨娟 於世为 廖貅武 |
| 作者单位： | 1. 中国地质大学经济管理学院,武汉 430074;西安交通大学管理学院,西安 710049 2. 中国地质大学经济管理学院,武汉,430074 3. 中国地质大学经济管理学院,武汉 430074;北京理工大学能源与环境政策研究中心,北京 100081 4. 西安交通大学管理学院,西安,710049 |
| 基金项目： | 国家自然科学基金青年科学基金资助项目(71103163,71103164);中国博士后基金资助项目(20090461293),中国博士后科学基金特别资助项目(201003670);教育部人文社会科学研究青年基金资助项目(10YJC790071);中央高校基本科研业务费专项资金资助项目(CUG090113,CUG110411) |
| 摘 要： | 以运输费用最小为目标,在考虑客户服务优先级和车辆装载率等约束条件下,构建了单车场单车型联合运输车辆路径问题模型和单车场多车型单点配送多趟服务车辆路径问题模型,并用改进的扫描算法和改进的遗传算法进行求解,最后,将郑州煤电物资供销有限公司的物资配送作为案例进行研究,从运输费用、运输里程和服务优先级三方面评价改进的扫描算法和改进的遗传算法的求解结果,得到在车辆装载率相同的情况下,两者各有所侧重:改进的遗传算法所求得的最优解在运输费用和配送里程上都优于改进的扫描算法,而改进的扫描算法则最大程度地保证了客户的服务优先级。 |
| 关 键 词： | 车辆路径问题 煤矿物资配送 服务优先级 扫描算法 遗传算法 |
On the Vehicle Routing Problem for the Coal Mine Materials' Distribution with Service Priorities |
|
| GUO Hai-xiang , YANG Juan , YU Shi-wei , LIAO Xiu-wu.On the Vehicle Routing Problem for the Coal Mine Materials' Distribution with Service Priorities[J].Systems Engineering Theory·Methodology·Applications,2012,21(1):133-144. | |
| Authors: | GUO Hai-xiang YANG Juan YU Shi-wei LIAO Xiu-wu |
| Institution: | 1.School of Economics and Management,China University of Geosciences,Wuhan 430074,China;2.School of Management,Xi’an Jiaotong University,Xi’an 710049,China;3.Center for Energy & Environmental Policy Research,Beijing Institute of Technology,Beijing 100081,China) |
| Abstract: | To minimize the delivering cost,we build a single-depot combined delivering vehicle routing problem model and a single-depot point-to-point delivering vehicle routing problem model,considering the constraints on the customers’ service priorities and the full load rate of vehicles.We then present an improved sweeping algorithm and improved genetic algorithm to solve the mathematical models.We also study vehicle routing problem for Zhengzhou Coal Electricity Material Supply and Marketing Limited Company,evaluate the solutions in terms of delivery cost,delivery distance and full load rate of vehicles.The results show that,in the situation with the same full load rate of the vehicles,the best solution of the improved genetic algorithm is better than that of the improved sweeping algorithm in terms of delivery cost and delivery distance However,the improved sweeping algorithm provides guarantee for the service priority. |
| Keywords: | vehicle routing problem coal mine materials’ distribution service priority sweeping algorithm genetic algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |