최소 비용할당 기반 온라인 지게차 운영 알고리즘 = An Online Forklift Dispatching Algorithm Based on Minimal Cost Assignment Approach

국문 초록 (Abstract)

조선소의 지게차는 작업 특성상 무거운 물건을 상/하차하거나 이송하는 작업이 빈번하다. 작업은 동적이며 시간대별로 생성 비율이 다르다. 특히 오전과 오후 업무시간 직후에 작업 발생 비율이 높은 경향을 보인다. 이러한 상/하차 작업과 이송작업의 무게는 매번 다르며, 활용되는 지게차 역시 작업 가능한 허용무게의 제약이 있다. 본 연구에서는 지게차의 원활한 운영을 위해 최소 비용할당을 사용한 최근린 배차 규칙 알고리즘을 제안한다. 제시된 알고리즘은 다양한 종류의 지게차와 다수의 작업을 동시에 고려하여 배차를 결정하며, 지게차 종류에 따른 작업 불가능을 고려하기 위해 가상 지게차와 가상 작업을 생성하는 방법을 제안한다. 그리고 차량의 상태를 고려하여 체계적으로 지게차를 선택하는 방법도 함께 제시한다. 성능지표는 평균 공차이동거리와 평균 작업대기시간으로 한다. 성능비교를 위해 조선소의 지게차 운영방식을 모델링한 우선순위 규칙을 비교 대상으로 한다. 시뮬레이션을 통해 제시한 알고리즘의 우수성을 확인한다.

다국어 초록 (Multilingual Abstract)

Forklifts in a shipyard lift and transport heavy objects. Tasks occur dynamically and the rate of the task occurrence changes over time. Especially, the rate of the task occurrence is high immediately after morning and afternoon business hours. The weight of objects varies according to task characteristic, and a forklift also has the workable or allowable weight limit. In this study, we propose an online forklift dispatching algorithm based on nearest-neighbor dispatching rule using minimal cost assignment approach in order to attain the efficient operations. The proposed algorithm considers various types of forklift and multiple jobs at the same time to determine the dispatch plan. We generate dummy forklifts and dummy tasks to handle unbalance in the numbers of forklifts and tasks by taking their capacity limits and weights. In addition, a method of systematic forklift selection is also devised considering the condition of the forklift. The performance indicator is the total travel distance and the average task waiting time. We validate our approach against the priority rule-based method of the previous study by discrete-event simulation.

참고문헌 (Reference)

• 1 한충균, "최근린 배차 규칙 기반 온라인 Personal Rapid Transit 배차 알고리즘" 한국시뮬레이션학회 23 (23): 97-109, 2014
• 2 고시근, "조선소의 메가블록 조립작업장을 위한 공간계획알고리즘 개발" 대한산업공학회 24 (24): 78-86, 2011
• 3 한충균, "정체를 고려한 Personal Rapid Transit 배차 및 경로계획 알고리즘" 대한전기학회 64 (64): 1578-1586, 2015
• 4 Roh, M.I., "block transportation scheduling system considering a minimization of travel distance without loading of and interference between multiple transporters" 49 (49): 3231-3250, 2011
• 5 Dean, S.F., "Why the closest ambulance cannot be dispatched in an urban emergency medical services system" 23 (23): 161-165, 2008
• 6 Lee, W.S., "Transporter scheduling based on a network flow model under a dynamic block transportation environment" 311-316, 2009
• 7 Lee, S., "The role of centrality in ambulance dispatching" 54 (54): 282-291, 2012
• 8 Ingmar, A., "Reallocation of empty PRT vehicles en route" 1838 : 2003
• 9 Bilge, U., "Multi-attribute responsive dispatching strategies for automated guided vehicles" 100 (100): 65-75, 2006
• 10 Zhicheng, B., "Modified Hungarian algorithm for real- time ALV dispatching problem in huge container terminals" 9 (9): 123-130, 2014
• 11 Savelsbergh, M.W.P., "Local Search in Routing Problems with Time Windows" 4 (4): 285-305, 1985
• 12 Park, C., "GRASP approach to transporter scheduling and routing at a shipyard" 63 (63): 390-399, 2012
• 13 Lees-Miller, J.D., "Empty vehicle redistribution for personal rapid transit" Bristol University 2011
• 14 Koh, S.G., "Development of a block assembly scheduling system for shipbuilding company" 12 (12): 586-594, 1999
• 15 Joo, C.M., "Block transportation scheduling under delivery restriction in shipyard using meta- heuristic algorithms" 41 (41): 2851-2858, 2014
• 16 Hayes, J., "Ambulance dispatch complexity and dispatcher decision strategies: implications for interface design" 589-593, 2004
• 17 Cho, K.K., "A spatial scheduling system for block painting process in shipbuilding" 50 (50): 339-342, 2001
• 18 Ho, Y.C., "A simulation study on the performance of pickup-dispatching rules for multiple-load AGVs" 51 (51): 445-463, 2006
• 19 Kwon, B.B., "A simulation model for evaluating forklift dispatching policies in shipyard" 2014
• 20 Confessore, G., "A network flow based heuristic approach for optimising AGV movements" 24 (24): 405-419, 2013