EconPapers    
Economics at your fingertips  
 

Optimizing the freight train connection service network of a large-scale rail system

Bo-Liang Lin, Zhi-Mei Wang, Li-Jun Ji, Ya-Ming Tian and Guo-Qing Zhou

Transportation Research Part B: Methodological, 2012, vol. 46, issue 5, 649-667

Abstract: This paper presents a formulation and solution for the train connection services (TCSs) problem in a large-scale rail network in order to determine the optimal freight train services, the frequency of services, and the distribution of classification workload among yards. TCS problem is modeled as a bi-level programming problem. The upper-level is intended to find an optimal train connection service, and the lower-level is used for assigning each shipment to a sequence of train services and determining the frequency of services.

Keywords: Train connection service; Simulated annealing; Bilevel programming model; Rail network (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (19)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0191261511001913
Full text for ScienceDirect subscribers only

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:eee:transb:v:46:y:2012:i:5:p:649-667

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.trb.2011.12.003

Access Statistics for this article

Transportation Research Part B: Methodological is currently edited by Fred Mannering

More articles in Transportation Research Part B: Methodological from Elsevier
Bibliographic data for series maintained by Catherine Liu ().

 
Page updated 2025-03-19
Handle: RePEc:eee:transb:v:46:y:2012:i:5:p:649-667