247 0

Full metadata record

DC FieldValueLanguage
dc.contributor.author이영해-
dc.date.accessioned2021-04-28T00:37:55Z-
dc.date.available2021-04-28T00:37:55Z-
dc.date.issued2000-03-
dc.identifier.citation한국시뮬레이션학회논문지, v. 9, issue. 1, page. 93-108en_US
dc.identifier.issn1225-5904-
dc.identifier.urihttps://www.koreascience.or.kr/article/JAKO200011921154354.jsp-kj=SSMHB4&py=2012&vnc=v27n6&sp=588-
dc.identifier.urihttps://repository.hanyang.ac.kr/handle/20.500.11754/161833-
dc.description.abstractThe stochastic manufacturing system has one or more random variables as inputs that lead to random outputs. Since the outputs are random, they can be considered only as estimates of the true characteristics of the system. These estimates could greatly differ from the corresponding real characteristics for the system. Multiple replications are necessary to get reliable information on the system and output data should be analyzed to get optimal solution. It requires too much computation time practically, In this paper a GA method, named Stochastic Genetic Algorithm(SGA) is proposed and tested to find the optimal solution fast and efficiently by reducing the number of replications.en_US
dc.language.isoen_USen_US
dc.publisher한국시뮬레이션학회en_US
dc.title추계적 생산시스템의 최적 설계를 위한 유전자 알고리즘을 이용한 시뮬레이션 최적화 기법 개발en_US
dc.title.alternativeSimulation Optimization for Optimal at Design of Stochastic Manufacturing System Using Genetic Algorithmen_US
dc.typeArticleen_US
dc.relation.journal한국시뮬레이션학회논문지-
dc.contributor.googleauthor유지용-
dc.contributor.googleauthor정찬석-
dc.contributor.googleauthor이영해-
dc.relation.code2012101554-
dc.sector.campusE-
dc.sector.daehakCOLLEGE OF ENGINEERING SCIENCES[E]-
dc.sector.departmentDEPARTMENT OF INDUSTRIAL AND MANAGEMENT ENGINEERING-
dc.identifier.pidyhlee-
Appears in Collections:
COLLEGE OF ENGINEERING SCIENCES[E](공학대학) > INDUSTRIAL AND MANAGEMENT ENGINEERING(산업경영공학과) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE