EconPapers    
Economics at your fingertips  
 

Development of Algorithms for Effective Resource Allocation among Highway–Rail Grade Crossings: A Case Study for the State of Florida

Masoud Kavoosi, Maxim A. Dulebenets, Junayed Pasha, Olumide F. Abioye, Ren Moses, John Sobanjo and Eren E. Ozguven
Additional contact information
Masoud Kavoosi: Department of Civil & Environmental Engineering, Florida A&M University-Florida State University, Tallahassee, FL 32310-6046, USA
Maxim A. Dulebenets: Department of Civil & Environmental Engineering, Florida A&M University-Florida State University, Tallahassee, FL 32310-6046, USA
Junayed Pasha: Department of Civil & Environmental Engineering, Florida A&M University-Florida State University, Tallahassee, FL 32310-6046, USA
Olumide F. Abioye: Department of Civil & Environmental Engineering, Florida A&M University-Florida State University, Tallahassee, FL 32310-6046, USA
Ren Moses: Department of Civil & Environmental Engineering, Florida A&M University-Florida State University, Tallahassee, FL 32310-6046, USA
John Sobanjo: Department of Civil & Environmental Engineering, Florida A&M University-Florida State University, Tallahassee, FL 32310-6046, USA
Eren E. Ozguven: Department of Civil & Environmental Engineering, Florida A&M University-Florida State University, Tallahassee, FL 32310-6046, USA

Energies, 2020, vol. 13, issue 6, 1-28

Abstract: Smart cities directly rely on a variety of elements, including water, gas, electricity, buildings, services, transportation networks, and others. Lack of properly designed transportation networks may cause different economic and safety concerns. Highway–rail grade crossings are known to be a hazardous point in the transportation network, considering a remarkable number of accidents recorded annually between highway users and trains, and even solely between highway users at highway–rail grade crossings. Hence, safety improvement at highway–rail grade crossings is a challenging issue for smart city authorities, given limitations in monetary resources. In this study, two optimization models are developed for resource allocation among highway–rail grade crossings to minimize the overall hazard and the overall hazard severity, taking into account the available budget limitations. The optimization models are solved by CPLEX to the global optimality. Moreover, some heuristic algorithms are proposed as well. A case study focusing on the public highway–rail grade crossings in the State of Florida is performed to evaluate the effectiveness of the developed optimization models and the solution methodologies. In terms of the computational time, all the solution approaches are found to be effective decision support tools from the practical standpoint. Moreover, the results demonstrate that some of the developed heuristic algorithms can provide near-optimal solutions. Therefore, the smart city authorities can utilize the proposed heuristics as decision support tools for effective resource allocation among highway–rail grade crossings.

Keywords: smart cities; highway–rail grade crossings; resource allocation; optimization; heuristics; crossing hazard (search for similar items in EconPapers)
JEL-codes: Q Q0 Q4 Q40 Q41 Q42 Q43 Q47 Q48 Q49 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
https://www.mdpi.com/1996-1073/13/6/1419/pdf (application/pdf)
https://www.mdpi.com/1996-1073/13/6/1419/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jeners:v:13:y:2020:i:6:p:1419-:d:334041

Access Statistics for this article

Energies is currently edited by Ms. Agatha Cao

More articles in Energies from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().

 
Page updated 2025-03-19
Handle: RePEc:gam:jeners:v:13:y:2020:i:6:p:1419-:d:334041