An Operational Model for Empty Container Management
Tóm tắt
This paper proposes a mathematical programming approach for empty container management. Since directional imbalances in trade activities result in a surplus or shortage of empty containers in ports and depots, their management can be thought of as a min cost flow problem whose arcs represent services routes, inventory links and decisions concerning the time and place to lease containers from external sources. We adopt an hourly time-step in a dynamic network and, although this time-period generates large-size instances, the two implemented algorithms show a good computational efficiency. A possible case study of the Mediterranean basin is proposed and results are presented with a graphical representation, providing a useful support to decision-makers in the field.
Tài liệu tham khảo
Centro Italiano Studi Containers (C.I.S.Co). 1999: I container vuoti: problemi e soluzioni. http://www.informare.it/news/cisco/1999/0599guk.asp.
Cheung, RK and Chen, CY . 1998: A two-stage stochastic network model and solutions methods for the dynamic empty container allocation problem. Transportation Science 32: 142–162.
Choong, ST, Cole, MH and Kutanoglu, E . 2002: Empty container management for intermodal transportation networks. Transportation Research Part E 38: 423–438.
CPLEX Optimization Incorporate. 1995: Using The CPLEX Callable Library and CPLEX Mixed Integer Library, Incline Village, Nevada.
Crainic, TG . 2003: Long-Haul Freight Transportation. In: Hall, RW (ed). Handbook of Transportation Science. Kluwer Academic Publishers: Norwell, MA. pp. 451–516.
Crainic, TG, Dejax, P and Delorme, L . 1989: Models for multimode multicommodity location problems with interdepot balancing requirements. Annals of Operations Research 18: 279–302.
Crainic, TG and Delorme, L . 1993a: Dual-ascent procedures for multicommodity location/allocation problems with balancing requirements. Transportation Science 27: 90–101.
Crainic, TG, Delorme, L and Dejax, P . 1993b: A branch-and-bound method for multicommodity location with balancing requirements. European Journal of Operational Research 65: 368–382.
Crainic, TG, Gendreau, M and Dejax, P . 1993c: Dynamic and stochastic models for the allocation of empty containers. Operations Research 41: 102–126.
Crainic, TG, Gendreau, M, Soriano, P and Toulouse, M . 1993d: A Tabu Search procedure for multicommodity location-allocation with balancing requirements. Annals of Operations Research 41: 359–383.
Crainic, TG and Laporte, G . 1997: Planning models for freight transportation. European Journal of Operational Research 97: 409–438.
Dejax, PJ and Crainic, TG . 1987: A review of empty flows and fleet management models in freight transportation. Transportation Science 21: 227–247.
Holmberg, K, Joborn, M and Lundgren, JT . 1998: Improved empty freight car distribution. Transportation Science 32: 163–173.
Jiele, Z . 1999: Empty Container Distribution Problem. UROP Report 6019, School of Computing, National University of Singapore.
Macharis, C and Bontekoning, YM . 2004: Opportunities for OR in intermodal freight transport research: a review. European Journal of Operation Research 153: 400–416.
Mitsui O.S.K. Lines. 2001: Container Trade Supply/Demand Forecast for Three Major East-West Trades. http://www.mol.co.jp/research-e/report/annualreport2001.pdf.
Schwab, H . 1996: Documentation for lp_solve. In lp_solve-packet, Hartmut Documentation.
Shen, WS and Khoong, CM . 1995: A DSS for empty container distribution planning. Decision Support Systems 15: 75–82.
Veldman, SJ and Bückmann, EH . 2003: A model on container port competition: an application for the West European container Hub-Ports. Maritime Economics & Logistics 5: 3–22.