...
首页> 外文期刊>Structure and Infrastructure Engineering >A constraint-based, efficiency optimisation approach to network-level pavement maintenance management
【24h】

A constraint-based, efficiency optimisation approach to network-level pavement maintenance management

机译:基于约束的,效率优化方法来网络级路面维护管理

获取原文
获取原文并翻译 | 示例
           

摘要

Network-level pavement maintenance programming is characterised by its high computational complexity. In this article, a novel modelling to solve this problem efficiently is proposed. In this modelling, careful care has been taken to reduce the search space and formulate the original problem as one of the well-known problems of the literature on mathematical optimisation. Efficient algorithms can therefore be used to find a solution. According to this approach, the maintenance programming problem is divided into two sub-problems: (i) the first performs a reduction of the search space by filtering road section maintenance alternatives based on technical criteria; (ii) the second computes a road network-level maintenance program by optimising efficiency subject to budget constraints. The section-level filtering of alternatives is modelled as a constraint satisfaction problem and solved using appropriate constraint satisfaction algorithms. The network-level maintenance programming is modelled as a generalised assignment problem, whose resolution is well documented in the literature on optimisation. This approach has shown to be very effective, with strong computational performances for different road network sizes.
机译:网络级路面维护编程的特点是其高计算复杂性。在本文中,提出了一种新颖的建模,以有效地解决这个问题。在这种造型中,已经仔细关心减少搜索空间,并将原始问题作为数学优化的文献众所周知的问题之一。因此,可以使用高效的算法来找到解决方案。根据这种方法,维护编程问题分为两个子问题:(i)首先通过基于技术标准过滤路段维护替代方案来执行搜索空间的减少; (ii)第二种通过优化预算约束的效率来计算道路网络级维护计划。替代方案的级级别过滤被建模为约束满足问题,并使用适当的约束满意度算法解决。网络级维护编程被建​​模为广义分配问题,其分辨率在优化的文献中被充分记录。这种方法显示出非常有效,具有不同道路网络尺寸的强大计算性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号