| 基于改进遗传算法的带硬时间窗车辆路径问题研究 |
| |
| 引用本文： | 孟辉,蔡田刚,姜忠鹤.基于改进遗传算法的带硬时间窗车辆路径问题研究[J].机械工程师,2011(2):62-64. |
| |
| 作者姓名： | 孟辉 蔡田刚 姜忠鹤 |
| |
| 作者单位： | 安徽工业大学管理科学与工程学院,安徽马鞍山,243002 |
| |
| 摘 要： | 建立了带硬时间窗车辆路径问题数学模型。针对传统遗传算法在局部搜索能力上存在不足这一问题，根据相关文献将爬山算法的思想融入遗传算法中，构造了求解该问题的改进遗传算法。仿真结果表明，该算法在局部搜索过程中能够避免早熟，一定程度上克服了传统遗传算法在局部搜索能力上的不足。
|
| 关 键 词： | 改进遗传算法 爬山算法 车辆路径问题 硬时间窗 |
Research on Vehicle Routing Problem with Hard Windows Time Based on Improved Genetic Algorithm |
| |
| MENG Hui,CAI Tian-gang,JIANG Zhong-he.Research on Vehicle Routing Problem with Hard Windows Time Based on Improved Genetic Algorithm[J].Mechanical Engineer,2011(2):62-64. |
| |
| Authors: | MENG Hui CAI Tian-gang JIANG Zhong-he |
| |
| Affiliation: | (School of Management Science and Engineering, Anhui University of Technology, Maanshan 243002, China) |
| |
| Abstract: | The vehicle routing problem is established with hard time windows mathematical model in this paper. Aimed at traditional genetic algorithm in solving the vehicle routing problem with hard windows time the weakness of in local search process, an improved genetic algorithm was constructed to resolve this problem according to relevant literature based on idea of the climbing algorithm integrating with the genetic algorithm in this paper. The simulation results show that this algorithm can avoid premature in the local search process and overcome the weakness of genetic algorithm. |
| |
| Keywords: | improved genetic algorithm cLimbing algorithm vehicle routing problem hard windows times |
| 本文献已被 维普 万方数据 等数据库收录！ |
