http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
GUB 구조를 갖는 0-1 프로그래밍에 의한 시스템 신뢰성의 최적화
이재욱,전구제,현광남,Lee, Jae-Uk,Chun, Koo-Chae,Gen, Mitsuo 대한전자공학회 1989 전자공학회논문지 Vol. No.
본 논문은 각 서브시스템에 여러 종류의 고장모드를 갖는 시스템 신뢰성 최적화 문제를 본 논문에서 제안한 알고리듬으로 처리된 것을 나타내었다. 이 알고리듬은 시스템 신뢰성 최적화의 비선형 문제를 0-1정수계획 문제로 변환할 때 반드시 제약조건에 부가되는 GUB구조(generalized upper bounding structure)를 고려하여 개발되었으며 시스템 신뢰도 개선을 위한 용장 서브시스템 최적배분 문제를 제안한 알고리듬에 따라 계산할 결과 계산반복회수(컴퓨터 계산시간)과 사용된 변수(요구 메모리 용량) 등에서 종래의 알고리듬 보다 우수함을 알 수 있다. This paper showed that the system reliability optimization problem with sereval failure modes at each subsystem can be treated as efficient computational algorithm proposed here. This algorithm was developed by considering a generalized upper bounding which always exists in constraints when the system reliability optimization problem may be reformulated as 0-1 integer programming problem. We demonstrated the optimal allocation of redundant units for system reliability by using the proposed algorithm. Our algorithm is superior to others in terms of number of iterations and variables used.
Su Yeon Cho(조수연),Dong Won Cho(조동원),Young Hae Lee(이영해),Mitsuo Gen(현광남) 대한산업공학회 2011 대한산업공학회 추계학술대회논문집 Vol.2011 No.11
Recently due to increasing smart phones users, the wireless network is one of the important infrastructures in a ubiquitous society. In the ubiquitous environment, the core of the wireless network service competition is to provide customers with reliable internet access and fast data transmission. To meet these situations in the wireless network, customers should be allocated to access point with appropriate balance while data transmission speed between customers need to be improved. In this paper, to solve the balanced allocation minimum spanning tree (BA-MST) problem, we propose multi-objective integer programming model with quality of service, and then genetic algorithm with fuzzy logic to solve it. . In addition, the proposed model and algorithm demonstrated the effectiveness by using numerical experiment. The experiment results show that the proposed GA algorithm produces high-quality solutions in reasonable computation times.