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

车辆路径问题的改进遗传算法研究
引用本文:张玉琍,樊建华,徐建刚,陈东升.车辆路径问题的改进遗传算法研究[J].天津理工大学学报,2006,22(5):79-82.
作者姓名:张玉琍  樊建华  徐建刚  陈东升
作者单位:1. 天津理工大学,计算机科学与技术学院,天津,300191
2. 天津财经大学,理工学院,天津,300222
摘    要:在现有的物流管理系统中,车辆路径问题(vehi-cle routing problem,VRP)研究在物流配送过程中的作用显得尤为重要.VRD最早是在1959年由Dan-ting和Ramser1]提出,其研究的问题可以描述为:有n个商品需求点(可以称之为顾客),各个顾客之间的距离以及商品需求量事先已知,要求从中心仓

关 键 词:车辆路径  遗传算法  物流配送  优化
文章编号:1673-095X(2006)05-0079-04
收稿时间:2006-06-27
修稿时间:2006年6月27日

Improved genetic algorithm research for vehicle routing problem
ZHANG Yu-li,FAN Jian-hua,XU Jian-gang,CHEN Dong-sheng.Improved genetic algorithm research for vehicle routing problem[J].Journal of Tianjin University of Technology,2006,22(5):79-82.
Authors:ZHANG Yu-li  FAN Jian-hua  XU Jian-gang  CHEN Dong-sheng
Institution:1. School of Computer Science and Technology, Tianjin University of Technology, Tianjin 300191, China; 2. School of Technology, Tianjin University of Finance and Economics, Tianjin 300222, China
Abstract:Analyzes the research approaches of vehicle routing problems and characteristics of genetic algorithm, and proposes an improved genetic algorithm for the vehicle routing problem. A kind of new coding manner is constructed which can improveto run efficiency of algorithm on the basis of reducing coding length. The algorithm can implement the diversity of solution, avoid converging local optimal solution, and prevent the possibility of losing optimal solution effectively, by holding some optimal chromosomes in each generation and introducing expectation reproduction rate. Experiment results indicate the algorithm can converge the optimal solution rapidly and is an effective algorithm.
Keywords:vehicle routing  genetic algorithm  logistics distribution  optimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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