Abstract
We study a cement transportation problem with asset-management (equipment selection) for strategic planning scenarios involving multiple forms of transportation and network expansion. A deterministic mixed integer programming approach is difficult due to the underlying capacitated multi-commodity network flow model and the need to consider a time-space network to ensure operational feasibility. Considering uncertain aspects is also difficult but important. In this paper we propose three approaches: solve a deterministic mixed integer program optimally; solve stochastic programs to obtain robust bounds on the solution; and, study alternative solutions to obtain their optimal cost vectors using inverse programming.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. K. AHUJA AND J. B. ORLIN, Inverse optimization, Operations Research, 49 (2001), pp. 771–783.
J. ANDERSON, T. G. CRAINIC, AND M. CHRISTIANSEN, Service network design with asset management: Formulations and comparative analyses, Transportation Research, 17 (2009), pp. 197–207.
C. BARNHART, N. KRISHNAN, D. KIM, AND K. WARE, Network design for express shipment delivery, Computational Optimization and Applications, 21 (2002), pp. 239–262.
D. BIENSTOCK AND G. MURATORE, Strong inequalities for capacitated survivable network design problems, Mathematical Programming, 89 (2000), pp. 127–147.
N. BOLAND,M. KRISHNAMOORTHY, A. ERNST, AND J. EBERY, Preprocessing and cutting for multiple allocation hub location problems, European Journal of Operational Research, 155 (2004), pp. 638–653.
J.-F. CORDEAU, M. IORI, G. LAPORTE, AND J. J. S. GONZALEZ, A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with lifo loading, tech. report, CIRRELT, 2007.
B. GENDRON, T. CRAINIC, AND A. FRANGIONI, Telecommunications Network Planning, Kluwer Academic, 1998, ch. Multicommodity capacitated network design.
A. HOFF, A.-G. LIUM, A. LØKKETANGEN, AND T. CRAINIC,A metaheuristic for stochastic service network design, Journal of Heuristics, 16 (2010), pp. 653–679.
S. IRNICH, Netzwerk-Design für zweistufige Transportsysteme und ein Branch-and-Price-Verfahren für das gemischte Direkt- und Hubflugproblem, PhD thesis, Lehrstuhl für Unternehmensforschung, Rheinisch-Westfälische Technische Hochschule, 2002.
A.-G. LIUM, T. G. CRAINIC, AND S. W. WALLACE, A study of demand stochasticity in service network design, TRANSPORTATION SCIENCE, 43 (2009), pp. 144–157.
Y. ZHANG, Advances in LTL load plan design, PhD thesis, Georgia Institute of Technology, 2010.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Burt, C., Puchinger, J. (2012). Models and Algorithms for Intermodal Transportation and Equipment Selection. In: Klatte, D., Lüthi, HJ., Schmedders, K. (eds) Operations Research Proceedings 2011. Operations Research Proceedings. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29210-1_49
Download citation
DOI: https://doi.org/10.1007/978-3-642-29210-1_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29209-5
Online ISBN: 978-3-642-29210-1
eBook Packages: Business and EconomicsBusiness and Management (R0)