• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Reliability and optimization of structural systems >Bridge management system of a large number of bridges using genetic algorithms
【24h】

Bridge management system of a large number of bridges using genetic algorithms

机译：利用遗传算法的大量桥梁桥梁管理系统

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Recently, the bridge management in Japan has become very important and urgent, because the number of existing bridges requiring repair or replacement has increased drastically. The long term planning for bridge management has been attempted to improve the safety and serviceability by reducing Life Cycle Cost (LCC) for maintenance. In the previous study, a bridge maintenance plan minimizing LCC is searched by Improved Genetic Algorithm (IGA), which can provide flexible periods for some maintenance actions. Using the numerical simulation, it is confirmed that the plan is more robust against various uncertainties without increasing LCC by introducing the flexible period. However, a lot of computation time is needed for the long term planning of a large number of bridges due to the enormous combinations. Therefore, it is desirable to improve the convergence and to reduce the computation time. In this study, an attempt is made to propose a maintenance planning method that can produce more accurate solution for a large number of bridges. At first, in the proposed method, a maintenance plan for each bridge is searched by minimizing its LCC. Next, the overall solution is derived by modifying the solutions obtained for each bridge with the aid of the possible flexible periods that can postpone some maintenance works. Performing simultaneous maintenance works within some flexible periods, it is possible to obtain a reasonable maintenance plan for a large number of bridges, based on the plans obtained for each bridge. Numerical examples are presented to demonstrate the applicability and efficiency of the proposed method.
机译：近来，由于需要维修或更换的现有桥梁的数量急剧增加，在日本的桥梁管理已变得非常重要和紧迫。已尝试通过减少维护的生命周期成本（LCC）来对桥梁管理进行长期规划，以提高安全性和可维护性。在先前的研究中，通过改进遗传算法（IGA）搜索了将LCC最小化的桥梁维护计划，该计划可以为某些维护活动提供灵活的期限。使用数值模拟，通过引入灵活的周期，可以确认该计划在不增加LCC的情况下针对各种不确定性更加鲁棒。但是，由于庞大的组合，对大量桥梁的长期规划需要大量的计算时间。因此，期望改善收敛性并减少计算时间。在这项研究中，尝试提出一种维护计划方法，该方法可以为大量桥梁提供更准确的解决方案。首先，在提出的方法中，通过最小化其LCC来搜索每个桥​​梁的维护计划。接下来，在可能延缓某些维护工作的可能的灵活期限的帮助下，通过修改为每个桥梁获得的解决方案来得出整体解决方案。在一些灵活的时间内执行同时维护工作，可以基于为每个桥梁获得的计划来为大量桥梁获得合理的维护计划。数值算例表明了该方法的适用性和有效性。

著录项

  • 来源
  • 会议地点 Yerevan(AM)
  • 作者

    K. Nakatsu; H. Furuta; K.Takahashi; K. Ishibashi; T. Umekage;

  • 作者单位

    Faculty of Informatics, Kansai University, Takatsuki, Osaka, Japan;

    Faculty of Informatics, Kansai University, Takatsuki, Osaka, Japan;

    Graduate school of Informatics, Kansai University, Takatsuki, Osaka, Japan;

    Graduate school of Informatics, Kansai University, Takatsuki, Osaka, Japan;

    Graduate school of Informatics, Kansai University, Takatsuki, Osaka, Japan;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号