An Optimization Method for the Train Service Network Design Problem

Effective railway freight transportation relies on a well-designed train service network. This paper investigates the train service network design problem at the tactical level for the Chinese railway system. It aims to determine the types of train services to be offered, how many trains of each ser...

Full description

Saved in:
Bibliographic Details
Main Authors: Jie Xiao, Yi Xie, Haowei Yu, Hongying Yan
Format: Article
Language:English
Published: Wiley 2020-01-01
Series:Discrete Dynamics in Nature and Society
Online Access:http://dx.doi.org/10.1155/2020/9519267
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832547060129202176
author Jie Xiao
Yi Xie
Haowei Yu
Hongying Yan
author_facet Jie Xiao
Yi Xie
Haowei Yu
Hongying Yan
author_sort Jie Xiao
collection DOAJ
description Effective railway freight transportation relies on a well-designed train service network. This paper investigates the train service network design problem at the tactical level for the Chinese railway system. It aims to determine the types of train services to be offered, how many trains of each service are to be dispatched per day (service frequency), and by which train services shipments are to be transported. An integer programming model is proposed to address this problem. The optimization model considers both through train services between nonadjacent yards, and two classes of service between two adjacent yards ( i.e., shuttle train services directly from one yard to its adjacent yard, and local train services that make at least one intermediate stop). The objective of the model is to optimize the transportation of all the shipments with minimal costs. The costs consist of accumulation costs, classification coststrain operation costs, and train travel costs. The NP-hard nature of the problem prevents an exact solution algorithm from finding the optimal solution within a reasonable time, even for small-scale cases. Therefore, an improved genetic algorithm is designed and employed here. To demonstrate the proposed model and the algorithm, a case study on a real-world sub-network in China is carried out. The computational results show that the proposed approach can obtain high-quality solutions with satisfactory speed. Moreover, comparative analysis on a case that assumes all the shuttle train services between any two adjacent yards to be provided without optimization reveals some interesting insights.
format Article
id doaj-art-0e249b6d9dc7457587978614297d8aee
institution Kabale University
issn 1026-0226
1607-887X
language English
publishDate 2020-01-01
publisher Wiley
record_format Article
series Discrete Dynamics in Nature and Society
spelling doaj-art-0e249b6d9dc7457587978614297d8aee2025-02-03T06:46:06ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2020-01-01202010.1155/2020/95192679519267An Optimization Method for the Train Service Network Design ProblemJie Xiao0Yi Xie1Haowei Yu2Hongying Yan3China Railway Eryuan Engineering Group Co. Ltd, Chengdu 610031, ChinaChina Railway Eryuan Engineering Group Co. Ltd, Chengdu 610031, ChinaChina Railway Eryuan Engineering Group Co. Ltd, Chengdu 610031, ChinaChina Railway Eryuan Engineering Group Co. Ltd, Chengdu 610031, ChinaEffective railway freight transportation relies on a well-designed train service network. This paper investigates the train service network design problem at the tactical level for the Chinese railway system. It aims to determine the types of train services to be offered, how many trains of each service are to be dispatched per day (service frequency), and by which train services shipments are to be transported. An integer programming model is proposed to address this problem. The optimization model considers both through train services between nonadjacent yards, and two classes of service between two adjacent yards ( i.e., shuttle train services directly from one yard to its adjacent yard, and local train services that make at least one intermediate stop). The objective of the model is to optimize the transportation of all the shipments with minimal costs. The costs consist of accumulation costs, classification coststrain operation costs, and train travel costs. The NP-hard nature of the problem prevents an exact solution algorithm from finding the optimal solution within a reasonable time, even for small-scale cases. Therefore, an improved genetic algorithm is designed and employed here. To demonstrate the proposed model and the algorithm, a case study on a real-world sub-network in China is carried out. The computational results show that the proposed approach can obtain high-quality solutions with satisfactory speed. Moreover, comparative analysis on a case that assumes all the shuttle train services between any two adjacent yards to be provided without optimization reveals some interesting insights.http://dx.doi.org/10.1155/2020/9519267
spellingShingle Jie Xiao
Yi Xie
Haowei Yu
Hongying Yan
An Optimization Method for the Train Service Network Design Problem
Discrete Dynamics in Nature and Society
title An Optimization Method for the Train Service Network Design Problem
title_full An Optimization Method for the Train Service Network Design Problem
title_fullStr An Optimization Method for the Train Service Network Design Problem
title_full_unstemmed An Optimization Method for the Train Service Network Design Problem
title_short An Optimization Method for the Train Service Network Design Problem
title_sort optimization method for the train service network design problem
url http://dx.doi.org/10.1155/2020/9519267
work_keys_str_mv AT jiexiao anoptimizationmethodforthetrainservicenetworkdesignproblem
AT yixie anoptimizationmethodforthetrainservicenetworkdesignproblem
AT haoweiyu anoptimizationmethodforthetrainservicenetworkdesignproblem
AT hongyingyan anoptimizationmethodforthetrainservicenetworkdesignproblem
AT jiexiao optimizationmethodforthetrainservicenetworkdesignproblem
AT yixie optimizationmethodforthetrainservicenetworkdesignproblem
AT haoweiyu optimizationmethodforthetrainservicenetworkdesignproblem
AT hongyingyan optimizationmethodforthetrainservicenetworkdesignproblem