Hostname: page-component-77c78cf97d-9lb97 Total loading time: 0 Render date: 2026-04-25T04:24:41.256Z Has data issue: false hasContentIssue false
  • English
  • Français

Container Shipping Network Optimisation Based on Steering Vector Search Pattern

Published online by Cambridge University Press:  28 September 2016

Yong Zhou ,
Wenyuan Wang ,
Xiangqun Song  and
Yun Peng
Yong Zhou
Affiliation:
(Faculty of Infrastructure Engineering, Dalian University of Technology, China)
Wenyuan Wang*
Affiliation:
(Faculty of Infrastructure Engineering, Dalian University of Technology, China) (State Key Laboratory of Coastal and Offshore Engineering, Dalian University of Technology, China)
Xiangqun Song
Affiliation:
(Faculty of Infrastructure Engineering, Dalian University of Technology, China) (State Key Laboratory of Coastal and Offshore Engineering, Dalian University of Technology, China)
Yun Peng
Affiliation:
(Faculty of Infrastructure Engineering, Dalian University of Technology, China)
*
(E-mail: wangwenyuan@dlut.edu.cn)
Get access Rights & Permissions [Opens in a new window]

Abstract

Container shipping is one of the most important transport modes in international trade. For a large-scale container shipping network, an optimisation model is proposed to minimise the total shipping cost of container flow. Considering the directional property of the container shipping process, a steering vector search pattern is incorporated in a Max-Min Ant System (MMAS) solving algorithm, and an orthogonal array method is adopted in parameter settings. In numerical experiments, a traditional ant colony algorithm and an MMAS algorithm based on a steering vector search pattern are used respectively to optimise the network of five node scales. The results show that a steering vector search pattern can speed up the computation process and improve the optimisation effect.

Keywords

Container shippingNetwork optimisationSteering vectorMax-Min Ant System algorithm

Information

Type
Research Article
Information
The Journal of Navigation , Volume 70 , Issue 2 , March 2017 , pp. 395 - 410
Copyright
Copyright © The Royal Institute of Navigation 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

REFERENCES

Christiansen, M., Fagerholt, K. and Ronen, D. (2004). Ship routing and scheduling: status and perspectives. Transportation Science, 38(1), 1–18.CrossRefGoogle Scholar
Christiansen, M., Fagerholt, K., Nygreen, B. and Ronen, D. (2007). Maritime transportation. Handbook in OR & MS, 14, 189–284.Google Scholar
Christiansen, M., Fagerholt, K., Nygreen, B. and Ronen, D. (2013). Ship routing and scheduling in the new millennium. European Journal of Operational Research, 228(3), 467–483.Google Scholar
Crainic, T.G. (2000). Service Network Design in Freight Transportation. European Journal of Operational Research, 122(2), 272–288.Google Scholar
Dorigo, M. (1992). Optimization, learning and natural algorithms. Ph.D. Thesis, Politecnico di Milano, Italy.Google Scholar
Duan, H. (2005). Ant Colony Algorithms: Theory and Applications. Beijing: Science Press.Google Scholar
Gelareh, S., Nickel, S. and Pisinger, D. (2010). Liner shipping hub network design in a competitive environment. Transportation Research part E, 46(6), 991–1004.Google Scholar
Gelareh, S. and Pisinger, D. (2011). Fleet deployment, network design and hub location of liner shipping companies. Transportation Research Part E, 47(6), 947–964.Google Scholar
Imai, A., Shintani, K. and Papadimitriou, S. (2009). Multi-port vs. Hub-and-Spoke port calls by containerships. Transportation Research Part E, 45(5), 740–757.Google Scholar
Meng, Q. and Wang, S. (2011a). Liner Shipping Service Network Design with Empty Container Repositioning. Transportation Research Part E, 47(5), 695–708.Google Scholar
Meng, Q. and Wang, S. (2011b). Intermodal Container Flow Simulation Model and Its Applications. Transportation Research Record: Journal of the Transportation Research Board, 2224, 35–41.Google Scholar
Meng, Q. and Wang, T. (2011c). A scenario-based dynamic programming model for multi-period liner ship fleet planning. Transportation Research Part E, 47(4), 401–413.CrossRefGoogle Scholar
Meng, Q. and Wang, X. (2011d). Intermodal Hub-and-spoke Network Design: Incorporating Multiple Stakeholders and Multi-type Containers. Transportation Research Part B, 45(4), 724–742.Google Scholar
Meng, Q., Wang, S., Andersson, H. and Thun, K. (2014). Containership routing and scheduling in liner shipping: overview and future research directions. Transportation Science, 48(2), 265–280.Google Scholar
Meng, Q., Wang, S. and Liu, Z. (2012). Network Design for Shipping Service of Large-scale Intermodal Liners. Transportation Research Record: Journal of the Transportation Research Board, 2269, 42–50.Google Scholar
Moon, I.K., Qiu, Z.B. and Wang, J.H. (2015). A combined tramp ship routing, fleet deployment, and network design problem. Maritime Policy and Management, 42(1), 68–91.Google Scholar
Rana, K. and Vickson, R.G. (1988). A Model and Solution Algorithm for Optimal Routing of a Time-chartered Containership. Transportation Science, 22(2), 83–95.Google Scholar
Rana, K. and Vickson, R.G. (1991). Routing Container Ships Using Lagrangean Relaxation and Decomposition. Transportation Science, 25(3), 201–214.Google Scholar
Ronen, D. (1983). Cargo ships routing and scheduling: survey of models and problems. European Journal of Operational Research, 12(2), 119–126.Google Scholar
Ronen, D. (1993). Ship scheduling: the last decade. European Journal of Operational Research, 71(3), 325–333.Google Scholar
Shintani, K., Imai, A., Nishimura, E. and Papadimitriou, S. (2007). The Container Shipping Network Design Problem with Empty Container Repositioning. Transportation Research Part E, 43(1), 39–59.Google Scholar
Song, X., Zhang, P. and Guo, Z. (2007). Ant Colonies Optimization for Containers Transportation Network System of Seaports. Journal of Dalian University of Technology, 47(6), 853–857.Google Scholar
Stützle, T. and Hoos, H.H. (2000). MAX-MIN Ant System. Future Generation Computer System, 16(9), 889–914.Google Scholar
Sun, F., Song, H., Zhang, M., Liu, L. and Wang, C. (2004). A New Orthogonal Optimizing Parameters Method and the Application in Nonlinear Regression Analysis. Chinese Journal of Biomedical Engineering, 23(3), 217–221.Google Scholar
Ting, S.C. and Tzeng, G.H. (2003). Ship Scheduling and Cost Analysis for Route Planning in Liner Shipping. Maritime Economics & Logistics, 5(4), 378–392.Google Scholar
Toksari, M.D. (2006). Ant colony optimization for finding the global minimum. Applied Mathematics and Computation, 176(1), 308–316.Google Scholar
Tran, N.K. and Haasis, H.-D. (2015). Literature survey of network optimization in container liner shipping. Flexible Services and Manufacturing Journal, 27(2), 139–179.Google Scholar
Wang, S., Meng, Q. and Sun, Z. (2013). Container Routing in Liner Shipping. Transportation Research Part E, 49(1), 1–7.Google Scholar
Zhang, Z., Sun, J. and Tan, J. (2002). Application of the improved ant colony algorithm. Journal of Shanghai Jiaotong University, 36(11), 1564–1567.Google Scholar
Zheng, J., Meng, Q. and Sun, Z. (2015). Liner hub-and-spoke shipping network design. Transportation Research Part E, 75, 32–48.Google Scholar