Ship Block Transportation Scheduling Problem Based on Greedy Algorithm

Chong Wang; Wuhan University of Technology, Key Laboratory of High Performance Ship Technology , Wuhan, China; Yun - sheng Mao; Bing - qiang Hu; Zhong - jie Deng; Jong Gye Shin; Department of Naval Architecture and Ocean Engineering, Seoul National University, Seoul, Korea; Wuhan University of Technology, Key Laboratory of High Performance Ship Technology , Wuhan, China; Wuhan University of Technology, School of Transportation, Wuhan, China; Wuhan University of Technology, Key Laboratory of High Performance Ship Technology , Wuhan, China; Wuhan University of Technology, School of Transportation, Wuhan, China; Wuhan University of Technology, Key Laboratory of High Performance Ship Technology , Wuhan, China; Wuhan University of Technology, School of Transportation, Wuhan, China; Department of Naval Architecture and Ocean Engineering, Seoul National University, Seoul, Korea; Research Institute of Marine System Engineering, Seoul National University, Seoul, Korea

doi:10.25103/jestr.092.15

Ship block transportation problems are crucial issues to address in reducing the construction cost and improving the productivity of shipyards. Shipyards aim to maximize the workload balance of transporters with time constraint such that all blocks should be transported during the planning horizon. This process leads to three types of penalty time: empty transporter travel time, delay time, and tardy time. This study aims to minimize the sum of the penalty time. First, this study presents the

more »

... oblem of ship block transportation with the generalization of the block transportation restriction on the multi-type transporter. Second, the problem is transformed into the classical traveling salesman problem and assignment problem through a reasonable model simplification and by adding a virtual node to the proposed directed graph. Then, a heuristic algorithm based on greedy algorithm is proposed to assign blocks to available transporters and sequencing blocks for each transporter simultaneously. Finally, the numerical experiment method is used to validate the model, and its result shows that the proposed algorithm is effective in realizing the efficient use of the transporters in shipyards. Numerical simulation results demonstrate the promising application of the proposed method to efficiently improve the utilization of transporters and to reduce the cost of ship block logistics for shipyards.

doi:10.25103/jestr.092.15 fatcat:a5asl4cq2bbqrhttewmkr6fbjq

DOAJ

Citation

Chong Wang, Wuhan University of Technology, Key Laboratory of High Performance Ship Technology , Wuhan, China, Yun - sheng Mao, Bing - qiang Hu, Zhong - jie Deng, Jong Gye Shin, Department of Naval Architecture and Ocean Engineering, Seoul National University, Seoul, Korea, Wuhan University of Technology, Key Laboratory of High Performance Ship Technology , Wuhan, China, Wuhan University of Technology, School of Transportation, Wuhan, China, Wuhan University of Technology, Key Laboratory of High Performance Ship Technology , Wuhan, China, Wuhan University of Technology, School of Transportation, Wuhan, China, Wuhan University of Technology, Key Laboratory of High Performance Ship Technology , Wuhan, China, Wuhan University of Technology, School of Transportation, Wuhan, China, Department of Naval Architecture and Ocean Engineering, Seoul National University, Seoul, Korea, Research Institute of Marine System Engineering, Seoul National University, Seoul, Korea. "Ship Block Transportation Scheduling Problem Based on Greedy Algorithm." Journal of Engineering Science and Technology Review 9.2 (2016) 93-98

Ship Block Transportation Scheduling Problem Based on Greedy Algorithm

Preserved Fulltext