Publication Cover
Maritime Policy & Management
The flagship journal of international shipping and port research
Volume 44, 2017 - Issue 8
532
Views
21
CrossRef citations to date
0
Altmetric
Original Articles

An equilibrium-based network model for international container flows

ORCID Icon & ORCID Icon

References

  • Agarwal, R., and Ö. Ergun. 2008. “Ship Scheduling and Network Design for Cargo Routing in Liner Shipping.” Transportation Science 42 (2): 175–196. doi:10.1287/trsc.1070.0205.
  • Agarwal, R., and Ö. Ergun. 2010. “Network Design and Allocation Mechanisms for Carrier Alliances in Liner Shipping.” Operations Research 58 (6): 1726–1742. doi:10.1287/opre.1100.0848.
  • Álvarez, J. F. 2012. “Mathematical Expressions for the Transit Time of Merchandise through a Liner Shipping Network.” Journal of the Operational Research Society 63 (6): 709–714. doi:10.1057/jors.2011.72.
  • Appelgren, L. H. 1969. “A Column Generation Algorithm for A Ship Scheduling Problem.” Transportation Science 3 (1): 53–68. doi:10.1287/trsc.3.1.53.
  • Appelgren, L. H. 1971. “Integer Programming Methods for a Vessel Scheduling Problem.” Transportation Science 5 (1): 64–78. doi:10.1287/trsc.5.1.64.
  • Beckmann, M., C. B. McGuire, and C. B. Winsten. 1956. Studies in the Economics of Transportation. Yale University Press, New Haven, Connecticut.
  • Bell, M. G. H., X. Liu, J. Rioult, and P. Angeloudis. 2013. “A cost-based maritime container assignment model.” Transportation Research Part B: Methodological 58:58-70.
  • Brouer, B. D., J. Dirksen, D. Pisinger, C. E. M. Plum, and B. Vaaben. 2013. “The Vessel Schedule Recovery Problem (VSRP)–A MIP Model for Handling Disruptions in Liner Shipping.” European Journal of Operational Research 224 (2): 362–374. doi:10.1016/j.ejor.2012.08.016.
  • Brouer, B. D., D. Pisinger, and S. Spoorendonk. 2011. “Liner Shipping Cargo Allocation with Repositioning of Empty Containers.” INFOR 49 (2): 109.
  • Brown, G. G., G. W. Graves, and D. Ronen. 1987. “Scheduling Ocean Transportation of Crude-Oil.” Management Science 33 (3): 335–346. doi:10.1287/mnsc.33.3.335.
  • Christiansen, M., K. Fagerholt, B. Nygreen, and D. Ronen. 2013. “Ship Routing and Scheduling in the New Millennium.” European Journal of Operational Research 228 (3): 467–483. doi:10.1016/j.ejor.2012.12.002.
  • Christiansen, M., K. Fagerholt, and D. Ronen. 2004. “Ship Routing and Scheduling: Status and Perspectives.” Transportation Science 38 (1): 1–18. doi:10.1287/trsc.1030.0036.
  • Dong, J.-X., C.-Y. Lee, and D.-P. Song. 2015. “Joint Service Capacity Planning and Dynamic Container Routing in Shipping Network with Uncertain Demands.” Transportation Research Part B: Methodological 78: 404–421. doi:10.1016/j.trb.2015.05.005.
  • Drewry. 2016. Accessed 11 August 2016. http://www.drewry.co.uk/
  • Ducruet, C. 2016. “The Polarization of Global Container Flows by Interoceanic Canals: Geographic Coverage and Network Vulnerability.” Maritime Policy & Management 43 (2): 242–260. doi:10.1080/03088839.2015.1022612.
  • Dynamar. 2016. Accessed 7 November 2016. https://www.dynamar.com/.
  • Fagerholt, K., G. Laporte, and I. Norstad. 2010. “Reducing Fuel Emissions by Optimizing Speed on Shipping Routes.” Journal of the Operational Research Society 61 (3): 523–529. doi:10.1057/jors.2009.77.
  • Fagerholt, K. 1999. “Optimal Fleet Design in a Ship Routing Problem.” International Transactions in Operational Research 6 (5): 453–464. doi:10.1111/itor.1999.6.issue-5.
  • Fagerholt, K. 2004. “Designing Optimal Routes in a Liner Shipping Problem.” Maritime Policy & Management 31 (4): 259–268. doi:10.1080/0308883042000259819.
  • Flood, M. M. 1954. “Application of Transportation Theory to Scheduling a Military Tanker Fleet.” Journal of the Operations Research Society of America 2 (2): 150–162. doi:10.1287/opre.2.2.150.
  • Frank, M., and P. Wolfe. 1956. “An Algorithm for Quadratic Programming.” Naval Research Logistics Quarterly 3 (1–2): 95–110. doi:10.1002/(ISSN)1931-9193.
  • Gelareh, S., and Q. Meng. 2010. “A Novel Modeling Approach for the Fleet Deployment Problem within A Short-Term Planning Horizon.” Transportation Research Part E-Logistics and Transportation Review 46 (1): 76–89. doi:10.1016/j.tre.2009.06.004.
  • Golias, M., M. Boile, S. Theofanis, and C. Efstathiou. 2010. “The Berth-Scheduling Problem: Maximizing Berth Productivity and Minimizing Fuel Consumption and Emissions Production.” Transportation Research Record: Journal of the Transportation Research Board 2166: 20–27. doi:10.3141/2166-03.
  • Hoff, A., H. Andersson, M. Christiansen, G. Hasle, and A. Løkketangen. 2010. “Industrial Aspects and Literature Survey: Fleet Composition and Routing.” Computers & Operations Research 37 (12): 2041–2061. doi:10.1016/j.cor.2010.03.015.
  • International Maritime Organization. 2016. Accessed 11 August 2016. http://www.imo.org/EN/Pages/Default.aspx.
  • International Trade Centre. 2016. Accessed 7 November 2016. http://www.trademap.org/Bilateral_TS.aspx.
  • Kiefer, J. 1953. “Sequential Minimax Search for a Maximum.” Proceedings of the American Mathematical Society 4 (3): 502–506. doi:10.1090/S0002-9939-1953-0055639-3.
  • Kim, H. J., Y. T. Chang, K. T. Kim, and H. J. Kim. 2012. “An Epsilon-Optimal Algorithm considering Greenhouse Gas Emissions for the Management of a Ship’s Bunker Fuel.” Transportation Research Part D-Transport and Environment 17 (2): 97–103. doi:10.1016/j.trd.2011.10.001.
  • Koenigsberg, E., and D. A. Meyers. 1980. “An Interacting Cyclic Queue Model of Fleet Operations.” Logistics and Transportation Review 16 (1): 59–71.
  • Laderman, J., L. Gleiberm, and J. F. Egan. 1966. “Vessel Allocation by Linear Programming.” Naval Research Logistics Quarterly 13 (3): 315–320. doi:10.1002/(ISSN)1931-9193.
  • Lang, N., and A. Veenstra. 2010. “A Quantitative Analysis of Container Vessel Arrival Planning Strategies.” OR Spectrum 32 (3): 477–499. doi:10.1007/s00291-009-0186-3.
  • Larson, R. C. 1988. “Transporting Sludge to the 106-Mile Site: An Inventory/Routing Model for Fleet Sizing and Logistics System Design.” Transportation Science 22 (3): 186–198. doi:10.1287/trsc.22.3.186.
  • Lim, S.-M. 1994. “Economies of Container Ship Size: A New Evaluation.” Maritime Policy and Management 21 (2): 149–160. doi:10.1080/03088839400000031.
  • Lin, D. Y. 2011. “A Dual Variable Approximation-Based Descent Method for A Bi-Level Continuous Dynamic Network Design Problem.” Computer-Aided Civil and Infrastructure Engineering 26 (8): 581–594. doi:10.1111/j.1467-8667.2010.00705.x.
  • Liu, X., Y. Heng-Qing, and X.-M. Yuan. 2011. “Tactical Planning Models for Managing Container Flow and Ship Deployment.” Maritime Policy & Management 38 (5): 487–508. doi:10.1080/03088839.2011.597447.
  • Lloyd’s List Intelligence. 2016. Accessed 7 November 2016. http://www.lloydslistintelligence.com/llint/index.htm.
  • Mckay, M. D., and H. O. Hartley. 1974. “Computerized Scheduling of Seagoing Tankers.” Naval Research Logistics 21 (2): 255–264. doi:10.1002/(ISSN)1931-9193.
  • Meng, Q., S. A. A. Wang, H. Andersson, and K. Thun. 2014. “Containership Routing and Scheduling in Liner Shipping: Overview and Future Research Directions.” Transportation Science 48 (2): 265–280. doi:10.1287/trsc.2013.0461.
  • Meng, Q., and S. Wang. 2011a. “Liner Shipping Service Network Design with Empty Container Repositioning.” Transportation Research Part E: Logistics and Transportation Review 47 (5): 695–708. doi:10.1016/j.tre.2011.02.004.
  • Meng, Q., and S. Wang. 2011b. “Optimal Operating Strategy for a Long-Haul Liner Service Route.” European Journal of Operational Research 215 (1): 105–114. doi:10.1016/j.ejor.2011.05.057.
  • Meng, Q., and S. Wang. 2012. “Liner Ship Fleet Deployment with Week-Dependent Container Shipment Demand.” European Journal of Operational Research 222 (2): 241–252. doi:10.1016/j.ejor.2012.05.006.
  • Meng, Q., and T. Wang. 2010. “A Chance Constrained Programming Model for Short-Term Liner Ship Fleet Planning Problems.” Maritime Policy & Management 37 (4): 329–346. doi:10.1080/03088839.2010.486635.
  • Meng, Q., and T. Wang. 2011. “A Scenario-Based Dynamic Programming Model for Multi-Period Liner Ship Fleet Planning.” Transportation Research Part E: Logistics and Transportation Review 47 (4): 401–413. doi:10.1016/j.tre.2010.12.005.
  • Miller, D. M. 1987. “An Interactive, Computer-Aided Ship Scheduling System.” European Journal of Operational Research 32 (3): 363–379. doi:10.1016/S0377-2217(87)80005-X.
  • MOTC (R.O.C). 2015. International Liner Shipping Database by Institute of Transportation.
  • Olson, C. A., E. E. Sorenson, and W. J. Sullivan. 1969. “Medium-Range Scheduling for a Freighter Fleet.” Operations Research 17 (4): 565–582. doi:10.1287/opre.17.4.565.
  • Psaraftis, H. N., and C. A. Kontovas. 2013. “Speed Models for Energy-Efficient Maritime Transportation: A Taxonomy and Survey.” Transportation Research Part C: Emerging Technologies 26: 331–351. doi:10.1016/j.trc.2012.09.012.
  • Rana, K., and R. G. Vickson. 1988. “A Model and Solution Algorithm for Optimal Routing of A Time-Chartered Containership.” Transportation Science 22 (2): 83–95. doi:10.1287/trsc.22.2.83.
  • Rao, M. R., and S. Zionts. 1968. “Allocation of Transportation Units to Alternative Trips - a Column Generation Scheme with out-Of-Kilter Subproblems.” Operations Research 16 (1): 52–63. doi:10.1287/opre.16.1.52.
  • Ronen, D. 1982. “The Effect of Oil Price on the Optimal Speed of Ships.” Journal of the Operational Research Society 33 (11): 1035–1040. doi:10.1057/jors.1982.215.
  • Ronen, D. 1983. “Cargo Ships Routing and Scheduling: Survey of Models and Problems.” European Journal of Operational Research 12 (2): 119–126. doi:10.1016/0377-2217(83)90215-1.
  • Ronen, D. 1993. “Ship Scheduling: The Last Decade.” European Journal of Operational Research 71 (3): 325–333. doi:10.1016/0377-2217(93)90343-L.
  • SEA-DISTANCES.ORG. 2016. Accessed 9 November 2016. http://www.sea-distances.org/.
  • Sheffi, Y. 1985. Urban Transportation Networks : Equilibrium Analysis with Mathematical Programming Methods. Englewood Cliffs, NJ: Prentice-Hall.
  • Shyshou, A., I. Gribkovskaia, and J. Barceló. 2010. “A Simulation Study of the Fleet Sizing Problem Arising in Offshore Anchor Handling Operations.” European Journal of Operational Research 203 (1): 230–240. doi:10.1016/j.ejor.2009.07.012.
  • Tavasszy, L., M. Minderhoud, J.-F. Perrin, and T. Notteboom. 2011. “A Strategic Network Choice Model for Global Container Flows: Specification, Estimation and Application.” Journal of Transport Geography 19 (6): 1163–1172. doi:10.1016/j.jtrangeo.2011.05.005.
  • Trudeau, P., and M. Dror. 1992. “Stochastic Inventory Routing - Route Design with Stockouts and Route Failures.” Transportation Science 26 (3): 171–184. doi:10.1287/trsc.26.3.171.
  • UN Comtrade Database. 2016. Accessed 25 October 2016. http://comtrade.un.org/.
  • UNCTAD. 2015. Accessed 28 October 2016. Review of Maritime Transport 2015. http://unctad.org/en/PublicationsLibrary/rmt2015_en.pdf.
  • UNCTADstat. 2016. Accessed 25 October 2016. http://unctadstat.unctad.org/wds/ReportFolders/reportFolders.aspx.
  • Veldman, S., L. Garcia-Alonso, and M. Liu. 2016. “Testing Port Choice Models Using Physical and Monetary Data: A Comparative Case Study for the Spanish Container Trades.” Maritime Policy & Management 43 (4): 495–508. doi:10.1080/03088839.2015.1099754.
  • Veldman, S. J., and E. H. Bückmann. 2003. “A Model on Container Port Competition: An Application for the West European Container Hub-Ports.” Maritime Economics & Logistics 5 (1): 3–22. doi:10.1057/palgrave.mel.9100058.
  • Wang, S. 2013. “Essential Elements in Tactical Planning Models for Container Liner Shipping.” Transportation Research Part B: Methodological 54: 84–99. doi:10.1016/j.trb.2013.04.001.
  • Wang, S., Z. Liu, and M. G. H. Bell. 2015. “Profit-Based Maritime Container Assignment Models for Liner Shipping Networks.” Transportation Research Part B: Methodological 72: 59–76. doi:10.1016/j.trb.2014.11.006.
  • Wang, S., Z. Liu, and Q. Xiaobo. 2017. “Weekly Container Delivery Patterns in Liner Shipping Planning Models.” Maritime Policy & Management 44 (4): 442-457..
  • Wang, S., and Q. Meng. 2011. “Schedule Design and Container Routing in Liner Shipping.” Transportation Research Record: Journal of the Transportation Research Board 2222: 25–33. doi:10.3141/2222-04.
  • Wang, S., and Q. Meng. 2012. “Liner Ship Route Schedule Design with Sea Contingency Time and Port Time Uncertainty.” Transportation Research Part B: Methodological 46 (5): 615–633. doi:10.1016/j.trb.2012.01.003.
  • Wang, S., Q. Meng, and M. G. H. Bell. 2013. “Liner Ship Route Capacity Utilization Estimation with a Bounded Polyhedral Container Shipment Demand Pattern.” Transportation Research Part B: Methodological 47: 57–76. doi:10.1016/j.trb.2012.07.011.
  • Wang, S., Q. Meng, and C.-Y. Lee. 2016. “Liner Container Assignment Model with Transit-Time-Sensitive Container Shipment Demand and Its Applications.” Transportation Research Part B: Methodological 90: 135–155. doi:10.1016/j.trb.2016.04.014.
  • Wang, Y., and K. Cullinane. 2014. “Traffic Consolidation in East Asian Container Ports: A Network Flow Analysis.” Transportation Research Part A: Policy and Practice 61: 152–163.
  • Wardrop, J. G. 1952. “Road Paper. Some Theoretical Aspects Of Road Traffic Research.” Proceedings of the Institution of Civil Engineers 1 (3): 325–362. doi:10.1680/ipeds.1952.11259.
  • Yan, S., C.-Y. Chen, and S.-C. Lin. 2009. “Ship Scheduling and Container Shipment Planning for Liners in Short-Term Operations.” Journal of Marine Science and Technology 14 (4): 417–435. doi:10.1007/s00773-009-0059-0.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.