Mechanical sizing of a composite launcher structure by hybridizing a genetic algorithm with a local search method

A hybrid genetic local search algorithm for the permutation flowshop scheduling problem

We aim to suggest a simple genetic algorithm (GA) and other four hybrid GAs (HGAs) for solving the asymmetric distance-constrained vehicle routing problem (ADVRP), a variant of vehicle routing problem (VRP). The VRP is a difficult NP-hard optimization problem that has numerous real-life applications. The VRP aims to find an optimal tour that has least total distance (or cost) to provide service to n customers (or nodes or cities) utilizing m vehicles so that every vehicle starts journey from and ends journey at a depot (headquarters) and visits every customer only once. The problem has many variations, and we consider the ADVRP for this study, where distance traveled by every vehicle must not exceed a predefined maximum distance. The proposed GA uses random initial population followed by sequential constructive crossover and swap mutation. The HGAs enhance the initial solution using 2-opt search method and incorporate a local search technique along with an immigration procedure to obtain effective solution to the ADVRP. Experiments have been conducted among the suggested GAs by solving several restricted and unrestricted ADVRP instances on asymmetric TSPLIB utilizing several vehicles. Our experiments claim that the suggested HGAs using local search methods are very effective. Finally, we reported a comparative study between our best HGA and a state-of-the-art algorithm on asymmetric capacitated VRP and found that our algorithm is better than the state-of-the-art algorithm for the instances.

The multiobjective time-dependent route planning problem is a hard multiobjective combinatorial optimization problem. Metaheuristics showed success in solving many hard optimization problems and recently many efforts have been directed to hybridize elements from different metaheuristics and search methods. The hybridization of genetic algorithms and local search methods proved to be successful in many domains. In this paper we present a genetic local search algorithm for solving the multiobjective time-dependent route planning problem taking the multiobjective route planning in dynamic multihop ridesharing as an example problem. The behavior of the proposed algorithm is compared, on two problem instances using a set of widely used quality indicators, with the behavior of a genetic algorithm proposed for solving the same problem. Experimentation results indicated that the proposed algorithm outperforms the genetic algorithm regarding all quality indicators.

Based on an output error, several evolutionary methods have been applied to identify the parameters of an Induction Machine (IM). The main drawback of these methods is their premature convergence in many situations. To overcome this issue and achieve a more accurate solution, this paper proposes a Memetic Algorithm (MA), which combines a Genetic Algorithm (GA) and a local search method. This approach uses the Hooke-Jeeves (HJ) method for the local search as a mutation operator.GA has proven good ability in global search. The HJ method has a good ability to refine the local search and achieve the optimal accuracy solution. The proposed MA, which maintains a tradeoff between exploration and exploitation strategies, is applied to minimize the related objective function to obtain the electrical and mechanical machine parameters. The validation of the method is confirmed by an experiment carried out on an (0.4 kW) IM with parameters estimated using the measured data. Using the estimated parameters, the computed transient and steady-state currents agree well with the measured data.

Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimensional optimization problems are an interesting field of research. The high dimensionality introduces new problems for the optimization process, making recommendable to test the behavior of the optimization algorithms to large-scale problems. The local search method must be applied with a higher intensity, specially to most promising solutions, to explore the higher domain space around each solution. In this work, we present a preliminar study of a memetic algorithm that assigns to each individual a local search intensity that depends on its features, by chaining different local search applications. This algorithm have obtained good results in continuous optimization and we study whether is a good algorithm for large scale optimizations problems. We make experiments of our proposal using the benchmark problems defined in the Special Session or Competition on Large Scale Global Optimisation, on the IEEE Congress on Evolutionary Computation in 2008. First, we test different local search methods to identify the best one. Then, we compare the proposed algorithm with the algorithms used into the competition, obtaining that our proposal is a very promising algorithm for this type of high-dimensional problems: with dimension 500 our proposal is the second best of the compared algorithms, and the best memetic algorithm.

The traditional single intelligent algorithm has slow convergence speed in the frequency assignment, and the effect cannot meet the increasing frequency equipment in the naval battlefield. Based on the single intelligent frequency assignment algorithm and the frequency conflict analysis model between systems, this paper proposes three heuristic frequency assignment algorithms based on hybrid genetic algorithms, namely, Genetic Algorithm and Tabu Search (GATS), Hybrid Genetic Simulated Annealing Algorithm (HGSAA) and Genetic Algorithm-ant Colony Algorithm (GAA). The simulation results show that the hybrid algorithm can quickly converge to a better allocation result than the single intelligent algorithm in the frequency assignment problem, and the optimal value is better than the single intelligent algorithm. Among them, the convergence speed and optimal value of the GAA are the best of the three algorithms. Therefore, this algorithm can be applied to frequency assignment with more frequency-using equipment within a fixed range.

PurposeThe paper aims to present a new methodology for hybrid genetic algorithms (GA) in the solution of electromagnetic optimization problems.Design/methodology/approachThis methodology can be seen as a local search operator which uses local quadratic approximations for each objective and constraint function in the problem. In the local search phase, these approximations define an associated local search problem that is efficiently solved using a formulation based on linear matrix inequalities.FindingsThe paper illustrates the proposed methodology comparing the performance of the hybrid GA against the basic GA in two analytical problems and in the well‐known TEAM benchmark Problem 22. For the analytical problems, 30 independent runs for each algorithm were considered whereas for Problem 22, ten independent runs for each algorithm were taken.Research limitations/implicationsFor the analytical problems, the hybrid GA enhanced both the convergence speed, in terms of the number of function evaluations, and the accuracy of the final result. For Problem 22, the hybrid GA was able to reach a better solution, with a better value of the standard deviation with less CPU time.Practical implicationsThe paper could be useful both for device designers and researchers involved optimization in computational electromagnetics.Originality/valueThe hybrid GA proposed enhanced the convergence speed, in terms of the number of function evaluations, representing a faster and robust algorithm for practical optimization problems.

Robust face alignment and tracking by combining local search and global fitting

Shapes extraction methods for getting two or more characters in convex hull or approximate convex hull are proposed in this paper. Proposed approaches use Genetic Algorithm (GA) with a improved local search or new local search method, which can get some characters as a shrink-wrapping from convex hull or approximate convex hull. The test problems are newly provided, which are made of the original problems in previous study. After obtaining convex hull or approximate convex hull, a local search method is applied to get the shape of objects in the hull. The experimental results show that proposed local search methods get the shape of objects with success.

In the paper we present a new method for solving optimal control problems of a class of hybrid systems. We describe the new effective algorithm based on memetic algorithm (MA) for optimal control of switched systems. We concentrate on a class of problems in which a pre-specified sequence of active subsystems is known. Our aim is to find both the optimal switching instants and the optimal continuous inputs. The new approach, which we propose, decomposes the cost functional of the basic optimal control problem in Bolza form in two terms. The first term depends explicitly on a value of state variables at the final time. The second term depends on state and control trajectories. In oreder to solve those two tasks we used MA as the multi-objective optimization algorithm. In this paper we considered a fundamental bi-criteria case with two mentioned before functions: the value of state variables at the final time and the state and control trajectories. In order to find an approximation of Pareto frontier, we proposed new effective method based on genetic algorithm (GA) and local search (LS). Problems properties were taken into consideration in the design of our new approach of solving it. They were used to construct new algorithm inspired by the LS NSGA-II, which performed rather well in multi-criteria scheduling problem. Since simple genetic algorithms are efficient heuristics in searching for optimal solutions, but lack the accuracy of some more computational complex algorithms, a hybrid algorithm was constructed. It uses fast non-dominated sorting, in order to evaluate child population and allocate solutions to corresponding Pareto frontiers. I addition a local search method was used, in order to find more differentiated and better solutions. Clustering solutions from Pareto frontiers also improved diversity of solutions in child population. This approach can be used as a start point for searching for algorithm for solving optimal control problems of switched systems without pre-specified sequence of active subsystems. The performance of the algorithm is illustrated by the examples: (a) a hybrid optimal control problem with nonlinear dynamics and (b) a switched linear quadratic optimal control problem with long switching time intervals.

Communities have proven to be one of the important topological features of complex networks and can be discovered in various aspects of life. Understanding these community structures help the researchers to unlock distinct characteristics of networks that are not visible otherwise. In this paper, a hybrid genetic algorithm with link strength-based local search strategy (HGALS) is proposed for solving the community detection problem. The local search method presented in the algorithm is faster than the traditional modularity-based search operations. Furthermore, different variants of link strength measures are used in the local search method that is useful for various types of complex networks. The HGALS algorithm is analysed using different community structure metrics and its outcome is compared with three evolutionary algorithms and seven non-evolutionary algorithm-based approaches. The results thus obtained from the comparisons with other algorithms show good performances of HGALS in most of the cases for identifying better community structures.

This paper describes the vibration optimum design for the low-pressure steam-turbine rotor of a 1007-MW nuclear power plant by using a hybrid genetic algorithm (HGA) that combines a genetic algorithm and a local concentration search algorithm using a modified simplex method. This algorithm not only calculates the optimum solution faster and more accurately than the standard genetic algorithm but can also find the global and local optimum solutions. The objective function is to minimize the resonance response (Q-factor) of the second occurring mode in the excessive vibration. Under the constraints of shaft diameter, bearing length and clearance, these factors play a very important role in the design of a rotor-bearing system. In the present work, the shaft diameter, bearing length and clearance are chosen as the design variables. The results show that the HGA can reduce the excessive response at the critical speed and improve the stability.

This paper presents an automated optimal design method using a hybrid genetic algorithm for pile group foundation design. The design process is a sizing and topology optimization for pile foundations. The objective is to minimize the material volume of the foundation taking the configuration, number, and cross-sectional dimensions of the piles as well as the thickness of the pile cap as design variables. A local search operator by the fully stressed design (FSD) approach is incorporated into a genetic algorithm (GA) to tackle two major shortcomings of a GA, namely, large computation effort in searching the optimum design and poor local search capability. The effectiveness and capability of the proposed algorithm are first illustrated by a five by five pile group subjected to different loading conditions. The proposed optimization algorithm is then applied to a large-scale foundation project to demonstrate the practicality of the algorithm. The proposed hybrid genetic algorithm successfully minimizes the volume of material consumption and the result matches the engineering expectation. The FSD operator has great improvement on both design quality and convergence rate. Challenges encountered in the application of optimization techniques to design of pile groups consisting of hundreds of piles are discussed.

Parameter identification is the process of constructing the mathematical model of a dynamic system based on measured dynamic responses. A non-classical search method namely genetic algorithm (GA) is employed in this study, which has several advantages over classical system identification techniques. Nevertheless, direct application of GA does not necessarily work well, particularly with regards to computational efficiency in fine-tuning when the solution approaches the optimal value. Thus, a local search (LS) method is introduced into the GA approach to improve this capability. Numerical example of a cantilever beam is presented to show the efficiency of the combined GA and LS method (GA-LS). The FE model of the cantilever beam is established with 10 beam elements. In this example, only the element properties associated with flapping motion are identified. The GA-LS method gives much better results than the GA method does. The mean error is reduced to 5.3% from 14.9% while to 14.5% from 47.2% for the maximum individual error. It is concluded that the GA-LS method is a more efficient search method than the GA method. The GA-LS method is then applied to identify the mass and stiffness parameters of a model helicopter blade using measured excitations and accelerations in this paper. Since the mass and stiffness of the model helicopter blade are not available, the only way to verify the identified parameters is to compare the ffequencies and mode shapes calculated from the identified parameters and the measured frequencies and modal shapes of the actual blade. The mean eiror of the frequencies is 0.9% and the maximum individual error 2.4%. The sequence of identified mode shapes is the same with measured mode shapes. Transactions on Engineering Sciences vol 43, © 2003 WIT Press, www.witpress.com, ISSN 1743-3533

Node placement problems have been long investigated in the optimization field due to numerous applications in facility location, logistics, services, etc. Such problems are attracting again the attention of researchers now from the networking domain, and more especially from Wireless Mesh Networks (WMNs) field. Indeed, the placement of mesh routers nodes appears to be crucial for the performance and operability of WMNs, in terms of network connectivity and stability. However, node placement problems are known for their hardness in solving them to optimality, and therefore heuristics methods are approached to near-optimally solve such problems. In this work we evaluate the performance of different heuristic methods in order to judge on their suitability of solving mesh router nodes problem. We have selected methods from two different families, namely, local search methods (Hill Climbing and Simulated Annealing) and population-based methods (Genetic Algorithms). The former are known for their capability to exploit the solution space by constructing a path of visited solutions, while the later methods use a population of individuals aiming to largely explore the solution space. In both cases, a bi-objective optimization consisting in the maximization of the size of the giant component in the mesh routers network (for measuring network connectivity) and that of user coverage are considered. In the experimental evaluation, we have used a benchmark of instances--varying from small to large size--generated using different distributions of mesh node clients (Uniform, Normal, Exponential and Weibull).