• 한국경영과학회지
• /
• 제37권3호
• /
• pp.39-55
• /
• 2012

This paper presents an endosymbiotic evolutionary algorithm (EEA) to solve both problems of line balancing and model sequencing in a mixed-model two-sided assembly line (MMtAL) simultaneously. It is important to have a proper balancing and model sequencing for an efficient operation of MMtAL. EEA imitates the natural evolution process of endosymbionts, which is an extension of existing symbiotic evolutionary algorithms. It provides a proper balance between parallel search with the separated individuals representing partial solutions and integrated search with endosymbionts representing entire solutions. The strategy of localized coevolution and the concept of steady-state genetic algorithms are used to improve the search efficiency. The experimental results reveal that EEA is better than two compared symbiotic evolutionary algorithms as well as a traditional genetic algorithm in solution quality.

• 한국품질경영학회:학술대회논문집
• /
• 한국품질경영학회 2009년도 추계학술대회
• /
• pp.131-135
• /
• 2009

This paper considers the sequencing of products in car assembly lines. The sequence which minimizes overall utility work in car assembly lines reduce the cycle time and the risk of conveyor stopping. The sequencing problem is solved using Tabu Search. Tabu Search is a heuristic method which can provide a near optimal solution in real time. The performance of proposed technique is compared with existing heuristic methods in terms of solution quality and computation time. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.

• 한국축산시설환경학회지
• /
• 제13권3호
• /
• pp.219-232
• /
• 2007

Odors from manures are a major problem for livestock production. The most significant odorous compounds in animal manure a.e volatile fatty acids(VFAs). This work reviews the VFAs from the anaerobic sequencing biofilm batch reactor(ASBBR), anaerobic sequencing batch reactor(ASBR), solid compost batch reactor(SCBR), and aerobic sequencing batch reactor(SBR) associated with the animal manure biological treatment. First, we describe and quantify VFAs from animal manure biological treatment and discuss biofiltration for odor control. Then we review certain fundamentals aspects about Anaerobic and aerobic SBR, composting of animal manure, manure compost biofilter for odorous VFAs control, SBR for nitrogen removal, and ASBR for animal wastewater treatment systems considered important for the resource recovery and air quality. Finally, we present an overview for the future needs and current experience of the biological systems engineering for animal manure management and odor control.

• Plant Breeding and Biotechnology
• /
• 제6권4호
• /
• pp.434-443
• /
• 2018

Genotyping-by-sequencing (GBS) has been used as a viable single nucleotide polymorphism (SNP) validation method that provides reduced representation sequencing by using restriction endonucleases. Although GBS makes it possible to perform marker discovery and genotyping simultaneously with reasonable costs and a simple molecular biology workflow, the standard TASSEL-GBS pipeline was designed for homozygous groups, and genotyping of heterozygous groups is more complicated. To addresses this problem, we developed a GBS pipeline for heterozygous groups that called KNU-GBS pipeline, specifically for apple (Malus domestica). Using KNU-GBS pipeline, we constructed a genetic linkage map consisting of 1,053 SNP markers distributed over 17 linkage groups encompassing a total of 1350.1 cM. The novel GBS pipeline for heterozygous groups will be useful for marker-assisted breeding programs, and diverse heterozygous genome analyses.

• 산업융합연구
• /
• 제3권1호
• /
• pp.19-31
• /
• 2005

This paper deals with the sequencing problem in the operation of the manufacturing systems with the constraint of buffer capacity. Some of studies for this theme have been progressed for several years. And then most of them considered only one objective, such as maximum lateness, machine utilization, makespan, mean flowtime and so on. This study deal with two objectives of the delivery for customers and the idle time of machines for producers. For the decision of sequence, the utility function is used. The developed heuristic algorithm presents a good solution. Through a numerical example, the procedures of the job sequencing is explained.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.315-315
• /
• 1996

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2004년도 추계학술대회
• /
• pp.1-5
• /
• 2004

• 한국국방경영분석학회지
• /
• 제36권1호
• /
• pp.15-27
• /
• 2010

현대전에 있어서 대량의 화력, 신속한 기동력은 전승의 핵심요소이기 때문에 전쟁에서 승리하기 위해서는 이에 대한 과학적인 운용이 요구된다. 따라서 첨단기술을 이용한 치밀한 화력계획과 신속 정확한 타격으로 적에게 치명적인 피해를 줄 수 있어야 한다. 특히 사격이 작전개시 전에 미리 계획하여 수행하게 되는 경우는 표적별 사격 필요량에 의해 사격부대의 사격량을 할당함과 동시에 사격순서를 결정한 후 전체사격시간을 최소화함으로써 사격의 효과를 높일 수 있다. 따라서 본 연구에서는 이러한 사격완료시간을 최소화하기 위하여 동시에 표적을 타격하는 경우와 현재 야전부대에서 운용하고 있는 개별적으로 사격하는 문제 그리고 사격부대를 혼합하여 사격하는 경우의 최적의 사격완료시간을 비교하고, 사격시간 최소화를 위해 각 표적을 어떻게 할당할 것인지 수리모형을 이용하여 방안을 제시함으로써 작전계획에 맞는 사격계획표를 작성하는 것이다.

• 지능정보연구
• /
• 제17권2호
• /
• pp.1-22
• /
• 2011

본 논문에서는 선행제약순서결정문제(Sequencing problem with precedence constraints, SPPC)를 효과적으로 해결하기 위한 적응형 유전알고리즘(Adaptive genetic algorithm, aGA)을 제안한다. aGA에서 는 SPPC를 효과적으로 표현하기 위해 위상정렬에 기초한 표현절차(topological sort-based representation procedure) 를 사용한다. 제안된 aGA는 퍼지로직제어를 이용한 적응형구조를 가지고 있으며, 유전 탐색과정을 통해 교차변이 연산자(Crossover operator)의 비율을 적응적으로 조절한다. 수치예제에서는 다양한 형태의 SPPC를 제시하였으며, 그 실험결과는 제안된 aGA가 기존의 알고리즘보다 우수함을 보여주었다. 결론적으로 말하자면 본 논문에서는 제안된 aGA가 다양한 형태의 SPPC에서 최적해 혹은 최적순서를 발견하는데 아주 효과적이라는 것을 밝혔다.

• 산업융합연구
• /
• 제5권2호
• /
• pp.21-32
• /
• 2007

This paper deals with the sequencing problem in the operation of the manufacturing systems with the constraint of buffer capacity. Some of studies for this theme have been progressed for several years. And then most of them considered only one objective, such as maximum lateness, machine utilization, makespan, mean flowtime and so on. This study deal with two objectives of the delivery for customers and the idle time of machines for producers. For the decision of sequence, the utility function is used. The developed heuristic algorithm presents a good solution. Through a numerical example, the procedures of the job sequencing is explained.