首页> 外文会议>International conference on road airfield pavement technology >Multiyear Pavement Maintenance Optimization Using Genetic Algorithms
【24h】

Multiyear Pavement Maintenance Optimization Using Genetic Algorithms

机译:使用遗传算法的多年路面维护优化

获取原文

摘要

This paper describes an application of using Genetic Algorithms (GA) as an optimization tool to determine the optimal multiyear work plan for a pavement network. Nearly every highway agency must face the problem of developing a multiyear work plan for the pavement network under its jurisdiction. Pavement conditions within the network vary with time and the treatments received previously. As the size of pavement network increases and the number of treatment options grow, intuitive, heuristic, or "worst-first" approach to determine the work plan may not result in the most effective way to spend the available budget. Modern pavement management information systems (PMIS) typically contain large amount of data (e.g., section location, length, width, conditions, etc.) that can be used for such decision-making. The problem of finding the best multiyear work plan can be modeled as a combinatorial optimization problem. The objective may be to achieve the highest possible level of average network conditions for the given budgets. Other constraints that could be incorporated include geographic, institutional, and political. The solutions obtained from GA method were verified with that from dynamic programming method, a traditional optimization technique. The major benefits of using GA for solving the combinatorial optimization problems are its flexibility and scalability. GA technique is flexible in that the constraints can be easily added, removed, or modified. Once the problem has been formulated, the size of the problem can be easily changed, although larger problems would take significantly more time to solve, as the solution space increases exponentially. In contrast, dynamic programming solutions are typically problem-specific. Therefore, they are very difficult to modify and become prohibitively complex for large problems. The GA based optimization technique was implemented using VBA in a spreadsheet and applied to the pavement network of the City of Toledo, Ohio. The GA optimization module is a part of the pavement management information system developed for the city. A knowledge-based system was pavement management information system developed for the city. A knowledge-based system was used to limit the size of the solution space prior to optimization. It reduces the number of possible multiyear treatment combinations for each road section. The result is a significant reduction in time required to find the GA solution.
机译:本文介绍了使用遗传算法(GA)作为优化工具的应用,以确定路面网络的最佳多年级工作计划。几乎每个公路机构都必须面临其管辖范围下开发人行道网络的多年工作计划的问题。网络内的路面条件随着时间的变化而且之前收到的治疗。随着路面网络的规模增加,治疗选项的数量增长,直观,启发式或“最糟糕的第一”方法来确定工作计划可能不会导致最有效的方式花费可用预算。现代路面管理信息系统(PMI)通常包含可用于此类决策的大量数据(例如,部分位置,长度,宽度,条件等)。找到最佳的多输入工作计划的问题可以被建模为组合优化问题。目标可能是为给定预算达到最高可能的平均网络条件水平。可以纳入的其他制约因素包括地理,机构和政治。通过动态规划方法,传统优化技术从GA方法获得了从GA方法获得的溶液。使用GA解决组合优化问题的主要好处是其灵活性和可扩展性。 GA技术的灵活性在于可以轻松添加,删除或修改约束。一旦制定了这个问题,问题的大小可以很容易地改变,尽管较大的问题会显着提高时间来解决,但随着解决方案空间呈指数增加而增加。相比之下,动态编程解决方案通常是特定于问题的。因此,它们非常困难地修改并对大问题进行过度复杂。 GA基于GA的优化技术在电子表格中使用VBA实现,并应用于俄亥俄州托莱多市的路面网络。 GA优化模块是为城市开发的人行道管理信息系统的一部分。基于知识的系统是为城市开发的路面管理信息系统。基于知识的系统用于在优化之前限制解决方案空间的大小。它降低了每条路段的可能的多年子处理组合的数量。结果是找到GA解决方案所需的时间显着减少。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号