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

A Hybrid Genetic Algorithm for Vehicle Routing Problem with Complex Constraints
作者姓名:CHEN  Yan  LU  Jun  LI  Zeng-zhi
作者单位:School of Electronics and Information Engineering, Xi'an Jiaotong University, Xi'an 710049, P. R. China
基金项目:国家高技术研究发展计划(863计划) , 西安交通大学校科研和教改项目
摘    要:Most research on the Vehicle Routing Problem (VRP) is focused on standard conditions, which is not suitable for specific cases. A Hybrid Genetic Algorithm is proposed to solve a Vehicle Routing Problem (VRP) with complex side constraints. A novel coding method is designed especially for side constraints. A greedy algorithm combined with a random algorithm is introduced to enable the diversity of the initial population, as well as a local optimization algorithm employed to improve the searching efficiency. In order to evaluate the performance, this mechanism has been implemented in an oil distribution center, the experimental and executing results show that the near global optimal solution can be easily and quickly obtained by this method, and the solution is definitely satisfactory in the VRP application.

关 键 词:遗传算法  汽车路由选择  贪婪算法  复合约束
收稿时间:2005-04-26

A Hybrid Genetic Algorithm for Vehicle Routing Problem with Complex Constraints
CHEN Yan LU Jun LI Zeng-zhi.A Hybrid Genetic Algorithm for Vehicle Routing Problem with Complex Constraints[J].International Journal of Plant Engineering and Management,2006,11(2):88-96.
Authors:CHEN Yan  LU Jun  LI Zeng-zhi
Abstract:Most research on the Vehicle Routing Problem (VRP) is focused on standard conditions, which is not suitable for specific cases. A Hybrid Genetic Algorithm is proposed to solve a Vehicle Routing Problem (VRP) with complex side constraints. A novel coding method is designed especially for side constraints. A greedy algorithm combined with a random algorithm is introduced to enable the diversity of the initial population, as well as a local optimization algorithm employed to improve the searching efficiency. In order to evaluate the performance, this mechanism has been implemented in an oil distribution center, the experimental and executing results show that the near global optimal solution can be easily and quickly obtained by this method, and the solution is definitely satisfactory in the VRP application.
Keywords:genetic algorithm  vehicle routing problem  greedy algorithm  complex constraints
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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