• Title/Summary/Keyword: Hybrid Genetic Algorithm

Search Result 416, Processing Time 0.025 seconds

The Maximum Scatter Travelling Salesman Problem: A Hybrid Genetic Algorithm

  • Zakir Hussain Ahmed;Asaad Shakir Hameed;Modhi Lafta Mutar;Mohammed F. Alrifaie;Mundher Mohammed Taresh
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.6
    • /
    • pp.193-201
    • /
    • 2023
  • In this paper, we consider the maximum scatter traveling salesman problem (MSTSP), a travelling salesman problem (TSP) variant. The problem aims to maximize the minimum length edge in a salesman's tour that travels each city only once in a network. It is a very complicated NP-hard problem, and hence, exact solutions can be found for small sized problems only. For large-sized problems, heuristic algorithms must be applied, and genetic algorithms (GAs) are found to be very successfully to deal with such problems. So, this paper develops a hybrid GA (HGA) for solving the problem. Our proposed HGA uses sequential sampling algorithm along with 2-opt search for initial population generation, sequential constructive crossover, adaptive mutation, randomly selected one of three local search approaches, and the partially mapped crossover along with swap mutation for perturbation procedure to find better quality solution to the MSTSP. Finally, the suggested HGA is compared with a state-of-art algorithm by solving some TSPLIB symmetric instances of many sizes. Our computational experience reveals that the suggested HGA is better. Further, we provide solutions to some asymmetric TSPLIB instances of many sizes.

Automatic generation of Fuzzy Parameters Using Genetic and gradient Optimization Techniques (유전과 기울기 최적화기법을 이용한 퍼지 파라메터의 자동 생성)

  • Ryoo, Dong-Wan;La, Kyung-Taek;Chun, Soon-Yong;Seo, Bo-Hyeok
    • Proceedings of the KIEE Conference
    • /
    • 1998.07b
    • /
    • pp.515-518
    • /
    • 1998
  • This paper proposes a new hybrid algorithm for auto-tuning fuzzy controllers improving the performance. The presented algorithm estimates automatically the optimal values of membership functions, fuzzy rules, and scaling factors for fuzzy controllers, using a genetic-MGM algorithm. The object of the proposed algorithm is to promote search efficiency by a genetic and modified gradient optimization techniques. The proposed genetic and MGM algorithm is based on both the standard genetic algorithm and a gradient method. If a maximum point don't be changed around an optimal value at the end of performance during given generation, the genetic-MGM algorithm searches for an optimal value using the initial value which has maximum point by converting the genetic algorithms into the MGM(Modified Gradient Method) algorithms that reduced the number of variables. Using this algorithm is not only that the computing time is faster than genetic algorithm as reducing the number of variables, but also that can overcome the disadvantage of genetic algorithms. Simulation results verify the validity of the presented method.

  • PDF

Real-Time Power-Saving Scheduling Based on Genetic Algorithms in Multi-core Hybrid Memory Environments (멀티코어 이기종메모리 환경에서의 유전 알고리즘 기반 실시간 전력 절감 스케줄링)

  • Yoo, Suhyeon;Jo, Yewon;Cho, Kyung-Woon;Bahn, Hyokyung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.1
    • /
    • pp.135-140
    • /
    • 2020
  • Recently, due to the rapid diffusion of intelligent systems and IoT technologies, power saving techniques in real-time embedded systems has become important. In this paper, we propose P-GA (Parallel Genetic Algorithm), a scheduling algorithm aims at reducing the power consumption of real-time systems in multi-core hybrid memory environments. P-GA improves the Proportional-Fairness (PF) algorithm devised for multi-core environments by combining the dynamic voltage/frequency scaling of the processor with the nonvolatile memory technologies. Specifically, P-GA applies genetic algorithms for optimizing the voltage and frequency modes of processors and the memory types, thereby minimizing the power consumptions of the task set. Simulation experiments show that the power consumption of P-GA is reduced by 2.85 times compared to the conventional schemes.

Study of Neural Network Training Algorithm Comparison and Prediction of Unsteady Aerodynamic Forces of 2D Airfoil (신경망 학습알고리즘의 비교와 2차원 익형의 비정상 공력하중 예측기법에 관한 연구)

  • Kang, Seung-On;Jun, Sang-Ook;Park, Kyung-Hyun;Jeon, Yong-Hee;Lee, Dong-Ho
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.37 no.5
    • /
    • pp.425-432
    • /
    • 2009
  • In this study, the ability of neural network in modeling and predicting of the unsteady aerodynamic force coefficients of 2D airfoil with the data obtained from Euler CFD code has been confirmed. Neural network models are constructed based on supervised training process using Levenberg-Marquardt algorithm, combining this into genetic algorithm, hybrid genetic algorithm and the efficiency of the two cases are analyzed and compared. It is shown that hybrid-genetic algorithm is more efficient for neural network of complex system and the predicted properties of the unsteady aerodynamic force coefficients of 2D airfoil by the neural network models are confirmed to be similar to that of the numerical results and verified as suitable representing reduced models.

Optimal lay-up of hybrid composite beams, plates and shells using cellular genetic algorithm

  • Rajasekaran, S.;Nalinaa, K.;Greeshma, S.;Poornima, N.S.;Kumar, V. Vinoop
    • Structural Engineering and Mechanics
    • /
    • v.16 no.5
    • /
    • pp.557-580
    • /
    • 2003
  • Laminated composite structures find wide range of applications in many branches of technology. They are much suited for weight sensitive structures (like aircraft) where thinner and lighter members made of advanced fiber reinforced composite materials are used. The orientations of fiber direction in layers and number of layers and the thickness of the layers as well as material of composites play a major role in determining the strength and stiffness. Thus the basic design problem is to determine the optimum stacking sequence in terms of laminate thickness, material and fiber orientation. In this paper, a new optimization technique called Cellular Automata (CA) has been combined with Genetic Algorithm (GA) to develop a different search and optimization algorithm, known as Cellular Genetic Algorithm (CGA), which considers the laminate thickness, angle of fiber orientation and the fiber material as discrete variables. This CGA has been successfully applied to obtain the optimal fiber orientation, thickness and material lay-up for multi-layered composite hybrid beams plates and shells subjected to static buckling and dynamic constraints.

A study on production and distribution planning problems using hybrid genetic algorithm (유전 알고리즘을 이용한 생산 및 분배 계획)

  • 정성원;장양자;박진우
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.26 no.4
    • /
    • pp.133-141
    • /
    • 2001
  • Rapid development in computer and network technology these days has created in environment in which decisions for manufacturing companies can be made in a much broader perspective. Especially, better decisions on production and distribution planning(PDP) problems can be made laking advantage of real time information from all the parties concerned. However, since the PDP problem-a core part of the supply chain management- is known to be the so-called NP-hard problem, so heuristic methods are dominantly used to find out solutions in a reasonable time. As one of those heuristic techniques, many previous studios considered genetic a1gorithms. A standard genetic a1gorithm applies rules of reproduction, gene crossover, and mutation to the pseudo-organisms so the organisms can pass along beneficial and survival-enhancing trails to a new generation. When it comes to representing a chromosome on the problem, it is hard to guarantee an evolution of solutions through classic a1gorithm operations alone, for there exists a strong epitasis among genes. To resolve this problem, we propose a hybrid genetic a1gorithm based on Silver-Meal heuristic. Using IMS-TB(Intelligent Manufacturing System Test-bed) problem sets. the good performance of the proposed a1gorithm is demonstrated.

  • PDF

Reliability Optimization Problems using Adaptive Hybrid Genetic Algorithms

  • Minoru Mukuda;Yun, Young-Su;Mitsuo Gen
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.179-182
    • /
    • 2003
  • This paper proposes an adaptive hybrid genetic algorithm (aHGA) for effectively solving the complex reliability optimization problems. The proposed aHGA uses a loca1 search technique and an adaptive scheme for respectively constructing hybrid algorithm and adaptive ability. For more various comparisons with the proposed adaptive algorithm, other aHGAs with conventional adaptive schemes are considered. These aHGAs are tested and analyzed using two complex reliability optimization problems. Numerical result shows that the proposed aHGA outperforms the other competing aHGAs.

  • PDF

Alsat-2B/Sentinel-2 Imagery Classification Using the Hybrid Pigeon Inspired Optimization Algorithm

  • Arezki, Dounia;Fizazi, Hadria
    • Journal of Information Processing Systems
    • /
    • v.17 no.4
    • /
    • pp.690-706
    • /
    • 2021
  • Classification is a substantial operation in data mining, and each element is distributed taking into account its feature values in the corresponding class. Metaheuristics have been widely used in attempts to solve satellite image classification problems. This article proposes a hybrid approach, the flower pigeons-inspired optimization algorithm (FPIO), and the local search method of the flower pollination algorithm is integrated into the pigeon-inspired algorithm. The efficiency and power of the proposed FPIO approach are displayed with a series of images, supported by computational results that demonstrate the cogency of the proposed classification method on satellite imagery. For this work, the Davies-Bouldin Index is used as an objective function. FPIO is applied to different types of images (synthetic, Alsat-2B, and Sentinel-2). Moreover, a comparative experiment between FPIO and the genetic algorithm genetic algorithm is conducted. Experimental results showed that GA outperformed FPIO in matters of time computing. However, FPIO provided better quality results with less confusion. The overall experimental results demonstrate that the proposed approach is an efficient method for satellite imagery classification.

The optimization of fuzzy neural network using genetic algorithms and its application to the prediction of the chaotic time series data (유전 알고리듬을 이용한 퍼지 신경망의 최적화 및 혼돈 시계열 데이터 예측에의 응용)

  • Jang, Wook;Kwon, Oh-Gook;Joo, Young-Hoon;Yoon, Tae-Sung;Park, Jin-Bae
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.708-711
    • /
    • 1997
  • This paper proposes the hybrid algorithm for the optimization of the structure and parameters of the fuzzy neural networks by genetic algorithms (GA) to improve the behaviour and the design of fuzzy neural networks. Fuzzy neural networks have a distinguishing feature in that they can possess the advantage of both neural networks and fuzzy systems. In this way, we can bring the low-level learning and computational power of neural networks into fuzzy systems and also high-level, human like IF-THEN rule thinking and reasoning of fuzzy systems into neural networks. As a result, there are many research works concerning the optimization of the structure and parameters of fuzzy neural networks. In this paper, we propose the hybrid algorithm that can optimize both the structure and parameters of fuzzy neural networks. Numerical example is provided to show the advantages of the proposed method.

  • PDF

Comparison of Regularization Techniques For an Inverse Radiation Boundary Analysis (역복사경계해석을 위한 다양한 조정기법 비교)

  • Kim, Ki-Wan;Baek, Seung-Wook
    • Proceedings of the KSME Conference
    • /
    • 2004.11a
    • /
    • pp.1288-1293
    • /
    • 2004
  • Inverse radiation problems are solved for estimating the boundary conditions such as temperature distribution and wall emissivity in axisymmetric absorbing, emitting and scattering medium, given the measured incident radiative heat fluxes. Various regularization methods, such as hybrid genetic algorithm, conjugate-gradient method and Newton method, were adopted to solve the inverse problem, while discussing their features in terms of estimation accuracy and computational efficiency. Additionally, we propose a new combined approach of adopting the genetic algorithm as an initial value selector, whereas using the conjugate-gradient method and Newton method to reduce their dependence on the initial value.

  • PDF