Browse > Article

Automated guided vehicle routing for the fixed-interval deliveries of a flexible manufacturing system  

최현선 (한국농수산방송 SCM팀)
유융석 (한양대학교 산업공학과)
노인규 (한양대학교 산업공학과)
Publication Information
Journal of Korean Society of Industrial and Systems Engineering / v.26, no.2, 2003 , pp. 68-74 More about this Journal
Abstract
Modem automated manufacturing processes employ automated guided vehicles(AGVs) for material handling, which serve several machining centers(MCs) in a factory. Optimal scheduling of AGVs can significantly help to increase the efficiency of the manufacturing process by minimizing the idle time of MCs waiting for the raw materials. In this paper, we will analyse the requirements for an optimal schedule and then provide a mathematical framework for an efficient schedule of material delivery by an AGV. With this model, the optimal number of MCs to be utilized will also be determined. Finally, the material delivery schedule employing multiple journeys to the MCs by the AGV will be carried out. Through rigorous analysis and simulation experiments, we shall show that such a delivery strategy will optimize the overall performance.
Keywords
AGVs; vehicle routing; genetic algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 전인환, '전자상거래 환경에서 사용 가능한 동적차량할당문제', 한양대학교 대학원 석사학위논문, 2000
2 Cai, X., T. Kloks and C. K. Wong, 'Time-Varying Shortest Path Problems with Constraints,' Networks, Vol. 29, pp. 141-149, 1997   DOI   ScienceOn
3 Jacques Renaud, Fayez F.Boctor, ' A sweep-based algorithm for the fleet size and mix vehicle routing problem,' European Journal of Operational Research,pp. 618 - 628, 2002
4 Dumas, A., Desrosiers, J. and Gelinas, E., ' An Optimal Algorithm for the Traveling Salesman Problem with Time Windows,' Operations Research, Vol. 43, No.2, pp. 367-371, 1995   DOI   ScienceOn
5 Christofides, N. and S. Eilon., 'An Algorithm for the Vehicle Dispatching Problem,' Operational Research Quarterly, Vol. 20, No.3, pp. 309-318, 1969.   DOI
6 Zbigniew Michalewicz, 'Genetic Algorithm + Data Structure = Evolution Programs,' Springer-Verlag, Berlin Heidelberg
7 Louis, J., Yin, X., and Zhen Ya Yuan, 'Multiple Vehicle Routing with Time Windows using Genetic Algorithms,' Proceedings of the IEEE, pp. 1804-1808,1999
8 Gendreau, M., Guertin, F., Potvin, J and Taillard,E., 'Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching,' Transportation Science, Vol.33, No.4, pp. 381-390, 1999
9 유융석, 노인규, '병렬유전알고리즘을 이용한 차량 경로문제에 대한 연구', 대한산업공학회지, Vol 25, No. 4, pp. 490-499, 1999
10 Fisher, L., Jornsten, O. and Madsen, B., 'Vehicle Routing with Time Windows : Two Optimization Algorithms', Operation Research, Vol. 45, No. 3 pp. 488-458, 1969   DOI   ScienceOn
11 Wan-rong Jih and Jane Yung-jen Hsu, 'Dynamic Vehicle Routing Using Hybrid Genetic Algorithms', Proceedings of the IEEE, pp. 453-458, 1999
12 Ronald G. Askin, Charles R. Standridge, 'Modeling and Analysis of Manufacturing system', John wiley & Song, inc, 1993
13 김여근, 윤복식, 이상복, '메타휴리스틱', 영지문화사, 1999
14 Clarke, G. and J. Wright, 'Scheduling of Vehicles from a Central Depot to a Number of Delivery Points,' Operations Research, Vol. 12, No.4, pp. 568-581, 1964   DOI   ScienceOn
15 박양병, '서비스납기가 주어진 다목적차량일정문제를 위한 혼성유전자 알고리듬의 개발', 한국경영과학회지, Vol 24, No. 2, pp. 121-1999
16 Solomon, M., 'Algorithms for the Routing and Scheduling Problems with Time Window Constraints,' Operations Research, Vol. 35, No.2, pp. 254-265, 1987   DOI   ScienceOn