Storage Location Planning of Assembly Blocks at Shipyard

Title
Storage Location Planning of Assembly Blocks at Shipyard
Authors
김광태
Keywords
storagelocationplanningofassemblyblocksatshipyard
Issue Date
2010
Publisher
인하대학교
Abstract
This thesis considers the problem of assigning assembly blocks used for building a ship to an assembly block stockyard at shipyard over a planning horizon while minimizing the number of obstructive blocks. The obstructive block implies ablock obstructing storage/retrieval of another block since the location with the block is on the way of another block’s storage/retrieval and thus, the obstructive block should be retrieved for a while from the location. Such unproductive tasks not only increase logistic cost but also influence on shipbuilding schedule. In fact, a non-linear model has been already suggested to solve the problem, but has the wrong process of obtaining a solution pointed out in this thesis. The purpose of this research is to suggest two integer program models and heuristic algorithms in order to solve the problem and show their performances over the existing genetic algorithm. To show the performance of the heuristic algorithms suggested, computational experiments were performed on randomly generated test instances. Results of the test showed that simulated annealing algorithm and improvement heuristic suggested in this thesis provided better solutions than the existing genetic algorithm within a short computation time.
Description
Chapter 1 Introduction 1 1.1. Research Background 1 1.2. Overview of Shipbuilding Process 3 1.3. Research Motivation and Scope 5 Chapter 2 Literature Review 6 Chapter 3 Problem Description and Mathematical Model 10 3.1. Problem Description 10 3.2. Integer Programming Model with One Direction 11 3.3. Integer Programming Model with Multi-Directions 14 Chapter 4 Solution Algorithms 18 4.1. Construction Heuristic 18 4.2. Improvement Heuristic 19 4.3. Simulated Annealing 21 Chapter 5 Computational Experiments 23 Chapter 6 Conclusions 28 References 30 Appendices 32 Appendix A. Non-Linear Programming Model with One Direction 32 Appendix B. Non-Linear Programming Model with Multi-Directions 34 Appendix C. Counting Error in Previous Model 36
URI
http://dspace.inha.ac.kr/handle/10505/2020
Appears in Collections:
Asia Pacific School of Logistics(아태물류학부) > Graduate School of Logistics (물류전문대학원) > Theses(물류전문대학원 석박사 학위논문)
Files in This Item:
2308.pdfDownload

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse