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

基于改进免疫遗传算法的带硬时间窗车辆调度问题的实现
引用本文:张海刚,顾幸生,王军伟. 基于改进免疫遗传算法的带硬时间窗车辆调度问题的实现[J]. 微电子学与计算机, 2007, 24(6): 218-221
作者姓名:张海刚  顾幸生  王军伟
作者单位:1. 华东理工大学,自动化研究所,上海,200237;91975,部队,上海,200129
2. 华东理工大学,自动化研究所,上海,200237
3. 91975,部队,上海,200129
摘    要:免疫算法是模仿生物体高度进化,复杂的免疫系统仿生的一种智能化启发式算法。带硬时间窗的车辆路径问题(VSPHTW)是在基本的车辆路径问题(VSP)上增加了时间窗约束条件的一种变化形式,是一个典型的NP难题。通过采用一种改进的信息熵计算方法、交叉和变异概率的自适应机制,构造一个改进的免疫算法来求解VSPHTW,并将求解结果与其他遗传算法比较。比较结果显示,该算法对于求解VSPHTW问题具有较好的性能。

关 键 词:车辆路径问题  硬时间窗  免疫算法
文章编号:1000-7180(2007)06-0218-04
修稿时间:2006-02-27

Vehicle Scheduling Problem with Hard Time Windows Based on Improved Immune Algorithms
ZHANG Hai-gang,GU Xing-sheng,WANG Jun-wei. Vehicle Scheduling Problem with Hard Time Windows Based on Improved Immune Algorithms[J]. Microelectronics & Computer, 2007, 24(6): 218-221
Authors:ZHANG Hai-gang  GU Xing-sheng  WANG Jun-wei
Affiliation:1Research Institute of Automation,East China University of Science and Technology,Shanghai 200237,China;2 91975 troops, Shanghai 200129, China
Abstract:The immune algorithms is a intelligentized heuristic algorithms which imitates high-evolvement of the organism and complicated immune system. Vehicle scheduling problem with hard time windows (VSPHTW) is a variation of vehicle scheduling problem(VSP), which is a typical NP-hard problem. Describe an improved IA algorithms to solve the VSPHTW, in which a new information entropy calculating method, the adaptive mechanism of crossover and mutation, and evaluate function are introduced. Simulation result on a VSPHTW problems show that the algorithms is efficient to solve the VSPHTW problem.
Keywords:vehicle scheduling problem (VSP)  hard time windows  immune algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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