공급사슬 네트워크 설계를 위한 협력적 공진화 알고리즘에서 집단들간 상호작용방식에 관한 연구

다국어 초록 (Multilingual Abstract)

Cooperative coevolutionary algorithm (CCEA) has proven to be a very powerful means of solving optimization problems through problem decomposition. CCEA implies the use of several populations, each population having the aim of finding a partial solution for a component of the considered problem. Populations evolve separately and they interact only when individuals are evaluated. Interactions are made to obtain complete solutions by combining partial solutions, or collaborators, from each of the populations. In this respect, we can think of various interaction modes. The goal of this research is to develop a CCEA for a supply chain network design (SCND) problem and identify which interaction mode gives the best performance for this problem. We present general design principle of CCEA for the SCND problem, which require several co-evolving populations. We classify these populations into two groups and classify the collaborator selection scheme into two types, the random-based one and the best fitness-based one. By combining both two groups of population and two types of collaborator selection schemes, we consider four possible interaction modes. We also consider two modes of updating populations, the sequential mode and the parallel mode. Therefore, by combining both four possible interaction modes and two modes of updating populations, we investigate seven possible solution algorithms. Experiments for each of these solution algorithms are conducted on a few test problems. The results show that the mode of the best fitness-based collaborator applied to both groups of populations combined with the sequential update mode outperforms the other modes for all the test problems.

목차 (Table of Contents)

• Abstract
• 1. 서론
• 2. CCEA의 설계 속성들
• 3. SCND 문제
• 4. CCEA의 설계
• 5. 집단들간 상호작용 방식들의 성능 비교
• 6. 결론
• 참고문헌

참고문헌 (Reference)

1 한용호, "협력적 공진화 알고리즘에 기반한 다단계 공급사슬 네트워크의 설계" 한국SCM학회 11 (11): 87-96, 2011

2 한용호, "역물류 네트워크 모델의 최적화를 위한 협력적 공진화 알고리즘" 한국경영과학회 27 (27): 15-31, 2010

3 한용호, "순열 표현 기반의 협력적 공진화 알고리즘을 사용한 다단계 공급사슬 네트워크의 설계" 한국경영과학회 29 (29): 21-34, 2012

4 한용호, "다중 집단 기반의 협력적 공진화 알고리즘을 사용한 폐쇄루프 공급사슬 네트워크의 설계" 한국SCM학회 13 (13): 55-66, 2013

5 Danoy, G., "hLCGA：A Hybrid Competitive Coevolutionary Genetic Algorithm" 48-51, 2006

6 Pimpawat, C., "Three-Dimensional Container Loading Using a Cooperative Co-evolutionary Genetic Algorithm" 18 : 581-601, 2004

7 Potter, M., "Parallel Problem Solving from Nature (PPSN III)" Springer 249-257, 1994

8 Danoy, G., "Overcoming Partitioning in Large Ad Hoc Networks Using Genetic Algorithms" GEC CO 1347-1354, 2009

9 Xing, L. N., "Multi-population Interactive Coevolutionary Algorithm for Flexible Job Shop Scheduling Problem" 48 : 139-155, 2011

10 Goldberg, D. E., "Genetic Algorithm：in Search, Optimization and Machine Learning" Addison Wesley 1989

11 Eriksson, R., "Cooperative Coevolution in Inventory Control Optimisation" 583-587, 1997

12 Wiegand, R. P., "An Analysis of Cooperative Algorithms" D. at George Mason University 2003

13 Dorronsoro, B., "Achieving Super-Linear Performance in Parallel Multi-Objective Evolutionary Algorithms by Means of Cooperative Coevolution" 40 (40): 1552-1563, 2013

14 Gen, M., "A Genetic Algorithm for Two-Stage Transportation Problem Using Priority-Based Encoding" 28 : 337-354, 2006

15 Wang, H.F., "A Closed-Loop Logistics Model with a Spanning-Tree Based Genetic Algorithm" 37 : 376-389, 2010

16 한용호, "5개 모집단의 협력적 공진화 알고리즘을 사용한 다단계 공급사슬 네트워크 설계" 한국SCM학회 12 (12): 59-69, 2012

17 한용호, "2 단계 수송문제에 대한 협력적 공진화 알고리즘 기반의 혁신적 해법" 산업개발연구소 25 (25): 227-251, 2009