365-day sectional work zone schedule optimization for road networks considering economies of scale and user cost

IF 8.5 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computer-Aided Civil and Infrastructure Engineering Pub Date : 2024-06-06 DOI:10.1111/mice.13273
Yuto Nakazato, Daijiro Mizutani
{"title":"365-day sectional work zone schedule optimization for road networks considering economies of scale and user cost","authors":"Yuto Nakazato,&nbsp;Daijiro Mizutani","doi":"10.1111/mice.13273","DOIUrl":null,"url":null,"abstract":"<p>This study proposes a methodology for deriving the optimal work zone schedule for the annual routine maintenance planning in an infrastructure asset management system considering the (i) economies of scale in work zone costs due to work zone synchronization and (ii) user costs across the road network with traffic assignments. A key aspect of the proposed methodology is the ability to derive in detail optimal work zone schedules of realistic-scale road networks in 100 m sections for 365 days, which is beneficial in practice. To this end, an optimization model of the work zone schedule is newly formulated as a mixed-integer programming (MIP) problem, and a novel bilevel solution method for the model utilizing the conventional solver Gurobi Optimizer with MIP algorithms such as root relaxation, dual simplex, barrier methods, and cutting planes is proposed. In application examples, the proposed methodology is applied to two real-world road networks, which confirms that the optimal work zone schedule can be obtained in 313.7 s for a network with 2640, 100 m, sections and in 168,180 s (46 h and 43 min) for a network with 5038, 100 m, sections.</p>","PeriodicalId":156,"journal":{"name":"Computer-Aided Civil and Infrastructure Engineering","volume":"39 15","pages":"2270-2298"},"PeriodicalIF":8.5000,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/mice.13273","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer-Aided Civil and Infrastructure Engineering","FirstCategoryId":"5","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1111/mice.13273","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

This study proposes a methodology for deriving the optimal work zone schedule for the annual routine maintenance planning in an infrastructure asset management system considering the (i) economies of scale in work zone costs due to work zone synchronization and (ii) user costs across the road network with traffic assignments. A key aspect of the proposed methodology is the ability to derive in detail optimal work zone schedules of realistic-scale road networks in 100 m sections for 365 days, which is beneficial in practice. To this end, an optimization model of the work zone schedule is newly formulated as a mixed-integer programming (MIP) problem, and a novel bilevel solution method for the model utilizing the conventional solver Gurobi Optimizer with MIP algorithms such as root relaxation, dual simplex, barrier methods, and cutting planes is proposed. In application examples, the proposed methodology is applied to two real-world road networks, which confirms that the optimal work zone schedule can be obtained in 313.7 s for a network with 2640, 100 m, sections and in 168,180 s (46 h and 43 min) for a network with 5038, 100 m, sections.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
考虑到规模经济和用户成本,优化公路网络的 365 天分段工作区时间表
本研究提出了一种方法,用于推导基础设施资产管理系统中年度例行维护规划的最佳工作区计划,其中考虑到(i)工作区同步带来的工作区成本规模经济,以及(ii)整个道路网络的交通分配用户成本。建议方法的一个关键方面是能够详细推导出现实规模道路网络中 100 米路段 365 天的最佳工作区计划,这在实践中是非常有益的。为此,将工作区计划的优化模型新表述为混合整数编程(MIP)问题,并提出了一种新的双层求解方法,利用传统求解器 Gurobi Optimizer 和 MIP 算法(如根松弛、二元单纯形、障碍法和切割平面)对该模型进行求解。在应用实例中,将所提出的方法应用于两个现实世界的道路网络,结果表明,对于拥有 2640 个 100 米路段的网络,可在 313.7 秒内获得最佳工作区计划;对于拥有 5038 个 100 米路段的网络,可在 168180 秒(46 小时 43 分钟)内获得最佳工作区计划。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
17.60
自引率
19.80%
发文量
146
审稿时长
1 months
期刊介绍: Computer-Aided Civil and Infrastructure Engineering stands as a scholarly, peer-reviewed archival journal, serving as a vital link between advancements in computer technology and civil and infrastructure engineering. The journal serves as a distinctive platform for the publication of original articles, spotlighting novel computational techniques and inventive applications of computers. Specifically, it concentrates on recent progress in computer and information technologies, fostering the development and application of emerging computing paradigms. Encompassing a broad scope, the journal addresses bridge, construction, environmental, highway, geotechnical, structural, transportation, and water resources engineering. It extends its reach to the management of infrastructure systems, covering domains such as highways, bridges, pavements, airports, and utilities. The journal delves into areas like artificial intelligence, cognitive modeling, concurrent engineering, database management, distributed computing, evolutionary computing, fuzzy logic, genetic algorithms, geometric modeling, internet-based technologies, knowledge discovery and engineering, machine learning, mobile computing, multimedia technologies, networking, neural network computing, optimization and search, parallel processing, robotics, smart structures, software engineering, virtual reality, and visualization techniques.
期刊最新文献
Automated seismic event detection considering faulty data interference using deep learning and Bayesian fusion Smartphone-based high durable strain sensor with sub-pixel-level accuracy and adjustable camera position Reinforcement learning-based approach for urban road project scheduling considering alternative closure types Issue Information Cover Image, Volume 39, Issue 23
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1