Allocating Freight Empty Cars in Railway Networks with Dynamic Demands
This paper investigates the freight empty cars allocation problem in railway networks with dynamic demands, in which the storage cost, unit transportation cost, and demand in each stage are taken into consideration. Under the constraints of capacity and demand, a stage-based optimization model for a...
Saved in:
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | Discrete Dynamics in Nature and Society |
Online Access: | http://dx.doi.org/10.1155/2014/349341 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1832549384168931328 |
---|---|
author | Ce Zhao Lixing Yang Shukai Li |
author_facet | Ce Zhao Lixing Yang Shukai Li |
author_sort | Ce Zhao |
collection | DOAJ |
description | This paper investigates the freight empty cars allocation problem in railway networks with dynamic demands, in which the storage cost, unit transportation cost, and demand in each stage are taken into consideration. Under the constraints of capacity and demand, a stage-based optimization model for allocating freight empty cars in railway networks is formulated. The objective of this model is to minimize the total cost incurred by transferring and storing empty cars in different stages. Moreover, a genetic algorithm is designed to obtain the optimal empty cars distribution strategies in railway networks. Finally, numerical experiments are given to show the effectiveness of the proposed model and algorithm. |
format | Article |
id | doaj-art-7627291314a2401ebcf72aefb80a4dfd |
institution | Kabale University |
issn | 1026-0226 1607-887X |
language | English |
publishDate | 2014-01-01 |
publisher | Wiley |
record_format | Article |
series | Discrete Dynamics in Nature and Society |
spelling | doaj-art-7627291314a2401ebcf72aefb80a4dfd2025-02-03T06:11:30ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2014-01-01201410.1155/2014/349341349341Allocating Freight Empty Cars in Railway Networks with Dynamic DemandsCe Zhao0Lixing Yang1Shukai Li2State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing 100044, ChinaState Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing 100044, ChinaState Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing 100044, ChinaThis paper investigates the freight empty cars allocation problem in railway networks with dynamic demands, in which the storage cost, unit transportation cost, and demand in each stage are taken into consideration. Under the constraints of capacity and demand, a stage-based optimization model for allocating freight empty cars in railway networks is formulated. The objective of this model is to minimize the total cost incurred by transferring and storing empty cars in different stages. Moreover, a genetic algorithm is designed to obtain the optimal empty cars distribution strategies in railway networks. Finally, numerical experiments are given to show the effectiveness of the proposed model and algorithm.http://dx.doi.org/10.1155/2014/349341 |
spellingShingle | Ce Zhao Lixing Yang Shukai Li Allocating Freight Empty Cars in Railway Networks with Dynamic Demands Discrete Dynamics in Nature and Society |
title | Allocating Freight Empty Cars in Railway Networks with Dynamic Demands |
title_full | Allocating Freight Empty Cars in Railway Networks with Dynamic Demands |
title_fullStr | Allocating Freight Empty Cars in Railway Networks with Dynamic Demands |
title_full_unstemmed | Allocating Freight Empty Cars in Railway Networks with Dynamic Demands |
title_short | Allocating Freight Empty Cars in Railway Networks with Dynamic Demands |
title_sort | allocating freight empty cars in railway networks with dynamic demands |
url | http://dx.doi.org/10.1155/2014/349341 |
work_keys_str_mv | AT cezhao allocatingfreightemptycarsinrailwaynetworkswithdynamicdemands AT lixingyang allocatingfreightemptycarsinrailwaynetworkswithdynamicdemands AT shukaili allocatingfreightemptycarsinrailwaynetworkswithdynamicdemands |