Optimizing Railroad Bridge Networks Management Using Mixed Integer Linear Programming and Genetic Algorithm

被引:0
|
作者
Jafari, Amirhosein [1 ]
Perez, Guillermo [1 ]
Moreu, Fernando [1 ]
Valentin, Vanessa [1 ]
机构
[1] Univ New Mexico, Dept Civil Engn, 210 Univ Blvd NE, Albuquerque, NM 87106 USA
关键词
OPTIMIZATION; MAINTENANCE; UNCERTAINTY; TIME;
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Railroad management entities in the U.S. are developing new tools to improve the management of railroad bridge networks, in order to comply with new federal regulations on bridge safety and to increase their profitability. Decisions about maintenance, repair, and replacement (MRR) actions are currently prioritized by rating the bridges based on structural inspections and predictions about the estimated costs of operations. This study proposes a framework for the management of railroad bridge networks that: (1) utilizes a consequence-based management approach that considers relationships between displacements, serviceability levels and bridge MRR decisions; and (2) minimizes the expected value of total network costs by determining the best MRR decisions based on an annual MRR budget. Through this study, two different optimization methods are explored in two different scenarios: (I) mixed integer linear programming (MILP) when the impact of bridge location on costs is insignificant resulting in linear objective function and constraints; and (II) genetic algorithm (GA) when the impact of bridge location on costs is significant resulting in nonlinear objective function and constraints. A case study of a network comprised of 100 railroad bridges is used to demonstrate the proposed framework. The results show that scenario I leads the optimum MRR decision to replace more bridges. On the other hand, scenario II leads the optimum MRR decision to more repair or maintain groups of bridges which are closer to each other.
引用
收藏
页码:1 / 9
页数:9
相关论文
共 50 条
  • [21] Nonlinear mixed integer programming problems using genetic algorithm and penalty function
    Li, YX
    Gen, M
    INFORMATION INTELLIGENCE AND SYSTEMS, VOLS 1-4, 1996, : 2677 - 2682
  • [22] Optimizing Supply Chain Inventory: A Mixed Integer Linear Programming Approach
    Vicente, Joaquim Jorge
    SYSTEMS, 2025, 13 (01):
  • [23] Solution for integer linear bilevel programming problems using orthogonal genetic algorithm
    Li, Hong
    Zhang, Li
    Jiao, Yongchang
    JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2014, 25 (03) : 443 - 451
  • [24] Optimizing wetland restoration and management for avian communities using a mixed integer programming approach
    Stralberg, Diana
    Applegate, David L.
    Phillips, Steven J.
    Herzog, Mark P.
    Nur, Nadav
    Warnock, Nils
    BIOLOGICAL CONSERVATION, 2009, 142 (01) : 94 - 109
  • [25] Solution for integer linear bilevel programming problems using orthogonal genetic algorithm
    Hong Li
    Li Zhang
    Yongchang Jiao
    JournalofSystemsEngineeringandElectronics, 2014, 25 (03) : 443 - 451
  • [26] A mixed integer programming model for optimizing multi-level operations process in railroad yards
    Shi, Tie
    Zhou, Xuesong
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2015, 80 : 19 - 39
  • [27] An algorithm for the solution of multiparametric mixed integer linear programming problems
    Dua, V
    Pistikopoulos, EN
    ANNALS OF OPERATIONS RESEARCH, 2000, 99 (1-4) : 123 - 139
  • [28] An Algorithm for the Solution of Multiparametric Mixed Integer Linear Programming Problems
    Vivek Dua
    Efstratios N. Pistikopoulos
    Annals of Operations Research, 2000, 99 : 123 - 139
  • [29] Dynamic Fleet Configuration Model for Optimizing Earthmoving Operations Using Mixed Integer Linear Programming
    Khallaf, Zaid
    Alshibani, Adel
    Alsawafy, Omar
    Mohammed, Awsan
    Bubshait, Abdulaziz
    JOURNAL OF CONSTRUCTION ENGINEERING AND MANAGEMENT, 2024, 150 (11)
  • [30] An algorithm for multiparametric mixed-integer linear programming problems
    Acevedo, J
    Pistikopoulos, EN
    OPERATIONS RESEARCH LETTERS, 1999, 24 (03) : 139 - 148