Skip to main content

Advertisement

Log in

An analysis of shipyard spatial arrangement planning problems and a spatial arrangement algorithm considering free space and unplaced block

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

The components of shipyard production systems can be classified into products, processes, facilities, space, humans, and schedules. The production capacity of a shipyard may vary depending on how they are operated. Particularly in the case of ships, it is important to efficiently utilize the limited space because they have large blocks, which are semi-finished products made during the shipbuilding process. To efficiently utilize the space, the locations of blocks must be determined taking various factors into consideration when arranging them in the workshop or stock area. This problem can be described as a spatial arrangement problem. However, as the items with fixed arrival dates and departure dates occupy the space for certain periods before being released from shipyards, this problem must be approached from the perspective of a spatial arrangement planning problem for certain periods and not as a simple spatial arrangement problem. In this study, various shipyard spatial arrangement planning problems are classified and defined based on arrangement areas, arrangement items, algorithms, and evaluation factors. In addition, taking the increasing sizes of shipyard blocks into consideration, evaluation factors and algorithms are proposed so that the shape of the free space and the characteristics of unplaced blocks can be considered in the spatial arrangement planning problems of large blocks. The performances of the proposed evaluation factors and algorithms were verified using block data generated by analyzing existing shipyard data product information. The proposed algorithm performed better than the existing algorithm for spatial arrangement planning problems of large blocks. However, the performance of the proposed algorithm was not significantly different from the existing algorithm when the size of the arrangement item was relatively small compared with the arrangement area.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Kim H, Lee SS, Park JH, Lee JG (2005) A model for a simulation-based shipbuilding system in a shipyard manufacturing process. Int J Comput Integr Manuf 18(6):427–441. https://doi.org/10.1080/09511920500064789

    Article  Google Scholar 

  2. Koh S, Logendran R, Choi D, Woo S (2011) Spatial scheduling for shape-changing mega-blocks in a shipbuilding company. Int J Prod Res 49(23):7135–7714. https://doi.org/10.1080/00207543.2010.535863

    Article  Google Scholar 

  3. Lee DK, Shin JG, Kim Y, Jeong YK (2014) Simulation-based work plan verification in shipyards. J Ship Prod Des 30(2):49–57. https://doi.org/10.5957/JSPD.30.2.130032

    Article  Google Scholar 

  4. Eum CH (2008) Development of a spatial scheduling algorithm for improvement of area efficiency. Thesis, Pukyong National University

  5. Zheng J, Jiang Z, Chen Q, Liu Q (2011) Spatial scheduling algorithm minimising makespan at block assembly shop in shipbuilding. Int J Prod Res 49(8):2351–2371. https://doi.org/10.1080/00207541003709536

    Article  Google Scholar 

  6. Kwon B, Lee GM (2015) Spatial scheduling for large assembly blocks in shipbuilding. Comput Ind Eng 89:203–212. https://doi.org/10.1016/j.cie.2015.04.036

    Article  Google Scholar 

  7. Song YJ, Lee DK, Choe SW, Woo JH, Shin JG (2009) A simulation-based capacity analysis of a block-assembly process in ship production planning. J Soc Nav Archit Korea 46(1):78–86. https://doi.org/10.3744/SNAK.2009.46.1.078

    Article  Google Scholar 

  8. Jeong SK, Jeon GW (2008) Nesting problem for two dimensional irregular shapes using heuristic. IE Interfaces 21(1):8–17

    Google Scholar 

  9. Sheen DM (2012) Nesting expert system using heuristic search. J Ocean Eng Technol 26(4):8–14. https://doi.org/10.5574/KSOE.2012.26.4.008

    Article  Google Scholar 

  10. Pasha A (2003) Geometric bin packing algorithm for arbitrary shapes. Thesis, University of Florida

  11. Whitwell G (2004) Novel heuristic and metaheuristic approaches to cutting and packing. Dissertation, University of Nottingham

  12. Kang K, Moon I, Wang H (2012) A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem. Appl Math Comput 219(3):1287–1299. https://doi.org/10.1016/j.amc.2012.07.036

    MathSciNet  MATH  Google Scholar 

  13. Gonçalves JF, Resende MG (2013) A biased random key genetic algorithm for 2D and 3D bin packing problems. Int J Prod Econ 145(2):500–510. https://doi.org/10.1016/j.ijpe.2013.04.019

    Article  Google Scholar 

  14. van Dijk TG (2014) Tuning the parameters of a loading algorithm. Thesis, University of Twente

  15. Kim SK, Roh MI, Kim KS (2017) Arrangement method of offshore topside based on an expert system and optimization technique. J Offshore Mech Arct Eng 139(2):021302. https://doi.org/10.1115/1.4035141

    Article  Google Scholar 

  16. Kim SK, Roh MI, Kim KS (2017) Evaluation of feasibility index in the arrangement design of an offshore topside based on the automatic transformation of experts’ knowledge and the fuzzy logic. Ocean Eng 130:284–299. https://doi.org/10.1016/j.oceaneng.2016.11.057

    Article  Google Scholar 

  17. Kusiak A, Song Z (2010) Design of wind farm layout for maximum wind energy capture. Renew Energy 35(3):685–694. https://doi.org/10.1016/j.renene.2009.08.019

    Article  Google Scholar 

  18. Chen Y, Li H, Jin K, Song Q (2013) Wind farm layout optimization using genetic algorithm with different hub height wind turbines. Energy Convers Manag 70:56–65. https://doi.org/10.1016/j.enconman.2013.02.007

    Article  Google Scholar 

  19. Daniels AS, Tahmasbi F, Singer DJ (2010) Intelligent ship arrangement passage variable lattice network studies and results. Nav Eng J 122(2):107–119. https://doi.org/10.1111/j.1559-3584.2010.00272.x

    Article  Google Scholar 

  20. Casarosa L (2011) The integration of human factors, operability and personnel movement simulation into the preliminary design of ships utilizing the design building block approach. Dissertation, University College London

  21. van Oers BJ (2011) A packing approach for the early stage design of service vessels. Dissertation, Delft University of Technology

  22. Lee DK, Jeong YK, Shin JG, DK O (2014) Optimized design of electric propulsion system for small crafts using the differential evolution algorithm. International. J Precision Eng Manuf-Green Technol 3(1):229–240. https://doi.org/10.1007/s40684-014-0029-9

    Article  Google Scholar 

  23. Flack RWJ (2011) Evolution of architectural floor plans. Thesis, Brock University

  24. Hopper E, Turton BCH (2001) An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. Eur J Oper Res 128(1):34–57. https://doi.org/10.1016/S0377-2217(99)00357-4

    Article  MATH  Google Scholar 

  25. Lee DK, Jeong YK, Shin JG (2013) Study on a layout design method for leisure ship production factories using a heuristic location-allocation algorithm. J Korean Soc Mar Environ Saf 19(3):277–284. https://doi.org/10.7837/kosomes.2013.19.3.277

    Article  Google Scholar 

  26. Baker BS, Coffamn EG, Rivest RL (1980) Orthogonal packings in two dimensions. SIAM J Comput 9(4):846–855. https://doi.org/10.1137/0209064

    Article  MathSciNet  MATH  Google Scholar 

  27. Chazelle B (1983) The bottom-left bin-packing heuristic: an efficient implementation. IEEE Trans Comput 32(8):697–707. https://doi.org/10.1109/TC.1983.1676307

    Article  MATH  Google Scholar 

Download references

Funding

The national project (development of the simulation-based production management system for middle-sized shipbuilding companies; No. 10050495), which is supported by industry core technology development business of the Ministry of Trade, Industry and Energy (Rep. of Korea), supported this research. This research is also a product of the “Development of production strategy for optimizing cost of marine ships and execution simulation technology” (No. S1106-16-1020) in the ICT Convergence Industry 4.0S (Naval Architecture and Ocean Engineering) Technology Development Projects supported by the Ministry of Science, ICT and Future Planning (Rep. of Korea).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yong-Kuk Jeong.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jeong, YK., Ju, S., Shen, H. et al. An analysis of shipyard spatial arrangement planning problems and a spatial arrangement algorithm considering free space and unplaced block. Int J Adv Manuf Technol 95, 4307–4325 (2018). https://doi.org/10.1007/s00170-017-1525-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-017-1525-1

Keywords

Navigation