检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西南交通大学交通运输与物流学院,四川成都610031 [2]重庆工商大学重庆市发展信息管理工程技术研究中心,重庆400067 [3]成都信息工程学院银杏酒店管理学院
出 处:《中国安全科学学报》2013年第4期113-119,共7页China Safety Science Journal
基 金:国家科技支撑计划重大项目子课题(2006BAH02A20);重庆市科技攻关重大项目(CSTC2012ggC0035);重庆市科技攻关重点项目(CSTC,2010AB2102;CSTC,2008AB2084)
摘 要:为预防和减少危险品运输事故,提高运输效率,需合理安排危险品运输线路,建立一个综合考虑安全性和经济性的多目标车辆调度优化模型。以车辆的总运输成本、使用的运输车辆总数、车辆经过的人口密集区数和车辆经过的限行区域数为目标,建立一个满足上述要求的优化模型。通过多目标处理将多目标问题转化为单目标问题。针对模型,设计一种改进的遗传算法(GA)求解问题。最后通过算例分析,验证模型和算法。算例结果表明:目标能够有效收敛,且程序运行时间较短,算法的效率与稳定性得到验证。It was held by the authors that a multi-objective optimization model for hazardous materials transportation should be built in order that transportation accidents can be prevented or mitigated and trans- portation efficiency can be improved. Taking model took minimum transportation cost, minimum total num- ber of used vehicles, minimum total number of densely populated areas that vehicles have passed and mini- mum total number of restricted areas that vehicles have passed as objective functions an optimal model was built meeting the above-mentioned requirements. A multi-objective processing method was used to translate the problem into a single objective problem. An improved genetic algorithm was worked out to solve the model. Finally, a numerical example was given to verify the model and algorithm. The results indicate that the problem can be solved in a short time, and the convergence can be effectively realized, and that the efficiency and stability of the algorithm was verified.
关 键 词:危险品 车辆调度 危险品运输 多目标 遗传算法(GA)
分 类 号:X951[环境科学与工程—安全科学] U492.81[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.16.26