Journal of Rail Transport Planning & Management最新文献_第2页

Optimization of sea-rail intermodal container collection and distribution under novel port layout

IF 2.6

Journal of Rail Transport Planning & Management Pub Date : 2025-01-07 DOI: 10.1016/j.jrtpm.2024.100503

Shengzhong Ji, Mingjun Ji, Zhendi Gao, Lingrui Kong, Jialu Ji

{"title":"Optimization of sea-rail intermodal container collection and distribution under novel port layout","authors":"Shengzhong Ji, Mingjun Ji, Zhendi Gao, Lingrui Kong, Jialu Ji","doi":"10.1016/j.jrtpm.2024.100503","DOIUrl":"10.1016/j.jrtpm.2024.100503","url":null,"abstract":"<div><div>This paper investigates the optimization problem of sea-rail intermodal container collection and distribution operations under novel port layout where railway lines extend to the quayside. It integrates optimization train scheduling and container transshipment to enhance temporal and spatial coordination between trains and vessels. The objectives include maximizing the ratio of direct transshipment of import/export containers and minimizing the total operational time of trains at the quayside operational area. A nonlinear mixed-integer bi-objective optimization model is constructed and linearized for compatibility with commercial solvers. Different instance sizes have been analyzed and validated, demonstrating the model’s efficiency with average direct transshipment ratios exceeding 85.47%. Furthermore, the rational allocation of mechanical equipment, such as rail-mounted gantry and quay cranes, can maximize direct transfer rates and avoid resource wastage. The optimization method proposed in this paper not only reduces port operational costs but also offers valuable insights for port layout planning.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"33 ","pages":"Article 100503"},"PeriodicalIF":2.6,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143146651","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Integrating AI and edge computing for advanced safety at railroad grade crossings

IF 2.6

Journal of Rail Transport Planning & Management Pub Date : 2024-12-24 DOI: 10.1016/j.jrtpm.2024.100501

A.L. Amin , Deo Chimba , Kamrul Hasan

{"title":"Integrating AI and edge computing for advanced safety at railroad grade crossings","authors":"A.L. Amin , Deo Chimba , Kamrul Hasan","doi":"10.1016/j.jrtpm.2024.100501","DOIUrl":"10.1016/j.jrtpm.2024.100501","url":null,"abstract":"<div><div>The integration of artificial intelligence (AI) and machine learning (ML) into the Railroad High-Grade Crossing (RHGC) systems represents a significant milestone in enhancing both safety and operational efficiency. The fusion of various technologies enables the seamless integration of real-time identification, accurate forecasting, and prompt reaction to pivotal traffic situations. This research introduces a state-of-the-art architecture based on edge cloud technology. It integrates advanced computer vision algorithms for object detection and segmentation with a custom dataset for RHGC safety. In the proposed novel framework, we utilize a Weighted box- Fusion (WBF) ensemble approach, integrating diverse object detection algorithms, such as YOLOv8M (medium), YOLOv8L (Large), and YOLOv8X (extra-large), to enhance the detection of safety measures at RHGCs objects. Moreover, we incorporate a UNet segmentation model to identify trains approaching the RHGCs. The amalgamation of these methodologies leads to a fully automated, AI-driven safety mechanism for RHGC. The edge-cloud architecture is employed, with surveillance cameras linked directly to an edge server strategically positioned at grade crossings. This arrangement facilitates real-time data processing, ensuring efficient bandwidth usage and minimal latency by relaying only the necessary processed information to the cloud. Our ensemble model demonstrated an impressive precision rate of 97%, with the segmentation model achieving a higher rate of 98%. This system establishes a novel standard within the discipline, amalgamating artificial intelligence, edge computing, and cloud technology to significantly augment safety and efficiency at grade crossings.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"33 ","pages":"Article 100501"},"PeriodicalIF":2.6,"publicationDate":"2024-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143146650","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Integrated optimization of energy-efficient train timetable and rolling stock circulation plan with regenerative energy utilization

IF 2.6

Journal of Rail Transport Planning & Management Pub Date : 2024-12-24 DOI: 10.1016/j.jrtpm.2024.100499

Songwei Zhu , Yihui Wang , Guodong Wei , Yi Zheng , Datian Zhou , Nikola Bes̆inović

{"title":"Integrated optimization of energy-efficient train timetable and rolling stock circulation plan with regenerative energy utilization","authors":"Songwei Zhu , Yihui Wang , Guodong Wei , Yi Zheng , Datian Zhou , Nikola Bes̆inović","doi":"10.1016/j.jrtpm.2024.100499","DOIUrl":"10.1016/j.jrtpm.2024.100499","url":null,"abstract":"<div><div>With the running and dwell levels considered, we investigate the integrated energy-efficient train timetabling and rolling stock circulation planning problem for a metro line, where the passenger demand is considered via the service pattern. A mixed integer non-linear programming model is proposed to minimize the headway variations, headway deviations, the number of required rolling stocks, and the net energy consumption. Specifically, the regenerative energy utilization is considered by the brake-traction overlapping times. After linearization, the energy-efficient timetabling problem can be solved by existing solvers. A two-step method is presented to enhance the computational efficiency. In the first step, the arrival times of train services at the first station are determined. In the second step, the timetable and rolling stock circulation plan are optimized according to the given arrival times at the first station. Two case studies with different service patterns are conducted based on the data of Beijing Yizhuang metro line. The computational results demonstrate that the two-step method can reduce the optimality gap sharply. Compared with the energy-efficient model without the consideration of regenerative energy utilization, the regenerative energy utilization of the model with regenerative energy utilization considered increases 25.64% and 35.95% in the two test cases, respectively.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"33 ","pages":"Article 100499"},"PeriodicalIF":2.6,"publicationDate":"2024-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143146652","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Introducing the concept of grades of automation for shunting operations

IF 2.6

Journal of Rail Transport Planning & Management Pub Date : 2024-12-20 DOI: 10.1016/j.jrtpm.2024.100500

Matthias Reichmann , Gabriel Stephan Himmelbauer , Adrian Wagner , Jürgen Zajicek , Burkhard Stadlmann , Herbert Wancura , Nikolaus Furian , Siegfried Vössner

{"title":"Introducing the concept of grades of automation for shunting operations","authors":"Matthias Reichmann , Gabriel Stephan Himmelbauer , Adrian Wagner , Jürgen Zajicek , Burkhard Stadlmann , Herbert Wancura , Nikolaus Furian , Siegfried Vössner","doi":"10.1016/j.jrtpm.2024.100500","DOIUrl":"10.1016/j.jrtpm.2024.100500","url":null,"abstract":"<div><div>In Europe political decisions have been made to shift freight traffic from roads to railways, triggering substantial efforts to digitize and automate processes in the rail freight domain. As currently, only automation taxonomies for driving in rail networks exist, this paper provides a taxonomy for operations in so-called marshaling yards. Marshaling yards are critical nodes in the rail freight network, where the wagons of arriving trains are separated and are distributed to outgoing trains. Using the Design Science Research Cycles of Hevner to ensure a transparent procedure, this work develops Grades of Automation for Shunting Operations. The key outcome is a systematic classification together with a pictorial representation of these Grades of Automation, providing an overview of basic Shunting Operations and their functional realizations. This taxonomy facilitates a comparison of automation levels across different marshaling yards, aiding rail freight undertakings in planning efficient transport routes within the rail freight network.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"33 ","pages":"Article 100500"},"PeriodicalIF":2.6,"publicationDate":"2024-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143146649","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A study on sorting strategies in marshaling yards with a limited number of tracks and track capacity

IF 2.6

Journal of Rail Transport Planning & Management Pub Date : 2024-12-17 DOI: 10.1016/j.jrtpm.2024.100498

Max Zien , Thomas Kirschstein , Christian Bierwirth

{"title":"A study on sorting strategies in marshaling yards with a limited number of tracks and track capacity","authors":"Max Zien , Thomas Kirschstein , Christian Bierwirth","doi":"10.1016/j.jrtpm.2024.100498","DOIUrl":"10.1016/j.jrtpm.2024.100498","url":null,"abstract":"<div><div>In marshaling yards, freight wagons are sorted from inbound trains to outbound trains for further transport. To organize an efficient shunting process, sorting strategies are proposed in the literature. The application of sorting strategies is generally restricted by the number of classification tracks and their lengths. This can lead to difficult-to-implement or even inoperative sorting plans. To handle limited track capacity, we decompose the shunting process into a series of consecutive periods of time resembling timetables of inbound trains. A heuristic is used in every period to decide on the postponement of inbound trains when track capacity is scarce. This way, sorting strategies become applicable on a rolling time basis. A strategy is said to solve a shunting task when it enables building all outbound trains within a given time horizon. We examine the performance of five well-known sorting strategies for a large set of shunting tasks within a computational study. The simulation results indicate that the sorting strategies perform differently when numbers and lengths of classification tracks vary. In conclusion, we are able to determine the most reliable strategy among the set of considered sorting strategies for a marshaling yard of a certain size.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"33 ","pages":"Article 100498"},"PeriodicalIF":2.6,"publicationDate":"2024-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143146648","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Rail freight transportation service network design with mixed blocking policies: Formulation and solution methods

IF 2.6

Journal of Rail Transport Planning & Management Pub Date : 2024-12-13 DOI: 10.1016/j.jrtpm.2024.100495

Xiaoyu Xin , Xu Wu , Jiaxi Wang

{"title":"Rail freight transportation service network design with mixed blocking policies: Formulation and solution methods","authors":"Xiaoyu Xin , Xu Wu , Jiaxi Wang","doi":"10.1016/j.jrtpm.2024.100495","DOIUrl":"10.1016/j.jrtpm.2024.100495","url":null,"abstract":"<div><div>In the current China railway system, the freight transportation service network is demand category oriented and is designed by using a hierarchical approach. This simplifies the design procedure, but reduces the flexibility and optimality of the plan. To make full use of the limited railway capacity and to improve the service flexibility and quality, this paper addresses the freight service network design problem with simultaneous consideration of mixed blocking policies and mixed service classes for heterogeneous demands. A mixed integer linear programming model is developed for the problem to maximize the operator's total transportation profit. Furthermore, a two-stage decomposition framework is proposed to solve the optimization model, where both exact and heuristic algorithms are employed. Extensive computational experiments on artificial and real-world instances indicate that the proposed solution approaches can generate high-quality solutions within reasonable time frame. Moreover, the mixed blocking policies could attract more freight demands and tend to result in higher profits, compared to the single blocking policy.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"33 ","pages":"Article 100495"},"PeriodicalIF":2.6,"publicationDate":"2024-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143147775","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Efficient real-time rail traffic optimization: Decomposition of rerouting, reordering, and rescheduling problems

IF 2.6

Journal of Rail Transport Planning & Management Pub Date : 2024-12-11 DOI: 10.1016/j.jrtpm.2024.100496

István Ferenc Lövétei, László Lindenmaier, Szilárd Aradi

{"title":"Efficient real-time rail traffic optimization: Decomposition of rerouting, reordering, and rescheduling problems","authors":"István Ferenc Lövétei, László Lindenmaier, Szilárd Aradi","doi":"10.1016/j.jrtpm.2024.100496","DOIUrl":"10.1016/j.jrtpm.2024.100496","url":null,"abstract":"<div><div>The real-time railway traffic management problem occurs when the pre-planned timetable cannot be kept due to various disturbances; therefore, the trains must be rerouted, reordered, and rescheduled. Optimizing the real-time railway traffic management aims to resolve conflicts, minimizing the delay propagation or energy consumption. In one of our previous works, the existing mixed-integer linear programming optimization models are extended considering a safety-relevant issue of railway traffic management, the overlaps. However, solving the extended model can be time-consuming in complex control areas and traffic situations involving numerous trains. Therefore, we propose different computationally efficient multi-stage models by decomposing the problem according to the rerouting, reordering, and rescheduling sub-problems. First, a lightweight heuristic MILP model that provides a fast but sub-optimal solution is given by reformulating the train delays into pair-wise interpretation. Second, we extend the heuristic model to grant an optimal solution to the original problem faster than the existing MILP formulations. The impact of the model decomposition is investigated mathematically and experimentally in various realistic simulated traffic scenarios concerning the optimization’s objective value and computational demand. The proposed multi-stage models significantly decrease the optimization runtime of both the original and the extended railway traffic management problems.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"33 ","pages":"Article 100496"},"PeriodicalIF":2.6,"publicationDate":"2024-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143147774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A MILP model to improve the robustness of a railway timetable by retiming and rerouting in a complex bottleneck area 在复杂瓶颈区域通过重新计时和重新安排路线提高铁路时刻表稳健性的 MILP 模型

IF 2.6

Journal of Rail Transport Planning & Management Pub Date : 2024-11-16 DOI: 10.1016/j.jrtpm.2024.100488

Inneke Van Hoeck, Pieter Vansteenwegen

{"title":"A MILP model to improve the robustness of a railway timetable by retiming and rerouting in a complex bottleneck area","authors":"Inneke Van Hoeck, Pieter Vansteenwegen","doi":"10.1016/j.jrtpm.2024.100488","DOIUrl":"10.1016/j.jrtpm.2024.100488","url":null,"abstract":"<div><div>Robustness is a crucial concept in railway timetabling. It is often related to the ability of a timetable to absorb small delays. We propose a MILP model to improve the robustness of an existing microscopic timetable in a complex and heavily used part of the network. The objective is to maximise the buffer times between each pair of trains, leading to a good spreading in time of the trains. Focusing on this objective will lead to less propagation of delays and therefore shorter and more reliable travel times for the passengers. The model can adapt both the timing and the routing of the trains. However, to ensure that the proposed timetable is practically relevant for the railway companies, constraints can be added easily depending on the properties that the resulting timetable should have. Due to the flexibility of the proposed model, it can also be used to analyse and optimise alternative scenarios. The model is applied to a case study of a bottleneck area of the Belgian railway network, located just outside of Brussels, where the traffic is very heterogeneous. The results show that the spreading objective can be improved with 18% compared to the current situation.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"32 ","pages":"Article 100488"},"PeriodicalIF":2.6,"publicationDate":"2024-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142659441","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A decomposition approach to solve the individual railway crew Re-planning problem 解决铁路机组人员重新规划问题的分解方法

IF 2.6

Journal of Rail Transport Planning & Management Pub Date : 2024-11-10 DOI: 10.1016/j.jrtpm.2024.100487

Ying Wang , Xiaoyong He , Thomas Breugem , Dennis Huisman

{"title":"A decomposition approach to solve the individual railway crew Re-planning problem","authors":"Ying Wang , Xiaoyong He , Thomas Breugem , Dennis Huisman","doi":"10.1016/j.jrtpm.2024.100487","DOIUrl":"10.1016/j.jrtpm.2024.100487","url":null,"abstract":"<div><div>Crew re-planning is an important and difficult task in railway crew management. In this paper, we establish a path-based model solving the Individual Crew Re-planning Problem (ICRP). The individual indicates that we focus the problem on specific (non-anonymous) crew members, considering their roles (leader and cabin crew) and qualifications. This problem is inspired by the crew planning problem faced in Chinese high-speed railway operations. To generate feasible paths, we construct a multi-layer time-space connection network and develop a heuristic algorithm. To decrease the complexity and scale of the model, we decompose the ICRP into two sub-problems (for leaders and for cabin crew members respectively) which can be solved in sequence. In addition, we develop a Lagrangian relaxation (LR) algorithm to get valid paths quickly for both sub-problems. We combine the LR algorithm with solving the restricted decomposed models to get a good quality solution for the studied ICRP problem. We test our methods on several real-world instances from Chinese high-speed railways. The computational experiments show that our LR algorithm with a decomposition strategy can solve the decomposed models in a relatively short computation time compared to solving the original model directly, while obtaining (near-)optimal solutions for all instances.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"32 ","pages":"Article 100487"},"PeriodicalIF":2.6,"publicationDate":"2024-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142659440","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Bi-objective model and a branch-and-price-and-cut solution method for the railroad blocking problem in hazardous material transportation 危险品运输中铁路阻塞问题的双目标模型和分支-价格-切割求解方法

IF 2.6

Journal of Rail Transport Planning & Management Pub Date : 2024-10-29 DOI: 10.1016/j.jrtpm.2024.100486

Masoud Yaghini , Hosna Pooladi , Mohammad Karimi

{"title":"A Bi-objective model and a branch-and-price-and-cut solution method for the railroad blocking problem in hazardous material transportation","authors":"Masoud Yaghini , Hosna Pooladi , Mohammad Karimi","doi":"10.1016/j.jrtpm.2024.100486","DOIUrl":"10.1016/j.jrtpm.2024.100486","url":null,"abstract":"<div><div>One of the most important railway transportation problems is the railroad blocking problem (RBP). To our knowledge, no works consider the costs and risks of hazmat transportation in the RBP literature. In this paper, a bi-objective mathematical model is proposed for the RBP considering the risk of hazmat transportation and operating costs. The objective functions are (1) minimizing the cost of delivering commodities while observing limits on the number and aggregate volume of the blocks assembled at each terminal in freight railroads, and (2) minimizing the risk of hazmat transportation in terminals and en route. The ε-constraint method and a presented branch-and-price-and-cut (B&P&C) algorithm are used to solve the proposed bi-objective model. To evaluate the model and the solution method, seventeen experimental instances based on real-world conditions are generated and solved. Modeling and solving the experimental instances and the case study revealed the proposed model's capability and the solution method's efficiency. In addition, as a case study, the proposed model and algorithm are implemented in the Iranian railway network.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"32 ","pages":"Article 100486"},"PeriodicalIF":2.6,"publicationDate":"2024-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142538772","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0