检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王喆[1]
出 处:《计算机应用》2010年第9期2301-2304,共4页journal of Computer Applications
摘 要:铁路危险货物办理站点作为铁路危险货物运输基础设施之一,其选址布局、建设规模和职能分工的合理性对于提高铁路危险货物运输效率、满足运输需求和环境风险控制目标都至关重要。为了有效解决铁路危险货物办理站点整合优化的多目标选址—分派模型组合方案规模庞大、计算困难的问题,采用了组合遗传算法对此问题进行优化。算例结果显示,该算法具有收敛速度快、运行稳定的特点,能够有效解决相关问题。As one of the basic infrastructures of railway dangerous goods transportation, the location selection, construction scale and functional division reasonability of railway dangerous goods station are important to improve the railway dangerous goods transport efficiency, satisfy transportation requirements and control environmental risk. In order to solve the large-scale portfolio alternatives and the difficult calculation of multi-objective location-allocation model for railway dangerous goods station integrated optimization, a combined Genetic Algorithm ( GA) was used to optimize this issue. The simulation results show that this method is of fast convergence rate and stable operation, and it can effectively solve the related problems.
关 键 词:铁路危险货物办理站点 整合优化 选址—分派问题 组合遗传算法
分 类 号:U294.83[交通运输工程—交通运输规划与管理] TP18[交通运输工程—道路与铁道工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:13.58.199.13