• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 G
• /
• pp.2953-2955
• /
• 1999

In this paper, the concept of evolvable hardware and evolutionary robotics are introduced and constructing the mobile robot controller without human operator is suggested. The robot controller is evolved to avoid obstacles by genetic learning which determines the weights between sensor inputs and motor outputs. Genetic algorithms which is executed in a computer(PC) searches the best weights by interacting with robot performance under it's environment. The experiment is done by real mobile robot Khepera and a simple GA.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• pp.1353-1355
• /
• 2003

Genetic algorithms (GA) is a well known technique that is capable of handling multiobjective functions and discrete constraints in the process of numerical optimization. Together with the Pareto ranking scheme, more than one possible solution can be obtained despite the imposed constraints and multi-criteria design functions. In view of this unique capability, the design of the log-periodic dipole antenna array (LPDA) using this special feature is proposed in this paper. This method also provides gain, front-back level and S parameter design tradeoff for the LPDA design in broadband application at no extra computational cost.

• 한국인터넷방송통신학회논문지
• /
• 제11권1호
• /
• pp.115-123
• /
• 2011

본 논문에서는 배전 손실 최소화 문제에 있어서 GA의 수렴특성을 개선하기 위해서는 새로운 수명의 개념을 도입한다. 즉 개체군의 균질화와 유전적 부동의 문제에 대해서 연령을 가진 집단에 유한의 수명을 부여하여 적응도에 의한 도태외에 어느수명에 도달한 경우에도 도태시키려는 방법을 제안하였다. 이 방법은 적응도가 가장 높은 개체는 개체수의 양, 엘리트 보존전략의 영향에 의해 자손을 남기는 확률이 높은 것인데 비해 적응도가 낮은 개체는 수명에 의해 빨리 도태되고 또한 수렴성의 향상을 기대할 수 있다. 게다가 수명을 고려한 볼수 법과 이미 제안되어 있는 DPM을 조합하여 이하와 같은 특징을 가진 GA의 탐색알고리즘을 개발한다.

• 한국산업정보학회논문지
• /
• 제10권4호
• /
• pp.54-64
• /
• 2005

인체 하지 근골격 시스템의 수학적 모델에 대해 최적제어 기법을 이용하여 최대 높이뛰기 운동을 재현하였다. 근육의 비선형 동적특성에 의해 순동역학 접근방법을 사용하였으며 최적제어는 최적화 프로그램인 마이크로 유전알고리즘과 VF02 비선형 최적화 프로그램을 적용하였다. 최대 높이뛰기 운동을 위한 근골격 모델에서 유전알고리즘만으로는 최적해를 얻을 수가 없었다. 유전알고리즘의 해를 비선형 최적화 프로그램의 초기 예측값으로 하여 도약시간에 따른 최적의 운동 신경자극도를 결정하였다. 이러한 접근방법은 초기의 인위적 예측값 없이 최대높이뛰기 운동에 대한 전역해를 제공하였다.

• International Journal of Control, Automation, and Systems
• /
• 제4권4호
• /
• pp.405-413
• /
• 2006

A novel approach based on genetic algorithms (GA) is developed to find a global minimum-jerk trajectory of a space robotic manipulator in joint space. The jerk, the third derivative of position of desired joint trajectory, adversely affects the efficiency of the control algorithms and stabilization of whole space robot system and therefore should be minimized. On the other hand, the importance of minimizing the jerk is to reduce the vibrations of manipulator. In this formulation, a global genetic-approach determines the trajectory by minimizing the maximum jerk in joint space. The planning procedure is performed with respect to all constraints, such as joint angle constraints, joint velocity constraints, joint angular acceleration and torque constraints, and so on. We use an genetic algorithm to search the optimal joint inter-knot parameters in order to realize the minimum jerk. These joint inter-knot parameters mainly include joint angle and joint angular velocities. The simulation result shows that GA-based minimum-jerk trajectory planning method has satisfactory performance and real significance in engineering.

• 한국경영과학회지
• /
• 제27권2호
• /
• pp.97-109
• /
• 2002

Manufacturing environments in the real world are subject to many sources of change and uncertainty, such as new job releases, job cancellations, a chance in the processing time or start time of some operation. Thus, the realistic scheduling method should Properly reflect these dynamic environment. Based on the release times of jobs, JSSP (Job Shoe Scheduling Problem) can be classified as static and dynamic scheduling problem. In this research, we mainly consider the dynamic JSSP with continually arriving jobs. The goal of this research is to develop an efficient scheduling method based on GA (Genetic Algorithm) to address dynamic JSSP. we designed scheduling method based on SGA (Sing1e Genetic Algorithm) and PGA (Parallel Genetic Algorithm) The scheduling method based on GA is extended to address dynamic JSSP. Then, This algorithms are tested for scheduling and rescheduling in dynamic JSSP. The results is compared with dispatching rule. In comparison to dispatching rule, the GA approach produces better scheduling performance.

• 산업공학
• /
• 제19권4호
• /
• pp.300-305
• /
• 2006

The problem of assigning customers to satellite channels is considered in this paper. Finding an optimal allocation of customers to satellite channels is a difficult combinatorial optimization problem and is shown to be NP-complete in an earlier study. We propose a genetic algorithm (GA) approach to search for the best/optimal assignment of customers to satellite channels. Various issues related to genetic algorithms such as solution representation, selection methods, genetic operators and repair of invalid solutions are presented. A comparison of GA with CPLEX8.1 is presented to show the advantages of this approach in terms of computation time and solution quality.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1997년도 추계학술대회발표논문집; 홍익대학교, 서울; 1 Nov. 1997
• /
• pp.166-169
• /
• 1997

For parallel processing, the compiler partitions a loaded program into a set of tasks and makes a schedule for the tasks that will minimize parallel processing time for the loaded program. Building an optimal schedule for a given set of partitioned tasks of a program has known to be NP-complete. In this paper we introduce a GA(Genetic Algorithm)-based scheduling method in which a chromosome consists of two parts of a string which decide the number and order of tasks on each processor. An additional computation is used for feasibility constraint in the chromosome. By granularity theory, a partitioned program is categorized into coarse-grain or fine-grain types. There exist good heuristic algorithms for coarse-grain type partitioning. We suggested another GA adaptive to the coarse-grain type partitioning. The infeasibility of chromosome is overcome by the encoding and operators. The number of processors are decided while the GA find the minimum parallel processing time.

• Industrial Engineering and Management Systems
• /
• 제10권1호
• /
• pp.7-14
• /
• 2011

In solving the Job Shop Scheduling Problem, the best solution rarely is completely random; it follows one or more rules (heuristics). The Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Simulated Annealing, and Tabu search, which belong to the Evolutionary Computations Algorithms (ECs), are not efficient enough in solving this problem as they neglect all conventional heuristics and hence they need to be hybridized with different heuristics. In this paper a new algorithm titled "Shaking Optimization Algorithm" is proposed that follows the common methodology of the Evolutionary Computations while utilizing different heuristics during the evolution process of the solution. The results show that the proposed algorithm outperforms the GA, PSO, SA, and TS algorithms, while being a good competitor to some other hybridized techniques in solving a selected number of benchmark Job Shop Scheduling problems.

• Industrial Engineering and Management Systems
• /
• 제3권1호
• /
• pp.22-37
• /
• 2004

An integrated heuristic approach based on genetic algorithms (GAs) is proposed for solving the container selection and loading problems. The GA for container selection solves a two-dimensional knapsack problem, determining a set of containers to minimize the transportation or shipment cost. The GA for container loading solves for the weighted coefficients in the evaluation functions that are applied in selecting loading positions and boxes to be loaded, so that the volume utilization is maximized. Several loading constraints such as box orientation, stack priority, stack stability, and container stability are also incorporated into the algorithm. In general, our computational results based on randomly generated data and problems from the literature suggest that the proposed heuristic provides a good solution in a reasonable amount of computational time.