Showing papers on "Genetic algorithm published in 2008"

Biogeography-Based Optimization

Abstract: Biogeography is the study of the geographical distribution of biological organisms. Mathematical equations that govern the distribution of organisms were first discovered and developed during the 1960s. The mindset of the engineer is that we can learn from nature. This motivates the application of biogeography to optimization problems. Just as the mathematics of biological genetics inspired the development of genetic algorithms (GAs), and the mathematics of biological neurons inspired the development of artificial neural networks, this paper considers the mathematics of biogeography as the basis for the development of a new field: biogeography-based optimization (BBO). We discuss natural biogeography and its mathematics, and then discuss how it can be used to solve optimization problems. We see that BBO has features in common with other biology-based optimization methods, such as GAs and particle swarm optimization (PSO). This makes BBO applicable to many of the same types of problems that GAs and PSO are used for, namely, high-dimension problems with multiple local optima. However, BBO also has some features that are unique among biology-based optimization methods. We demonstrate the performance of BBO on a set of 14 standard benchmarks and compare it with seven other biology-based optimization algorithms. We also demonstrate BBO on a real-world sensor selection problem for aircraft engine health estimation.

Applications of Evolutionary Computing

Abstract: EvoCOMNET Contributions.- Web Application Security through Gene Expression Programming.- Location Discovery in Wireless Sensor Networks Using a Two-Stage Simulated Annealing.- Wireless Communications for Distributed Navigation in Robot Swarms.- An Evolutionary Algorithm for Survivable Virtual Topology Mapping in Optical WDM Networks.- Extremal Optimization as a Viable Means for Mapping in Grids.- Swarm Intelligence Inspired Multicast Routing: An Ant Colony Optimization Approach.- A Framework for Evolutionary Peer-to-Peer Overlay Schemes.- Multiuser Scheduling in HSDPA with Particle Swarm Optimization.- Efficient Signal Processing and Anomaly Detection in Wireless Sensor Networks.- Peer-to-Peer Optimization in Large Unreliable Networks with Branch-and-Bound and Particle Swarms.- Evolving High-Speed, Easy-to-Understand Network Intrusion Detection Rules with Genetic Programming.- Soft Computing Techniques for Internet Backbone Traffic Anomaly Detection.- Testing Detector Parameterization Using Evolutionary Exploit Generation.- Ant Routing with Distributed Geographical Localization of Knowledge in Ad-Hoc Networks.- Discrete Particle Swarm Optimization for Multiple Destination Routing Problems.- EvoENVIRONMENT Contributions.- Combining Back-Propagation and Genetic Algorithms to Train Neural Networks for Ambient Temperature Modeling in Italy.- Estimating the Concentration of Nitrates in Water Samples Using PSO and VNS Approaches.- Optimal Irrigation Scheduling with Evolutionary Algorithms.- Adaptive Land-Use Management in Dynamic Ecological System.- EvoFIN Contributions.- Evolutionary Money Management.- Prediction of Interday Stock Prices Using Developmental and Linear Genetic Programming.- An Introduction to Natural Computing in Finance.- Evolutionary Approaches for Estimating a Coupled Markov Chain Model for Credit Portfolio Risk Management.- Knowledge Patterns in Evolutionary Decision Support Systems for Financial Time Series Analysis.- Predicting Turning Points in Financial Markets with Fuzzy-Evolutionary and Neuro-Evolutionary Modeling.- Comparison of Multi-agent Co-operative Co-evolutionary and Evolutionary Algorithms for Multi-objective Portfolio Optimization.- Dynamic High Frequency Trading: A Neuro-Evolutionary Approach.- EvoGAMES Contributions.- Decay of Invincible Clusters of Cooperators in the Evolutionary Prisoner's Dilemma Game.- Evolutionary Equilibria Detection in Non-cooperative Games.- Coevolution of Competing Agent Species in a Game-Like Environment.- Simulation Minus One Makes a Game.- Evolving Simple Art-Based Games.- Swarming for Games: Immersion in Complex Systems.- Fitness Diversity Parallel Evolution Algorithms in the Turtle Race Game.- Evolving Strategies for Non-player Characters in Unsteady Environments.- Grid Coevolution for Adaptive Simulations: Application to the Building of Opening Books in the Game of Go.- Evolving Teams of Cooperating Agents for Real-Time Strategy Game.- EvoHOT Contributions.- Design Optimization of Radio Frequency Discrete Tuning Varactors.- An Evolutionary Path Planner for Multiple Robot Arms.- Evolutionary Optimization of Number of Gates in PLA Circuits Implemented in VLSI Circuits.- Particle Swarm Optimisation as a Hardware-Oriented Meta-heuristic for Image Analysis.- EvoIASP Contributions.- A Novel GP Approach to Synthesize Vegetation Indices for Soil Erosion Assessment.- Flies Open a Door to SLAM.- Genetic Image Network for Image Classification.- Multiple Network CGP for the Classification of Mammograms.- Evolving Local Descriptor Operators through Genetic Programming.- Evolutionary Optimization for Plasmon-Assisted Lithography.- An Improved Multi-objective Technique for Fuzzy Clustering with Application to IRS Image Segmentation.- EvoINTERACTION Contributions.- Interactive Evolutionary Evaluation through Spatial Partitioning of Fitness Zones.- Fractal Evolver: Interactive Evolutionary Design of Fractals with Grid Computing.- Humorized Computational Intelligence towards User-Adapted Systems with a Sense of Humor.- Innovative Chance Discovery - Extracting Customers' Innovative Concept.- EvoMUSART Contributions.- Evolving Approximate Image Filters.- On the Role of Temporary Storage in Interactive Evolution.- Habitat: Engineering in a Simulated Audible Ecosystem.- The Evolution of Evolutionary Software: Intelligent Rhythm Generation in Kinetic Engine.- Filterscape: Energy Recycling in a Creative Ecosystem.- Evolved Ricochet Compositions.- Life's What You Make: Niche Construction and Evolutionary Art.- Global Expectation-Violation as Fitness Function in Evolutionary Composition.- Composing Using Heterogeneous Cellular Automata.- On the Socialization of Evolutionary Art.- An Evolutionary Music Composer Algorithm for Bass Harmonization.- Generation of Pop-Rock Chord Sequences Using Genetic Algorithms and Variable Neighborhood Search.- Elevated Pitch: Automated Grammatical Evolution of Short Compositions.- A GA-Based Control Strategy to Create Music with a Chaotic System.- Teaching Evolutionary Design Systems by Extending "Context Free".- Artificial Nature: Immersive World Making.- Evolving Indirectly Represented Melodies with Corpus-Based Fitness Evaluation.- Hearing Thinking.- EvoNUM Contributions.- Memetic Variation Local Search vs. Life-Time Learning in Electrical Impedance Tomography.- Estimating HMM Parameters Using Particle Swarm Optimisation.- Modeling Pheromone Dispensers Using Genetic Programming.- NK Landscapes Difficulty and Negative Slope Coefficient: How Sampling Influences the Results.- On the Parallel Speed-Up of Estimation of Multivariate Normal Algorithm and Evolution Strategies.- Adaptability of Algorithms for Real-Valued Optimization.- A Stigmergy-Based Algorithm for Continuous Optimization Tested on Real-Life-Like Environment.- Stochastic Local Search Techniques with Unimodal Continuous Distributions: A Survey.- Evolutionary Optimization Guided by Entropy-Based Discretization.- EvoSTOC Contributions.- The Influence of Population and Memory Sizes on the Evolutionary Algorithm's Performance for Dynamic Environments.- Differential Evolution with Noise Analyzer.- An Immune System Based Genetic Algorithm Using Permutation-Based Dualism for Dynamic Traveling Salesman Problems.- Dynamic Time-Linkage Problems Revisited.- The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation.- Impact of Frequency and Severity on Non-Stationary Optimization Problems.- A Critical Look at Dynamic Multi-dimensional Knapsack Problem Generation.- EvoTRANSLOG Contributions.- Evolutionary Freight Transportation Planning.- An Effective Evolutionary Algorithm for the Cumulative Capacitated Vehicle Routing Problem.- A Corridor Method-Based Algorithm for the Pre-marshalling Problem.- Comparison of Metaheuristic Approaches for Multi-objective Simulation-Based Optimization in Supply Chain Inventory Management.- Heuristic Algorithm for Coordination in Public Transport under Disruptions.- Optimal Co-evolutionary Strategies for the Competitive Maritime Network Design Problem.

A hybrid genetic algorithm and particle swarm optimization for multimodal functions

Abstract: Heuristic optimization provides a robust and efficient approach for solving complex real-world problems. The focus of this research is on a hybrid method combining two heuristic optimization techniques, genetic algorithms (GA) and particle swarm optimization (PSO), for the global optimization of multimodal functions. Denoted as GA-PSO, this hybrid technique incorporates concepts from GA and PSO and creates individuals in a new generation not only by crossover and mutation operations as found in GA but also by mechanisms of PSO. The results of various experimental studies using a suite of 17 multimodal test functions taken from the literature have demonstrated the superiority of the hybrid GA-PSO approach over the other four search techniques in terms of solution quality and convergence rates.

GA-Net: A Genetic Algorithm for Community Detection in Social Networks

Abstract: The problem of community structure detection in complex networks has been intensively investigated in recent years. In this paper we propose a genetic based approach to discover communities in social networks. The algorithm optimizes a simple but efficacious fitness function able to identify densely connected groups of nodes with sparse connections between groups. The method is efficient because the variation operators are modified to take into consideration only the actual correlations among the nodes, thus sensibly reducing the research space of possible solutions. Experiments on synthetic and real life networks show the capability of the method to successfully detect the network structure.

Particle Swarm Optimization and Differential Evolution Algorithms: Technical Analysis, Applications and Hybridization Perspectives

Abstract: Since the beginning of the nineteenth century, a significant evolution in optimization theory has been noticed. Classical linear programming and traditional non-linear optimization techniques such as Lagrange’s Multiplier, Bellman’s principle and Pontyagrin’s principle were prevalent until this century. Unfortunately, these derivative based optimization techniques can no longer be used to determine the optima on rough non-linear surfaces. One solution to this problem has already been put forward by the evolutionary algorithms research community. Genetic algorithm (GA), enunciated by Holland, is one such popular algorithm. This chapter provides two recent algorithms for evolutionary optimization – well known as particle swarm optimization (PSO) and differential evolution (DE). The algorithms are inspired by biological and sociological motivations and can take care of optimality on rough, discontinuous and multimodal surfaces. The chapter explores several schemes for controlling the convergence behaviors of PSO and DE by a judicious selection of their parameters. Special emphasis is given on the hybridizations of PSO and DE algorithms with other soft computing tools. The article finally discusses the mutual synergy of PSO with DE leading to a more powerful global search algorithm and its practical applications.

Comparison of particle swarm optimization and genetic algorithm for FACTS-based controller design

Abstract: Recently, genetic algorithms (GA) and particle swarm optimization (PSO) technique have attracted considerable attention among various modern heuristic optimization techniques. The GA has been popular in academia and the industry mainly because of its intuitiveness, ease of implementation, and the ability to effectively solve highly non-linear, mixed integer optimization problems that are typical of complex engineering systems. PSO technique is a relatively recent heuristic search method whose mechanics are inspired by the swarming or collaborative behavior of biological populations. Since the two approaches are supposed to find a solution to a given objective function but employ different strategies and computational effort, it is appropriate to compare their performance. This paper presents the application and performance comparison of PSO and GA optimization techniques, for flexible ac transmission system (FACTS)-based controller design. The design objective is to enhance the power system stability. The design problem of the FACTS-based controller is formulated as an optimization problem and both PSO and GA optimization techniques are employed to search for optimal controller parameters. The performance of both optimization techniques in terms of computational effort, computational time and convergence rate is compared. Further, the optimized controllers are tested on a weakly connected power system subjected to different disturbances over a wide range of loading conditions and parameter variations and their performance is compared with the conventional power system stabilizer (CPSS). The eigenvalue analysis and non-linear simulation results are presented and compared to show the effectiveness of both the techniques in designing a FACTS-based controller, to enhance power system stability.

Network Models and Optimization: Multiobjective Genetic Algorithm Approach

Abstract: Network models are critical tools in business, management, science and industry. Network Models and Optimization: Multiobjective Genetic Algorithm Approach presents an insightful, comprehensive, and up-to-date treatment of multiple objective genetic algorithms to network optimization problems in many disciplines, such as engineering, computer science, operations research, transportation, telecommunication, and manufacturing. Network Models and Optimization: Multiobjective Genetic Algorithm Approach extensively covers algorithms and applications, including shortest path problems, minimum cost flow problems, maximum flow problems, minimum spanning tree problems, travelling salesman and postman problems, location-allocation problems, project scheduling problems, multistage-based scheduling problems, logistics network problems, communication network problem, and network models in assembly line balancing problems, and airline fleet assignment problems. Network Models and Optimization: Multiobjective Genetic Algorithm Approach can be used both as a student textbook and as a professional reference for practitioners in many disciplines who use network optimization methods to model and solve problems.

A recommender system using GA K-means clustering in an online shopping market

Abstract: The Internet is emerging as a new marketing channel, so understanding the characteristics of online customers' needs and expectations is considered a prerequisite for activating the consumer-oriented electronic commerce market. In this study, we propose a novel clustering algorithm based on genetic algorithms (GAs) to effectively segment the online shopping market. In general, GAs are believed to be effective on NP-complete global optimization problems, and they can provide good near-optimal solutions in reasonable time. Thus, we believe that a clustering technique with GA can provide a way of finding the relevant clusters more effectively. The research in this paper applied K-means clustering whose initial seeds are optimized by GA, which is called GA K-means, to a real-world online shopping market segmentation case. In this study, we compared the results of GA K-means to those of a simple K-means algorithm and self-organizing maps (SOM). The results showed that GA K-means clustering may improve segmentation performance in comparison to other typical clustering algorithms. In addition, our study validated the usefulness of the proposed model as a preprocessing tool for recommendation systems.

A New Evolutionary Algorithm for Solving Many-Objective Optimization Problems

Abstract: In this paper, we focus on the study of evolutionary algorithms for solving multiobjective optimization problems with a large number of objectives. First, a comparative study of a newly developed dynamical multiobjective evolutionary algorithm (DMOEA) and some modern algorithms, such as the indicator-based evolutionary algorithm, multiple single objective Pareto sampling, and nondominated sorting genetic algorithm II, is presented by employing the convergence metric and relative hypervolume metric. For three scalable test problems (namely, DTLZ1, DTLZ2, and DTLZ6), which represent some of the most difficult problems studied in the literature, the DMOEA shows good performance in both converging to the true Pareto-optimal front and maintaining a widely distributed set of solutions. Second, a new definition of optimality (namely, L-optimality) is proposed in this paper, which not only takes into account the number of improved objective values but also considers the values of improved objective functions if all objectives have the same importance. We prove that L-optimal solutions are subsets of Pareto-optimal solutions. Finally, the new algorithm based on L-optimality (namely, MDMOEA) is developed, and simulation and comparative results indicate that well-distributed L-optimal solutions can be obtained by utilizing the MDMOEA but cannot be achieved by applying L-optimality to make a posteriori selection within the huge Pareto nondominated solutions. We can conclude that our new algorithm is suitable to tackle many-objective problems.

Multiobjective optimization for crash safety design of vehicles using stepwise regression model

Abstract: In automotive industry, structural optimization for crashworthiness criteria is of special importance. Due to the high nonlinearities, however, there exists substantial difficulty to obtain accurate continuum or discrete sensitivities. For this reason, metamodel or surrogate model methods have been extensively employed in vehicle design with industry interest. This paper presents a multiobjective optimization procedure for the vehicle design, where the weight, acceleration characteristics and toe-board intrusion are considered as the design objectives. The response surface method with linear and quadratic basis functions is employed to formulate these objectives, in which optimal Latin hypercube sampling and stepwise regression techniques are implemented. In this study, a nondominated sorting genetic algorithm is employed to search for Pareto solution to a full-scale vehicle design problem that undergoes both the full frontal and 40% offset-frontal crashes. The results demonstrate the capability and potential of this procedure in solving the crashworthiness design of vehicles.

AbYSS: Adapting Scatter Search to Multiobjective Optimization

Abstract: We propose the use of a new algorithm to solve multiobjective optimization problems. Our proposal adapts the well-known scatter search template for single-objective optimization to the multiobjective domain. The result is a hybrid metaheuristic algorithm called Archive-Based hYbrid Scatter Search (AbYSS), which follows the scatter search structure but uses mutation and crossover operators from evolutionary algorithms. AbYSS incorporates typical concepts from the multiobjective field, such as Pareto dominance, density estimation, and an external archive to store the nondominated solutions. We evaluate AbYSS with a standard benchmark including both unconstrained and constrained problems, and it is compared with two state-of-the-art multiobjective optimizers, NSGA-II and SPEA2. The results obtained indicate that, according to the benchmark and parameter settings used, AbYSS outperforms the other two algorithms as regards the diversity of the solutions, and it obtains very competitive results according to the convergence to the true Pareto fronts and the hypervolume metric.

Computational Intelligence: Methods and Techniques

Abstract: This book focuses on various techniques of computational intelligence, both single ones and those which form hybrid methods. Those techniques are today commonly applied issues of artificial intelligence, e.g. to process speech and natural language, build expert systems and robots. The first part of the book presents methods of knowledge representation using different techniques, namely the rough sets, type-1 fuzzy sets and type-2 fuzzy sets. Next various neural network architectures are presented and their learning algorithms are derived. Moreover, the family of evolutionary algorithms is discussed, in particular the classical genetic algorithm, evolutionary strategies and genetic programming, including connections between these techniques and neural networks and fuzzy systems. In the last part of the book, various methods of data partitioning and algorithms of automatic data clustering are given and new neuro-fuzzy architectures are studied and compared.

Optimizing Hydropower Reservoir Operation Using Hybrid Genetic Algorithm and Chaos

Abstract: Genetic algorithms (GA) have been widely applied to solve water resources system optimization. With the increase of the complexity and the larger problem scale of water resources system, GAs are most frequently faced with the problems of premature convergence, slow iterations to reach the global optimal solution and getting stuck at a local optimum. A novel chaos genetic algorithm (CGA) based on the chaos optimization algorithm (COA) and genetic algorithm (GA), which makes use of the ergodicity and internal randomness of chaos iterations, is presented to overcome premature local optimum and increase the convergence speed of genetic algorithm. CGA integrates powerful global searching capability of the GA with that of powerful local searching capability of the COA. Two measures are adopted in order to improve the performance of the GA. The first one is the adoption of chaos optimization of the initialization to improve species quality and to maintain the population diversity. The second is the utilization of annealing chaotic mutation operation to replace standard mutation operator in order to avoid the search being trapped in local optimum. The Rosenbrock function and Schaffer function, which are complex and global optimum functions and often used as benchmarks for contemporary optimization algorithms for GAs and Evolutionary computation, are first employed to examine the performance of the GA and CGA. The test results indicate that CGA can improve convergence speed and solution accuracy. Furthermore, the developed model is applied for the monthly operation of a hydropower reservoir with a series of monthly inflow of 38 years. The results show that the long term average annual energy based CGA is the best and its convergent speed not only is faster than dynamic programming largely, but also overpasses the standard GA. Thus, the proposed approach is feasible and effective in optimal operations of complex reservoir systems.

Population-Based Incremental Learning With Associative Memory for Dynamic Environments

Abstract: In recent years, interest in studying evolutionary algorithms (EAs) for dynamic optimization problems (DOPs) has grown due to its importance in real-world applications. Several approaches, such as the memory and multiple population schemes, have been developed for EAs to address dynamic problems. This paper investigates the application of the memory scheme for population-based incremental learning (PBIL) algorithms, a class of EAs, for DOPs. A PBIL-specific associative memory scheme, which stores best solutions as well as corresponding environmental information in the memory, is investigated to improve its adaptability in dynamic environments. In this paper, the interactions between the memory scheme and random immigrants, multipopulation, and restart schemes for PBILs in dynamic environments are investigated. In order to better test the performance of memory schemes for PBILs and other EAs in dynamic environments, this paper also proposes a dynamic environment generator that can systematically generate dynamic environments of different difficulty with respect to memory schemes. Using this generator, a series of dynamic environments are generated and experiments are carried out to compare the performance of investigated algorithms. The experimental results show that the proposed memory scheme is efficient for PBILs in dynamic environments and also indicate that different interactions exist between the memory scheme and random immigrants, multipopulation schemes for PBILs in different dynamic environments.

Optimum design of steel frames using harmony search algorithm

Abstract: In this article, harmony search algorithm was developed for optimum design of steel frames. Harmony search is a meta-heuristic search method that has been developed recently. It bases on the analogy between the performance process of natural music and searching for solutions to optimization problems. The objective of the design algorithm is to obtain minimum weight frames by selecting suitable sections from a standard set of steel sections such as American Institute of Steel Construction (AISC) wide-flange (W) shapes. Strength constraints of AISC load and resistance factor design specification and displacement constraints were imposed on frames. The effectiveness and robustness of harmony search algorithm, in comparison with genetic algorithm and ant colony optimization-based methods, were verified using three steel frames. The comparisons showed that the harmony search algorithm yielded lighter designs.

Multiobjective, Multiconstraint Service Restoration of Electric Power Distribution System With Priority Customers

Abstract: In this paper, a technique based on nondominated sorting genetic algorithm-II (NSGA-II) is presented for solving the service restoration problem in an electric power distribution system. Due to the presence of various conflicting objective functions and constraints, the service restoration task is a multiobjective, multiconstraint optimization problem. In contrast to the conventional genetic-algorithm (GA)-based approach, this approach does not require weighting factors for the conversion of such a multiobjective optimization problem into an equivalent single objective function optimization problem. In this work, various practical distribution system operation issues, such as the presence of priority customers, presence of remotely controlled, as well as manually controlled switches, etc. have also been considered. Based on the simulation results on four different distribution systems, the performance of the NSGA-II-based scheme has been found to be significantly better than that of a conventional GA-based method. Besides, to reduce the software runtime of the NSGA-II algorithm, a faster version of NSGA-II has also been implemented.

Genetic algorithms with memory-and elitism-based immigrants in dynamic environments

Abstract: In recent years the genetic algorithm community has shown a growing interest in studying dynamic optimization problems. Several approaches have been devised. The random immigrants and memory schemes are two major ones. The random immigrants scheme addresses dynamic environments by maintaining the population diversity while the memory scheme aims to adapt genetic algorithms quickly to new environments by reusing historical information. This paper investigates a hybrid memory and random immigrants scheme, called memory-based immigrants, and a hybrid elitism and random immigrants scheme, called elitism-based immigrants, for genetic algorithms in dynamic environments. In these schemes, the best individual from memory or the elite from the previous generation is retrieved as the base to create immigrants into the population by mutation. This way, not only can diversity be maintained but it is done more efficiently to adapt genetic algorithms to the current environment. Based on a series of systematically constructed dynamic problems, experiments are carried out to compare genetic algorithms with the memory-based and elitism-based immigrants schemes against genetic algorithms with traditional memory and random immigrants schemes and a hybrid memory and multi-population scheme. The sensitivity analysis regarding some key parameters is also carried out. Experimental results show that the memory-based and elitism-based immigrants schemes efficiently improve the performance of genetic algorithms in dynamic environments.

A Mobile Robot Path Planning Using Genetic Algorithm in Static Environment

Abstract: In this study we present our initial idea for using genetic algorithms to help a controllable mobile robot to find an optimal path between a starting and ending point in a grid environment. The mobile robot has to find the optimal path which reduces the number of steps to be taken between the starting point and the target ending point. GAs can overcome many problems encountered by traditional search techniques such as the gradient based methods. The proposed controlling algorithm allows four-neighbor movements, so that path-planning can adapt with complicated search spaces with low complexities. The results are promising.

Radial Network Reconfiguration Using Genetic Algorithm Based on the Matroid Theory

Abstract: This paper deals with distribution network (DN) reconfiguration for loss minimization. To solve this combinatorial problem, a genetic algorithm (GA) is considered. In order to enhance its ability to explore the solution space, efficient genetic operators are developed. After a survey of the existing DN topology description methods, a theoretical approach based on the graph and matroid theories (graphic matroid in particular) is considered. These concepts are used in order to propose new intelligent and effective GA operators for efficient mutation and crossover well dedicated to the DN reconfiguration problem. All resulting individuals after GA operators are claimed to be feasible (radial) configurations. Moreover, the presented approach is valid for planar or nonplanar DN graph topologies and avoids tedious mesh checks for the topology constraint validation. The proposed method is finally compared to some previous topology coding techniques used by other authors. The results show smaller or at least equal power losses with considerably less computation effort.

Genetic algorithm with ant colony optimization (GA-ACO) for multiple sequence alignment

Abstract: Multiple sequence alignment, known as NP-complete problem, is among the most important and challenging tasks in computational biology. For multiple sequence alignment, it is difficult to solve this type of problems directly and always results in exponential complexity. In this paper, we present a novel algorithm of genetic algorithm with ant colony optimization for multiple sequence alignment. The proposed GA-ACO algorithm is to enhance the performance of genetic algorithm (GA) by incorporating local search, ant colony optimization (ACO), for multiple sequence alignment. In the proposed GA-ACO algorithm, genetic algorithm is conducted to provide the diversity of alignments. Thereafter, ant colony optimization is performed to move out of local optima. From simulation results, it is shown that the proposed GA-ACO algorithm has superior performance when compared to other existing algorithms.