A hybrid method for the determination of the minimum number of transport vehicles in a shipyard
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Shipbuilding companies use transport vehicles and often sign a rental contract with third-party vendors. To avoid including unnecessary vehicles in the contract, it is important to determine the proper number of transport vehicles when the contract is made. This paper presents a hybrid method for the determination of the minimum number of transport vehicles using a given task scenario in a shipyard. The method uses a genetic algorithm for making task-allocation decisions and uses an exact method for making the tasksequence decisions for individual vehicles. The exact method ensures optimality, and thus the hybrid method could have better performance than the genetic algorithm that alone determines both task-allocation and task-sequence decisions. This paper compares the performance of the hybrid method with that of the genetic algorithm using real industry data. The comparison shows that the hybrid method has improved performance, which tends to be more significant as the problem becomes more difficult to solve.
Abstract
Shipbuilding companies use transport vehicles and often sign a rental contract with third-party vendors. To avoid including unnecessary vehicles in the contract, it is important to determine the proper number of transport vehicles when the contract is made. This paper presents a hybrid method for the determination of the minimum number of transport vehicles using a given task scenario in a shipyard. The method uses a genetic algorithm for making task-allocation decisions and uses an exact method for making the tasksequence decisions for individual vehicles. The exact method ensures optimality, and thus the hybrid method could have better performance than the genetic algorithm that alone determines both task-allocation and task-sequence decisions. This paper compares the performance of the hybrid method with that of the genetic algorithm using real industry data. The comparison shows that the hybrid method has improved performance, which tends to be more significant as the problem becomes more difficult to solve.
참고문헌 (13)
- C. -M. Ju, "Transporter scheduling for block transportation in the shipyard", Proceedings of the Korean Operations and Management Science Society Conference, pp.348~352 (2005)
- W. -S. Lee, "Transporter scheduling based on a network flow model under a dynamic block transportation environment", Proceedings of International Conference on Computers & Industrial Engineering, pp.311~316 (2009)
- Myung-Il Roh, "A block transportation scheduling system considering a minimisation of travel distance without loading of and interference between multiple transporters", International Journal of Production Research, 49(11), pp.3231~3250 (2011), Informa UK Limited[DOI]
- 허예지, "운송 경로 손상을 고려한 트랜스포터의최적 블록 운송 경로 계획", 대한조선학회 논문집, 50(5), pp.298~306 (2013), 대한조선학회
- 차주환, "조선소 트랜스포터 운영을 위한 최적 계획 시스템 개발", 한국CDE학회 논문집, 21(2), pp.177~185 (2016), 한국CDE학회[DOI]
- C. -K. Park, "A GRASP approach to transporter scheduling and routing at a shipyard", Computers &Industrial Engineering, 63(2), pp.390~399 (2012)
- C. -M. Joo, "Block transportation scheduling under delivery restriction in shipyard using meta-heuristic algorithms", Expert Systems with Applications, 41(6), pp.2851~2858 (2014)[DOI]
- G. Laporte, "A short history of the traveling salesman problem", Canada Research Chair in Distribution Management, Centre for Research on Transportation (CRT) and GERAD HEC Montréal, ~ (2006)
- G. Dantzig, "Solution of a large-scale traveling-salesman problem", Journal of the Operations Research Society of America, 2(4), pp.393~410 (1954)
- W. L. Eastman, "Linear programming with pattern constraints", Ph.D., Department of Economics, pp.1958
- J. D. Little, "An algorithm for the traveling salesman problem", Operations research, 11(6), pp.972~989 (1963)
- I. I. Cplex, "V12. 1: User’s Manual for CPLEX" (2009), International Business Machines Corporation
- "Gurobi optimizer reference manual"[URL]