Computer Science

Computer Science ›› 2019, Vol. 46 ›› Issue (6): 239-245.doi: 10.11896/j.issn.1002-137X.2019.06.036

Previous Articles     Next Articles

Study on Stowage Optimization in Minimum Container Transportation Cost

ZHENG Fei-feng, JIANG Juan, MEI Qi-huang   

  1. (Glorious Sun School of Business and Management,Donghua University,Shanghai 200051,China)
  • Received:2018-04-02 Published:2019-06-24

PDF (PC)

1042

Abstract: With the rapid development of container transportation along the Yangtze River,the stowage planning has become an important issue in the development of container transportation.Aiming at the minimum shifting cost and stack usage cost during the voyage,this paper established a mixed integer programming model that considers the ship safety and loading stability constraints.Then CPLEX,genetic algorithm and greedy algorithm were designed to analyze the stowage planning of small and medium sized container ships along the Yangtze River,and the validity of the proposed model was proved.Besides,the two proposed algorithms were applied to solve the large-scale container loading problem,and both of them can quickly get reasonable solutions.Compared with the industry experience,the experiments prove that the proposed model can reduce 24.73% on average for the transportation cost of the route and is of certain guiding significance to the container transportation along the Yangtze River.

Key words: Genetic algorithm, Greedy algorithm, Mixed integer programming, Multiple ports, Stowage optimization

CLC Number: 

  • TP391.9
[1]BAI Q H.The new ecology of international shipping:co-buil-ding,sharing and symbiosis－2016 International Maritime Conference Annual Review[J].Zhong Guo Shui Yun,2016,37(11):8-9.(in Chinese)
白庆虹.国际航运新生态:共建、共享、共生 ——2016国际海运年会观点扫描[J].中国水运,2016,37(11):8-9.
[2]PARRENO F,PACINO D,ALVAREZ-VALDES R.A GRASP algorithm for the container stowage slot planning problem[J].Transportation Research Part E Logistics & Transportation Review,2016,94:141-157.
[3]AVRIEL M,PENN M,SHPIRER N,et al.Stowage planning for container ships to reduce the number of shifts[J].Annals ofOpe-rations Research,1998,76:55-71.
[4]DING D,CHOU M C.Stowage planning for container ships:a heuristic algorithm to reduce the number of shifts [J].European Journal of Operational Research,2015,246(1):242-249.
[5]ZHANG W Y,LIN Y,JI Z S.A Model of Bay Layout for Containership Based on the Least Shifting[J].Journal of Shanghai Jiaotong University,2007,41(2):199-204.(in Chinese)
张维英,林焰,纪卓尚.集装箱船全航线Bay位排箱优化模型[J].上海交通大学学报,2007,41(2):199-204.
[6]IMAI A,SASAKI K,NISHIMURA E,et al.Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks[J].European Journal of Operational Research,2006,171(2):373-389.
[7]DELGADO A,JENSEN R M,JANSTRUP K,et al.A Con-straint Programming model for fast optimal stowage of containervessel bays[J].European Journal of Operational Research,2012,220(1):251-261.
[8]TIERNEY K,PACINO D,JENSEN R M.On the complexity of container stowage planning problems[J].Discrete Applied Mathematics,2014,169(2):225-230.
[9]AVRIEL M,PENN M,SHPIRER N.Container ship stowage problem:complexity and connection to the coloring of circle graphs[J].Discrete Applied Mathematics,2000,103(1-3):271-279.
[10]MONACO M F,SAMMARRA M,SORRENTINO G.The terminal-oriented ship stowage planning problem [J].European Journal of Operational Research,2014,239(1):256-265.
[11]AMBROSINO D,SCIOMACHEN A,TANFANI E.A decomposition heuristics for the container ship stowage problem[J].Journal of Heuristics,2006,12(3):211-233.
[12]AMBROSINO D,PAOLUCCI M,SCIOMACHEN A.Computational evaluation of a MIP model for multi-port stowage planning problems[J].Soft Computing,2015,21(7):1753-1763.
[13]PRESTON P,KOZAN E.An approach to determine storage locations of containers at seaport terminals [J].Computers & Ope-rations Research,2001,28(10):983-995.
[14]WILSON I D,ROACH P A.Container Stowage Planning:A Methodology for Generating Computerised Solutions[J].Journal of the Operational Research Society,2000,51(11):1248-1255.
[15]DING Z Y,JO G S,WANG Y,et al.The Relative Efficiency of Container Terminals in Small and Medium-Sized Ports in China[J].Asian Journal of Shipping & Logistics,2015,31(2):231-251.
[16]CHU X J.On Stowage Planning for Mult-port Container Transportation Based on Stability Constraint[J].LogisticsEnginee-ring and Management,2014,36(11):83-84.(in Chinese)
褚晓津.船舶稳定性的多港口集装箱配载问题[J].物流工程与管理,2014,36(11):83-84.
[17]DUAN C H,GUO X.A Stowage Planning Model for Single Bay and Multi-port Based on Integer Programming[J].Computer Aided Engineering,2004,13(3):9-13.(in Chinese)
段成华,郭旭.基于整数规划的单贝多港(SBMP)配载模型研究[J].计算机辅助工程,2004,13(3):9-13.
[18]YANG P,CHAI X Y,SUN J Q.Research on problem of yard crane cooperative schedule[J].Computer Engineering and Applications,2011,47(1):231-233.(in Chinese)
杨鹏,柴小燕,孙俊清.集装箱码头场桥协同调度研究[J].计算机工程与应用,2011,47(1):231-233.
[19]LIANG J,WU Y.Simultaneous berth and quay crane scheduling under uncertainty environments in container terminals[J].Computer Engineering and Applications,2017,53(7):212-219.(in Chinese)
梁承姬,吴宇.不确定环境下集装箱码头泊位与岸桥联合调度[J].计算机工程与应用,2017,53(7):212-219.
[20]AMBROSINO D,SCIOMACHEN A,TAFANI E.Stowing a containership:the master bay plan problem[J].Transportation Research Part A Policy & Practice,2004,38(2):81-99.
[1] ZHANG Chong-yu, CHEN Yan-ming, LI Wei. Task Offloading Online Algorithm for Data Stream Edge Computing [J]. Computer Science, 2022, 49(7): 263-270.
[2] YANG Hao-xiong, GAO Jing, SHAO En-lu. Vehicle Routing Problem with Time Window of Takeaway Food ConsideringOne-order-multi-product Order Delivery [J]. Computer Science, 2022, 49(6A): 191-198.
[3] LIU Zhang-hui, ZHENG Hong-qiang, ZHANG Jian-shan, CHEN Zhe-yi. Computation Offloading and Deployment Optimization in Multi-UAV-Enabled Mobile Edge Computing Systems [J]. Computer Science, 2022, 49(6A): 619-627.
[4] SHEN Biao, SHEN Li-wei, LI Yi. Dynamic Task Scheduling Method for Space Crowdsourcing [J]. Computer Science, 2022, 49(2): 231-240.
[5] WU Shan-jie, WANG Xin. Prediction of Tectonic Coal Thickness Based on AGA-DBSCAN Optimized RBF Neural Networks [J]. Computer Science, 2021, 48(7): 308-315.
[6] ZHENG Zeng-qian, WANG Kun, ZHAO Tao, JIANG Wei, MENG Li-min. Load Balancing Mechanism for Bandwidth and Time-delay Constrained Streaming Media Server Cluster [J]. Computer Science, 2021, 48(6): 261-267.
[7] WANG Jin-heng, SHAN Zhi-long, TAN Han-song, WANG Yu-lin. Network Security Situation Assessment Based on Genetic Optimized PNN Neural Network [J]. Computer Science, 2021, 48(6): 338-342.
[8] ZUO Jian-kai, WU Jie-hong, CHEN Jia-tong, LIU Ze-yuan, LI Zhong-zhi. Study on Heterogeneous UAV Formation Defense and Evaluation Strategy [J]. Computer Science, 2021, 48(2): 55-63.
[9] GAO Shuai, XIA Liang-bin, SHENG Liang, DU Hong-liang, YUAN Yuan, HAN He-tong. Spatial Cylinder Fitting Based on Projection Roundness and Genetic Algorithm [J]. Computer Science, 2021, 48(11A): 166-169.
[10] YAO Ze-wei, LIU Jia-wen, HU Jun-qin, CHEN Xing. PSO-GA Based Approach to Multi-edge Load Balancing [J]. Computer Science, 2021, 48(11A): 456-463.
[11] GAO Ji-xu, WANG Jun. Multi-edge Collaborative Computing Unloading Scheme Based on Genetic Algorithm [J]. Computer Science, 2021, 48(1): 72-80.
[12] JI Shun-hui, ZHANG Peng-cheng. Test Case Generation Approach for Data Flow Based on Dominance Relations [J]. Computer Science, 2020, 47(9): 40-46.
[13] DONG Ming-gang, HUANG Yu-yang, JING Chao. K-Nearest Neighbor Classification Training Set Optimization Method Based on Genetic Instance and Feature Selection [J]. Computer Science, 2020, 47(8): 178-184.
[14] LIANG Zheng-you, HE Jing-lin, SUN Yu. Three-dimensional Convolutional Neural Network Evolution Method for Facial Micro-expression Auto-recognition [J]. Computer Science, 2020, 47(8): 227-232.
[15] YANG De-cheng, LI Feng-qi, WANG Yi, WANG Sheng-fa, YIN Hui-shu. Intelligent 3D Printing Path Planning Algorithm [J]. Computer Science, 2020, 47(8): 267-271.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
渝ICP备16013121号-4
Add:18# Honghu West Rd., Yubei ,Chongqing,China    Post Code: 401121
Tel: 023-63500828/023-67039612/023-67039623
E-mail: jsjkx12@163.com
Powered by Beijing Magtech Co., Ltd.