首页> 外文会议>2010 13th International IEEE Conference on Intelligent Transportation Systems >Multi-year network level road maintenance programming by genetic algorithms and variable neighbourhood search
【24h】

Multi-year network level road maintenance programming by genetic algorithms and variable neighbourhood search

机译:遗传算法和可变邻域搜索的多年网络级道路养护编程

获取原文

摘要

Preservation of the value, accessibility and adequate service level of road assets is one of the main tasks of road administrations. Right timing of maintenance works both decrease the road user costs as well as maintenance costs maximising overall benefits to the society measured by Net Present Value (NPV). We present a problem of road maintenance programming as a large-scale optimisation problem, which we optimise with genetic algorithms (GA), a parallel version of GA, and a variable neighbourhood search as a post-processing step on the previous solutions. We also compared all the optimised solutions with a large number of random solutions. A case study in the Sindh Province of Pakistan shows that parallel genetic algorithms with variable neighbourhood search produce 50 percent better results compared to random sampling and 6 percent better compared to regular genetic algorithms. The case study shows that current priorities in recent years are service level upgrading and routine maintenance.
机译:保持道路资产的价值,可及性和适当的服务水平是道路行政管理的主要任务之一。正确的维护工作时机既可以减少道路使用者的成本,又可以减少维护成本,以净现值(NPV)衡量的社会效益最大化。我们将道路养护编程问题作为大规模的优化问题提出,并通过遗传算法(GA),GA的并行版本和可变邻域搜索对其进行优化,以此作为对先前解决方案的后处理步骤。我们还将所有优化的解决方案与大量随机解决方案进行了比较。巴基斯坦信德省的一个案例研究表明,与随机抽样相比,具有可变邻域搜索的并行遗传算法产生的结果要好50%,而常规遗传算法则要好6%。案例研究表明,近年来当前的重点是服务级别升级和例行维护。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号