×

Order acceptance for motorail transportation with uncertain parameters. (English) Zbl 1311.90013

Summary: Motorail transportation covers the loading of various types of cars and motorcycles onto trains. Order acceptance decisions are mainly driven by the availability of free capacity and have to respect several technical conditions. We focus on a dynamic situation where capacity demand is not known exactly but within certain bounds at the decision point. On the basis of proactive optimization, capacity bottlenecks are identified in advance. In particular, we develop a decision support system with mixed-integer programming to dynamically anticipate maximal available capacity. This key figure serves as an indicator to evaluate the underlying uncertainty and so achieve optimal train utilization. Numerical evaluations show that a variety of instances can be solved by standard commercial optimization software within reasonable time.

MSC:

90B06 Transportation, logistics and supply chain management
90C11 Mixed integer programming

Software:

XPRESS; Mosel
Full Text: DOI

References:

[1] Agbegha GY, Ballou RH, Mathur K (1998) Optimizing auto-carrier loading. Transp Sci 32(2):174-188 · Zbl 0987.90033 · doi:10.1287/trsc.32.2.174
[2] Alidaee B, Kochenberger GA, Amini MM (2001) Greedy solutions of selection and ordering problems. Eur J Oper Res 134(1):203-215 · Zbl 0990.90565 · doi:10.1016/S0377-2217(00)00252-6
[3] Ambrosino D, Bramardi A, Pucciano M, Sacone, S, Siri S (2011) Modeling and solving the train load planning problem in seaport container terminals. In: 2011 IEEE conference on automation science and engineering (CASE), pp 208-213 · Zbl 0987.90033
[4] Bruns F, Knust S (2012) Optimized load planning of trains in intermodal transportation. OR Spectr 34(3):511-533 · Zbl 1244.90031 · doi:10.1007/s00291-010-0232-1
[5] Bruns F, Goerigk M, Knust S, Schöbel A (2013) Robust load planning of trains in intermodal transportation. OR Spectr 36(3):631-668 · Zbl 1305.90049
[6] Burdett RL, Kozan E (2006) Techniques for absolute capacity determination in railways. Transp Res Part B: Methodol 40(8):616-632 · Zbl 1144.90418
[7] Feo TA, Gonzlez-Velarde JL (1995) The intermodal trailer assignment problem. Transp Sci 29(4):330-341 · Zbl 0853.90043 · doi:10.1287/trsc.29.4.330
[8] FICO \[^{{\textregistered }}\]® (2012) Xpress-mosel user guide
[9] Ghosh JB (1997) Job selection in a heavily loaded shop. Comput Oper Res 24(2):141-145 · Zbl 0893.90089 · doi:10.1016/S0305-0548(96)00045-7
[10] Goldman P, Freling R, Pak K, Piersma N (2002) Models and techniques for hotel revenue management using a rolling horizon. J Revenue Pricing Manag 1(3):207-219 · doi:10.1057/palgrave.rpm.5170025
[11] Johnson DS (1974) Fast algorithms for bin packing. J Comput Syst Sci 8(3):272-314 · Zbl 0284.68023 · doi:10.1016/S0022-0000(74)80026-7
[12] Kalyan V (2002) Dynamic customer value management: asset values under demand uncertainty using airline yield management and related techniques. Inf Syst Front 4(1):101-119 · doi:10.1023/A:1015351025609
[13] Klein R (2007) Network capacity control using self-adjusting bid-prices. OR Spectr 29(1):39-60 · Zbl 1144.90414 · doi:10.1007/s00291-006-0043-6
[14] Lewis HF, Slotnick SA (2002) Multi-period job selection: planning work loads to maximize profit. Comput Oper Res 29(8):1081-1098 · Zbl 0995.90050 · doi:10.1016/S0305-0548(00)00105-2
[15] Mestry S, Damodaran P, Chen C-S (2011) A branch and price solution approach for order acceptance and capacity planning in make-to-order operations. Eur J Oper Res 211(3):480-495 · Zbl 1237.90045 · doi:10.1016/j.ejor.2011.01.002
[16] Simpson RW (1989) Using network flow techniques to find shadow prices for market demands and seat inventory control. In: MIT flight transportation laboratory memorandum M89-1, Cambridge, Massachusetts · Zbl 0995.90050
[17] Slotnick SA, Morton TE (1996) Selecting jobs for a heavily loaded shop with lateness penalties. Comput Oper Res 23(2):131-140 · Zbl 0871.90050 · doi:10.1016/0305-0548(95)00015-E
[18] Slotnick SA, Morton TE (2007) Order acceptance with weighted tardiness. Comput Oper Res 34(10):3029-3042 · Zbl 1185.90093 · doi:10.1016/j.cor.2005.11.012
[19] Spengler T, Rehkopf S, Volling T (2007) Revenue management in make-to-order manufacturing-an application to the iron and steel industry. OR Spectr 29(1):157-171 · Zbl 1144.90418 · doi:10.1007/s00291-005-0024-1
[20] Tadei R, Perboli G, Della Croce F (2002) A heuristic algorithm for the auto-carrier transportation problem. Transp Sci 36(2):55-62 · Zbl 1065.90504
[21] Talluri KT, van Ryzin GJ (2005) The theory and practice of revenue management. Springer, New York · Zbl 1083.90024
[22] Talluri K, van Ryzin GJ (1998) An analysis of bid-price controls for network revenue management. Manag Sci 44(11):1577-1593 · Zbl 1004.90042
[23] Talluri K, van Ryzin GJ (1999) A randomized linear programming method for computing network bid prices. Transp Sci 33(2):207-216 · Zbl 1002.90506
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.