Cart (Loading....) | Create Account
Close category search window
 

The empty railcar allocation problem under uncertainty for the railway freight carrier

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chengxuan Cao ; State Key Lab. of Rail Traffic Control & Safety, Beijing Jiaotong Univ., Beijing ; Ziyou Gao ; Keping Li

In this paper, we present a mathematical formulation and solution method for the empty railcar allocation problem under uncertainty. The proposed formulation results in a two-stage stochastic programming model which can also be rewritten as a large-scale integer programming model with the linear objective function and linear constraints. A solution method is presented to solve the problem and an example is given to illustrate the formulation and the solution procedure.

Published in:

Service Operations and Logistics, and Informatics, 2008. IEEE/SOLI 2008. IEEE International Conference on  (Volume:2 )

Date of Conference:

12-15 Oct. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.