지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 대한산업공학회 Industrial Engineering & Management Systems Industrial Engineering & Management Systems 제8권 제3호
- 발행연도
- 2009.9
- 수록면
- 171 - 180 (10page)
이용수
초록· 키워드
오류제보하기
Population learning algorithm (PLA) is a population-based method that was inspired by the similarities to the phenomenon of social education process in which a diminishing number of individuals enter an increasing number of learning stages. The study aims to develop a framework that repeatedly applying the PLA to solve the discrete resource constrained project scheduling problem with two objectives: minimizing project makespan and renewable resource availability, which are two most common concerns of management when a project is being executed. The PLA looping framework will provide a number of near Pareto optimal schedules for the management to make a choice. Different improvement schemes and learning procedures are applied at different stages of the process. The process gradually becomes more and more sophisticated and time consuming as there are less and less individuals to be taught. An experiment with ProGen generated instances was conducted, and the results demonstrated that the looping framework using PLA outperforms those using genetic local search, particle swarm optimization with local search, scatter search, as well as biased sampling multi-pass algorithm, in terms of several performance measures of proximity. However, the diversity using spread metric does not reveal any significant difference between these five looping algorithms.
목차
Abstract
1. INTRODUCTION
2. PROBLEM DESCRIPTIONS
3. PROBLEM SOLVING METHODS
4. EXPERIMENTAL RESULTS
5. CONCLUSIONS AND FUTURE RESEARCH
ACKNOWLEDGMENT
REFERENCES
참고문헌 (0)
참고문헌 신청함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
Resource Constrained Project Scheduling Using Local search in ' Problem Space '
대한산업공학회 추계학술대회 논문집
1995 .10
-
A Dual-Population Memetic Algorithm for Minimizing Total Cost of Multi-Mode Resource-Constrained Project Scheduling
Industrial Engineering & Management Systems
2010 .06
-
An Efficient PSO Algorithm for Finding Pareto-Frontier in Multi-Objective Job Shop Scheduling Problems
Industrial Engineering & Management Systems
2013 .06
-
A Hybrid of Particle Swarm and Genetic Algorithm for Constrained Real-Parameter Optimization
한국항공우주학회 학술발표회 초록집
2013 .04
-
An Efficient Modified Immigrant Population Search Algorithm for Optimization over Unconstrained Spaces
Industrial Engineering & Management Systems
2019 .03
-
L-폴리락타이드, D-폴리락타이드의 합성과 입체복합체 폴리락타이드의 제조 및 특성연구
폴리머
2011 .01
-
고밀도 PLA설계를 위한 겹침 알고리즘
대한전기학회 학술대회 논문집
1988 .07
-
고밀도 PLA 설계를 위한 겹침 알고리즘 ( A Folding Algorithm for Design of High Density PLA's )
대한전자공학회 학술대회
1988 .07
-
3진 시스템에 적합한 Pla설계에 관한 연구 ( A Study on Design of Pla Suitable for Three-Valued Systems )
대한전자공학회 학술대회
1992 .07
-
3진 시스템에 적합한 PLA설계에 관한 연구
대한전자공학회 학술대회
1992 .06
-
PLA 겹침 방법을 이용한 PLA 매크로셀 작성 프로그램
대한전자공학회 학술대회
1985 .06
-
Test 가 용이한 PLA의 설계
대한전자공학회 학술대회
1981 .01
-
A Multi-Objective Evolutionary Algorithm for Scheduling Flexible Manufacturing Systems
Industrial Engineering & Management Systems
2017 .06
-
PLA 수지 Grade에 따른 분해 특성 평가
한국지반신소재학회 학술발표회
2009 .11
-
Solution of the Resource Constrained Project Scheduling Problem on the Foundation of a Term-Based Approach
한국지능시스템학회 논문지
2014 .04
-
고밀도 Pla 설계를 위한 효율적인 겹침 알고리즘 ( An Efficient Folding Algorithm for the Design of High Density Pla )
대한전자공학회 학술대회
1990 .11
-
고밀도 PLA설계를 위한 효율적인 겹침 알고리즘
대한전자공학회 학술대회
1990 .11
-
Comparator 의 PLA 설계에 관한 연구 ( A Study on the Design of PLA for Computer )
대한전자공학회 학술대회
1985 .01
-
An Efficient Algorithm for Optimal PLA Folding
JOURNAL OF KIEE
1989 .03
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2013-530-002614748