2,190 research outputs found

    Chaotic particle swarm optimization with neural network structure and its application

    Get PDF
    Abstract: A new particle swarm optimization (PSO) algorithm having a chaotic Hopfield Neural Network (HNN) structure is proposed. Particles exhibit chaotic behaviour before converging to a stable fixed point which is determined by the best points found by the individual particles and the swarm. During the evolutionary process, the chaotic search expands the search space of individual particles. Using a chaotic system to determine particle weights helps the PSO to escape from the local extreme and find the global optimum. The algorithm is applied to some benchmark problems and a pressure vessel problem with nonlinear constraints. The results show that the proposed algorithm consistently outperforms rival algorithms by enhancing search efficiency and improving search qualit

    Optimal design of a quadratic parameter varying vehicle suspension system using contrast-based Fruit Fly Optimisation

    Get PDF
    In the UK, in 2014 almost fifty thousand motorists made claims about vehicle damages caused by potholes. Pothole damage mitigation has become so important that a number of car manufacturers have officially designated it as one of their priorities. The objective is to improve suspension shock performance without degrading road holding and ride comfort. In this study, it is shown that significant improvement in performance is achieved if a clipped quadratic parameter varying suspension is employed. Optimal design of the proposed system is challenging because of the multiple local minima causing global optimisation algorithms to get trapped at local minima, located far from the optimum solution. To this end an enhanced Fruit Fly Optimisation Algorithm − based on a recent study on how well a fruit fly’s tiny brain finds food − was developed. The new algorithm is first evaluated using standard and nonstandard benchmark tests and then applied to the computationally expensive suspension design problem. The proposed algorithm is simple to use, robust and well suited for the solution of highly nonlinear problems. For the suspension design problem new insight is gained, leading to optimum damping profiles as a function of excitation level and rattle space velocity

    Binary Structuring Elements Decomposition Based on an Improved Recursive Dilation-Union Model and RSAPSO Method

    Get PDF
    This paper proposed an improved approach to decompose structuring elements of an arbitrary shape. For the model of this method, we use an improved dilation-union model, adding a new termination criterion, as the sum of 3-by-3 matrix should be less than 5. Next for the algorithm of this method, we introduced in the restarted simulated annealing particle swarm optimization method. The experiments demonstrate that our method can find better results than Park's method, Anelli's method, Shih's SGA method, and Zhang's MFSGA method. Besides, our method gave the best decomposition tree of different SE shapes including “ship,” “car,” “heart,” “umbrella,” “vase,” “tree,” “cat,” “V,” “bomb,” and “cup.

    Traveling Salesman Problem

    Get PDF
    The idea behind TSP was conceived by Austrian mathematician Karl Menger in mid 1930s who invited the research community to consider a problem from the everyday life from a mathematical point of view. A traveling salesman has to visit exactly once each one of a list of m cities and then return to the home city. He knows the cost of traveling from any city i to any other city j. Thus, which is the tour of least possible cost the salesman can take? In this book the problem of finding algorithmic technique leading to good/optimal solutions for TSP (or for some other strictly related problems) is considered. TSP is a very attractive problem for the research community because it arises as a natural subproblem in many applications concerning the every day life. Indeed, each application, in which an optimal ordering of a number of items has to be chosen in a way that the total cost of a solution is determined by adding up the costs arising from two successively items, can be modelled as a TSP instance. Thus, studying TSP can never be considered as an abstract research with no real importance

    Soft Computing Techiniques for the Protein Folding Problem on High Performance Computing Architectures

    Get PDF
    The protein-folding problem has been extensively studied during the last fifty years. The understanding of the dynamics of global shape of a protein and the influence on its biological function can help us to discover new and more effective drugs to deal with diseases of pharmacological relevance. Different computational approaches have been developed by different researchers in order to foresee the threedimensional arrangement of atoms of proteins from their sequences. However, the computational complexity of this problem makes mandatory the search for new models, novel algorithmic strategies and hardware platforms that provide solutions in a reasonable time frame. We present in this revision work the past and last tendencies regarding protein folding simulations from both perspectives; hardware and software. Of particular interest to us are both the use of inexact solutions to this computationally hard problem as well as which hardware platforms have been used for running this kind of Soft Computing techniques.This work is jointly supported by the FundaciónSéneca (Agencia Regional de Ciencia y Tecnología, Región de Murcia) under grants 15290/PI/2010 and 18946/JLI/13, by the Spanish MEC and European Commission FEDER under grant with reference TEC2012-37945-C02-02 and TIN2012-31345, by the Nils Coordinated Mobility under grant 012-ABEL-CM-2014A, in part financed by the European Regional Development Fund (ERDF). We also thank NVIDIA for hardware donation within UCAM GPU educational and research centers.Ingeniería, Industria y Construcció

    Controlled hydrodynamic conditions on the formation of iron oxide nanostructures synthesized by electrochemical anodization: Effect of the electrode rotation speed

    Get PDF
    Iron oxide nanostructures are of particular interest because they can be used as photocatalysts in water splitting due to their advantageous properties. Electrochemical anodization is one of the best techniques to synthesize nanostructures directly on the metal substrate (direct back contact). In the present study, a novel methodology consisting of the anodization of iron under hydrodynamic conditions is carried out in order to obtain mainly hematite (α-Fe2O3) nanostructures to be used as photocatalysts for photoelectrochemical water splitting applications. Different rotation speeds were studied with the aim of evaluating the obtained nanostructures and determining the most attractive operational conditions. The synthesized nanostructures were characterized by means of Raman spectroscopy, Field Emission Scanning Electron Microscopy, photoelectrochemical water splitting, stability against photocorrosion tests, Mott-Schottky analysis, Electrochemical Impedance Spectroscopy (EIS) and band gap measurements. The results showed that the highest photocurrent densities for photoelectrochemical water splitting were achieved for the nanostructure synthesized at 1000 rpm which corresponds to a nanotubular structure reaching ∼0.130 mA cm−2 at 0.54 V (vs. Ag/AgCl). This is in agreement with the EIS measurements and Mott-Schottky analysis which showed the lowest resistances and the corresponding donor density values, respectively, for the nanostructure anodized at 1000 rpm
    corecore