Intermodal network expansion in a competitive environment with uncertain demands

This paper formulates robust optimization models for the problem of finding near-optimal locations for new intermodal terminals and their capacities for a railroad company, which operates an intermodal network in a competitive environment with uncertain demands. To solve the robust models, a Simulat...

Full description

Bibliographic Details
Main Authors: Fateme Fotuhi, Nathan Huynh
Format: Article
Language:English
Published: Growing Science 2015-04-01
Series:International Journal of Industrial Engineering Computations
Subjects:
Online Access:http://www.growingscience.com/ijiec/Vol6/IJIEC_2014_35.pdf
id doaj-887ab637996147c1a0dfcc93c1bed8a0
record_format Article
spelling doaj-887ab637996147c1a0dfcc93c1bed8a02020-11-24T21:01:17ZengGrowing ScienceInternational Journal of Industrial Engineering Computations1923-29261923-29342015-04-016228530410.5267/j.ijiec.2014.10.002Intermodal network expansion in a competitive environment with uncertain demandsFateme Fotuhi Nathan HuynhThis paper formulates robust optimization models for the problem of finding near-optimal locations for new intermodal terminals and their capacities for a railroad company, which operates an intermodal network in a competitive environment with uncertain demands. To solve the robust models, a Simulated Annealing (SA) algorithm is developed. Experimental results indicate that the SA solutions (i.e. objective function values) were comparable to those obtained using GAMS, but the SA algorithm could obtain solutions faster and could solve much larger problems. In addition, the results verify that solutions obtained from the robust models were more effective in dealing with uncertain demand scenarios.http://www.growingscience.com/ijiec/Vol6/IJIEC_2014_35.pdfIntermodal terminal locationCompetitionRobust optimizationSimulated annealing
collection DOAJ
language English
format Article
sources DOAJ
author Fateme Fotuhi
Nathan Huynh
spellingShingle Fateme Fotuhi
Nathan Huynh
Intermodal network expansion in a competitive environment with uncertain demands
International Journal of Industrial Engineering Computations
Intermodal terminal location
Competition
Robust optimization
Simulated annealing
author_facet Fateme Fotuhi
Nathan Huynh
author_sort Fateme Fotuhi
title Intermodal network expansion in a competitive environment with uncertain demands
title_short Intermodal network expansion in a competitive environment with uncertain demands
title_full Intermodal network expansion in a competitive environment with uncertain demands
title_fullStr Intermodal network expansion in a competitive environment with uncertain demands
title_full_unstemmed Intermodal network expansion in a competitive environment with uncertain demands
title_sort intermodal network expansion in a competitive environment with uncertain demands
publisher Growing Science
series International Journal of Industrial Engineering Computations
issn 1923-2926
1923-2934
publishDate 2015-04-01
description This paper formulates robust optimization models for the problem of finding near-optimal locations for new intermodal terminals and their capacities for a railroad company, which operates an intermodal network in a competitive environment with uncertain demands. To solve the robust models, a Simulated Annealing (SA) algorithm is developed. Experimental results indicate that the SA solutions (i.e. objective function values) were comparable to those obtained using GAMS, but the SA algorithm could obtain solutions faster and could solve much larger problems. In addition, the results verify that solutions obtained from the robust models were more effective in dealing with uncertain demand scenarios.
topic Intermodal terminal location
Competition
Robust optimization
Simulated annealing
url http://www.growingscience.com/ijiec/Vol6/IJIEC_2014_35.pdf
work_keys_str_mv AT fatemefotuhi intermodalnetworkexpansioninacompetitiveenvironmentwithuncertaindemands
AT nathanhuynh intermodalnetworkexpansioninacompetitiveenvironmentwithuncertaindemands
_version_ 1716778361890537472