• Title/Summary/Keyword: genetic problem-solving

Search Result 200, Processing Time 0.027 seconds

Multiobjective Genetic Algorithm for Scheduling Problems in Manufacturing Systems

  • Gen, Mitsuo;Lin, Lin
    • Industrial Engineering and Management Systems
    • /
    • v.11 no.4
    • /
    • pp.310-330
    • /
    • 2012
  • Scheduling is an important tool for a manufacturing system, where it can have a major impact on the productivity of a production process. In manufacturing systems, the purpose of scheduling is to minimize the production time and costs, by assigning a production facility when to make, with which staff, and on which equipment. Production scheduling aims to maximize the efficiency of the operation and reduce the costs. In order to find an optimal solution to manufacturing scheduling problems, it attempts to solve complex combinatorial optimization problems. Unfortunately, most of them fall into the class of NP-hard combinatorial problems. Genetic algorithm (GA) is one of the generic population-based metaheuristic optimization algorithms and the best one for finding a satisfactory solution in an acceptable time for the NP-hard scheduling problems. GA is the most popular type of evolutionary algorithm. In this survey paper, we address firstly multiobjective hybrid GA combined with adaptive fuzzy logic controller which gives fitness assignment mechanism and performance measures for solving multiple objective optimization problems, and four crucial issues in the manufacturing scheduling including a mathematical model, GA-based solution method and case study in flexible job-shop scheduling problem (fJSP), automatic guided vehicle (AGV) dispatching models in flexible manufacturing system (FMS) combined with priority-based GA, recent advanced planning and scheduling (APS) models and integrated systems for manufacturing.

A Study on A Global Optimization Method for Solving Redundancy Optimization Problems in Series-Parallel Systems (직렬-병렬 시스템의 중복 설계 문제의 전역 최적화 해법에 관한 연구)

  • 김재환;유동훈
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.6 no.1
    • /
    • pp.23-33
    • /
    • 2000
  • This paper is concerned with finding the global optimal solutions for the redundancy optimization problems in series-parallel systems related with system safety. This study transforms the difficult problem, which is classified as a nonlinear integer problem, into a 0/1 IP(Integer Programming) by using binary integer variables. And the global optimal solution to this problem can be easily obtained by applying GAMS (General Algebraic Modeling System) to the transformed 0/1 IP. From computational results, we notice that GA(Genetic Algorithm) to this problem, which is, to our knowledge, known as a best algorithm, is poor in many cases.

  • PDF

Development of a Global Searching Shortest Path Algorithm by Genetic Algorithm (유전 알고리듬을 이용한 전역탐색 최단경로 알고리듬개발)

  • 김현명;임용택
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.2
    • /
    • pp.163-178
    • /
    • 1999
  • Conventional shortest path searching a1gorithms are based on the partial searching method such as Dijsktra, Moore etc. The a1gorithms are effective to find a shortest path in mini-modal condition of a network. On the other hand, in multi-modal case they do not find a shortest path or calculate a shortest cost without network expansion. To copy with the problem, called Searching Area Problem (SAP), a global searching method is developed in this paper with Genetic Algorithm. From the results of two examples, we found that the a1gorithm is useful to solving SAP without network expansion.

  • PDF

Cognitive Radio Using ITMA for MB-OFDM UWB System of Korea (무선 인지 기술(Cognitive Radio using ITMA)을 이용한 국내 환경에 적합한 MB-OFDM UWB 시스템)

  • Kim, Tae-Hun;Kim, Dong-Hee;Jang, Hong-Mo;Nam, Sang-Kyun;Kwak, Kyung-Sup
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.11A
    • /
    • pp.1096-1105
    • /
    • 2007
  • In this paper, we propose a solution on interference problem of MB-OFDM UWB system using cognitive radio. We use interference temperature model of cognitive radio that has proposed by FCC for estimating interference signal. Calculating channel capacity of MB-OFDM UWB system with interference temperature, we suggest how to solve interference problem. We have used genetic algorithm in cognitive engine's calculation process. The proposed MB-OFDM UWB System with cognitive radio shows very efficient in solving interference problem.

Optimum design of steel frame structures considering construction cost and seismic damage

  • Kaveh, A.;Fahimi-Farzam, M.;Kalateh-Ahani, M.
    • Smart Structures and Systems
    • /
    • v.16 no.1
    • /
    • pp.1-26
    • /
    • 2015
  • Minimizing construction cost and reducing seismic damage are two conflicting objectives in the design of any new structure. In the present work, we try to develop a framework in order to solve the optimum performance-based design problem considering the construction cost and the seismic damage of steel moment-frame structures. The Park-Ang damage index is selected as the seismic damage measure because it is one of the most realistic measures of structural damage. The non-dominated sorting genetic algorithm (NSGA-II) is employed as the optimization algorithm to search the Pareto optimal solutions. To improve the time efficiency of the proposed framework, three simplifying strategies are adopted: first, simplified nonlinear modeling investigating minimum level of structural modeling sophistication; second, fitness approximation decreasing the number of fitness function evaluations; third, wavelet decomposition of earthquake record decreasing the number of acceleration points involved in time-history loading. The constraints of the optimization problem are considered in accordance with Federal Emergency Management Agency's (FEMA) recommended seismic design specifications. The results from numerical application of the proposed framework demonstrate the efficiency of the framework in solving the present multi-objective optimization problem.

Numerical solution of beam equation using neural networks and evolutionary optimization tools

  • Babaei, Mehdi;Atasoy, Arman;Hajirasouliha, Iman;Mollaei, Somayeh;Jalilkhani, Maysam
    • Advances in Computational Design
    • /
    • v.7 no.1
    • /
    • pp.1-17
    • /
    • 2022
  • In this study, a new strategy is presented to transmit the fundamental elastic beam problem into the modern optimization platform and solve it by using artificial intelligence (AI) tools. As a practical example, deflection of Euler-Bernoulli beam is mathematically formulated by 2nd-order ordinary differential equations (ODEs) in accordance to the classical beam theory. This fundamental engineer problem is then transmitted from classic formulation to its artificial-intelligence presentation where the behavior of the beam is simulated by using neural networks (NNs). The supervised training strategy is employed in the developed NNs implemented in the heuristic optimization algorithms as the fitness function. Different evolutionary optimization tools such as genetic algorithm (GA) and particle swarm optimization (PSO) are used to solve this non-linear optimization problem. The step-by-step procedure of the proposed method is presented in the form of a practical flowchart. The results indicate that the proposed method of using AI toolsin solving beam ODEs can efficiently lead to accurate solutions with low computational costs, and should prove useful to solve more complex practical applications.

Solving L(2,1)-labeling Problem of Graphs using Genetic Algorithms (유전자 알고리즘을 이용한 그래프에서 L(2,1)-labeling 문제 연구)

  • Han, Keun-Hee;Kim, Chan-Soo
    • The KIPS Transactions:PartB
    • /
    • v.15B no.2
    • /
    • pp.131-136
    • /
    • 2008
  • L(2,1)-labeling of a graph G is a function f: V(G) $\rightarrow$ {0, 1, 2, ...} such that $|f(u)\;-\;f(\upsilon)|\;{\geq}\;2$ when d(u, v) = 1 and $|f(u)\;-\;f(\upsilon)|\;{\geq}\;1$ when d(u, $\upsilon$) = 2. L(2,1)-labeling number of G, denoted by ${\lambda}(G)$, is the smallest number m such that G has an L(2,1)-labeling with no label greater than m. Since this problem has been proved to be NP-complete, in this article, we develop genetic algorithms for L(2,1)-labeling problem and show that the suggested genetic algorithm peforms very efficiently by applying the algorithms to the class of graphs with known optimum values.

A study on the variations of a grouping genetic algorithm for cell formation (셀 구성을 위한 그룹유전자 알고리듬의 변형들에 대한 연구)

  • 이종윤;박양병
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.11a
    • /
    • pp.259-262
    • /
    • 2003
  • Group technology(GT) is a manufacturing philosophy which identifies and exploits the similarity of parts and processes in design and manufacturing. A specific application of GT is cellular manufacturing. the first step in the preliminary stage of cellular manufacturing system design is cell formation, generally known as a machine-part cell formation(MPCF). This paper presents and tests a grouping gentic algorithm(GGA) for solving the MPCF problem and uses the measurements of e(ficacy. GGA's replacement heuristic used similarity coefficients is presented.

  • PDF

Optimal Allocation Planning of Dispersed Generation Systems in Distribution System (배전계통에서 분산형전원의 최적설치 계획)

  • Kim, Kyu-Ho;Lee, Yu-Jeong;Rhee, Sang-Bong;Lee, Sang-Keun;You, Seok-Ku
    • Proceedings of the KIEE Conference
    • /
    • 2002.07a
    • /
    • pp.127-129
    • /
    • 2002
  • This paper presents a fuzzy-GA method to resolve dispersed generator placement for distribution systems. The problem formulation considers an objective to reduce power loss costs of distribution systems and the constraints with the number or size of dispersed generators and the deviation of the bus voltage. The main idea of solving fuzzy nonlinear goal programming is to transform the original objective function and constraints into the equivalent multi-objectives functions with fuzzy sets to evaluate their imprecise nature and solve the problem using the proposed genetic algorithm, without any transformation for this nonlinear problem to a linear model or other methods. The method proposed is applied to the sample systems to demonstrate its effectiveness.

  • PDF

Adaptive Evolutionary Computation to Economic Load Dispatch Problem with Piecewise Quadratic Cost Funcion (구분적인 이차 비용함수를 가진 경제급전 문제에 적응진화연산 적용)

  • Mun, K.J.;Hwang, G.H.;Kim, H.S.;Park, J.H.;Jung, J.W.
    • Proceedings of the KIEE Conference
    • /
    • 1998.07c
    • /
    • pp.844-846
    • /
    • 1998
  • In this study, an adaptive evolutionary computation(AEC), which uses adaptively a genetic algorithm having global searching capability and an evolution strategy having local searching capability with different methodologies, is suggested. This paper develops AEC for solving ELD problem with piecewise quadratic cost function. Numerical results show that the proposed AEC can provide accurate dispatch solutions within reasonable time for the ELD problem with piecewise quadratic cost function.

  • PDF