3,361 research outputs found

    A comprehensive survey on cultural algorithms

    Get PDF
    Peer reviewedPostprin

    A memetic particle swarm optimisation algorithm for dynamic multi-modal optimisation problems

    Get PDF
    Copyright @ 2011 Taylor & Francis.Many real-world optimisation problems are both dynamic and multi-modal, which require an optimisation algorithm not only to find as many optima under a specific environment as possible, but also to track their moving trajectory over dynamic environments. To address this requirement, this article investigates a memetic computing approach based on particle swarm optimisation for dynamic multi-modal optimisation problems (DMMOPs). Within the framework of the proposed algorithm, a new speciation method is employed to locate and track multiple peaks and an adaptive local search method is also hybridised to accelerate the exploitation of species generated by the speciation method. In addition, a memory-based re-initialisation scheme is introduced into the proposed algorithm in order to further enhance its performance in dynamic multi-modal environments. Based on the moving peaks benchmark problems, experiments are carried out to investigate the performance of the proposed algorithm in comparison with several state-of-the-art algorithms taken from the literature. The experimental results show the efficiency of the proposed algorithm for DMMOPs.This work was supported by the Key Program of National Natural Science Foundation (NNSF) of China under Grant no. 70931001, the Funds for Creative Research Groups of China under Grant no. 71021061, the National Natural Science Foundation (NNSF) of China under Grant 71001018, Grant no. 61004121 and Grant no. 70801012 and the Fundamental Research Funds for the Central Universities Grant no. N090404020, the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant no. EP/E060722/01 and Grant EP/E060722/02, and the Hong Kong Polytechnic University under Grant G-YH60

    Performance assessment of meta-heuristics for composite layup optimisation

    Get PDF
    Peer reviewedPostprin

    The Application of PSO in Structural Damage Detection: An Analysis of the Previously Released Publications (2005ā€“2020)

    Get PDF
    The structural health monitoring (SHM) approach plays a key role not only in structural engineering but also in other various engineering disciplines by evaluating the safety and performance monitoring of the structures. The structural damage detection methods could be regarded as the core of SHM strategies. That is because the early detection of the damages and measures to be taken to repair and replace the damaged members with healthy ones could lead to economic advantages and would prevent human disasters. The optimization-based methods are one of the most popular techniques for damage detection. Using these methods, an objective function is minimized by an optimization algorithm during an iterative procedure. The performance of optimization algorithms has a significant impact on the accuracy of damage identification methodology. Hence, a wide variety of algorithms are employed to address optimization-based damage detection problems. Among different algorithms, the particle swarm optimization (PSO) approach has been of the most popular ones. PSO was initially proposed by Kennedy and Eberhart in 1995, and different variants were developed to improve its performance. This work investigates the objectives, methodologies, and results obtained by over 50 studies (2005-2020) in the context of the structural damage detection using PSO and its variants. Then, several important open research questions are highlighted. The paper also provides insights on the frequently used methodologies based on PSO, the computational time, and the accuracy of the existing methodologies

    Seeking multiple solutions:an updated survey on niching methods and their applications

    Get PDF
    Multi-Modal Optimization (MMO) aiming to locate multiple optimal (or near-optimal) solutions in a single simulation run has practical relevance to problem solving across many fields. Population-based meta-heuristics have been shown particularly effective in solving MMO problems, if equipped with specificallydesigned diversity-preserving mechanisms, commonly known as niching methods. This paper provides an updated survey on niching methods. The paper first revisits the fundamental concepts about niching and its most representative schemes, then reviews the most recent development of niching methods, including novel and hybrid methods, performance measures, and benchmarks for their assessment. Furthermore, the paper surveys previous attempts at leveraging the capabilities of niching to facilitate various optimization tasks (e.g., multi-objective and dynamic optimization) and machine learning tasks (e.g., clustering, feature selection, and learning ensembles). A list of successful applications of niching methods to real-world problems is presented to demonstrate the capabilities of niching methods in providing solutions that are difficult for other optimization methods to offer. The significant practical value of niching methods is clearly exemplified through these applications. Finally, the paper poses challenges and research questions on niching that are yet to be appropriately addressed. Providing answers to these questions is crucial before we can bring more fruitful benefits of niching to real-world problem solving

    Multi-objective optimization of active suspension predictive control based on improved PSO algorithm

    Get PDF
    The design and control for active suspension is of great significance for improving the vehicle performance, which requires considering simultaneously three indexes including ride comfort, packaging requirements and road adaptability. To find optimal suspension parameters and provide a better tradeoff among these three performances, this paper presents a novel multi-objective particle swarm optimization (MPSO) algorithm for the suspension design. The mathematical model of quarter-car suspension is first established, and it integrates the hydraulic servo actuator model. Further a model predictive controller is designed for the suspension by using the control strategies of multi-step forecast, rolling optimization and online correction of predictive control theory. To use vehicle body acceleration, tire deflection and suspension stroke to represent the above three performances respectively, a multi-objective optimization model is constructed to optimize the suspension stiffness and damping coefficients. The MPSO algorithm includes extra crossover operations, which are applied to find the Pareto optimal set. The rule to update the Pareto pool is that the newly selected solutions must have two better performances compared with at least one already existed in the Pareto pool, which ensures that each solution is non-dominated within the Pareto set. Finally, numerical simulations on a vehicle-type example are done under B-level road surface excitation. Simulation results show that the optimized suspension can effectively reduce the vertical vibrations and improve the road adaptability. The model predictive controller also shows high robustness with vehicle under null load, half load and full load. Therefore, the proposed MPSO algorithm provides a new valuable reference for the multi-objective optimization of active suspension control

    Chaotic Quantum Double Delta Swarm Algorithm using Chebyshev Maps: Theoretical Foundations, Performance Analyses and Convergence Issues

    Full text link
    Quantum Double Delta Swarm (QDDS) Algorithm is a new metaheuristic algorithm inspired by the convergence mechanism to the center of potential generated within a single well of a spatially co-located double-delta well setup. It mimics the wave nature of candidate positions in solution spaces and draws upon quantum mechanical interpretations much like other quantum-inspired computational intelligence paradigms. In this work, we introduce a Chebyshev map driven chaotic perturbation in the optimization phase of the algorithm to diversify weights placed on contemporary and historical, socially-optimal agents' solutions. We follow this up with a characterization of solution quality on a suite of 23 single-objective functions and carry out a comparative analysis with eight other related nature-inspired approaches. By comparing solution quality and successful runs over dynamic solution ranges, insights about the nature of convergence are obtained. A two-tailed t-test establishes the statistical significance of the solution data whereas Cohen's d and Hedge's g values provide a measure of effect sizes. We trace the trajectory of the fittest pseudo-agent over all function evaluations to comment on the dynamics of the system and prove that the proposed algorithm is theoretically globally convergent under the assumptions adopted for proofs of other closely-related random search algorithms.Comment: 27 pages, 4 figures, 19 table

    Design and optimization of a laser-PIXE beamline for material science applications

    Get PDF
    Multi-MeV proton beams can be generated by irradiating thin solid foils with ultra-intense (>10^18 W/cm^2) short laser pulses. Several of their characteristics, such as high bunch charge and short pulse duration, make them a complementary alternative to conventional radio frequency-based accelerators. A potential material science application is the chemical analysis of cultural heritage (CH) artifacts. The complete chemistry of the bulk material (ceramics, metals) can be retrieved through sophisticated nuclear techniques such as particle-induced X-ray emission (PIXE). Recently, the use of laser-generated proton beams was introduced as diagnostics in material science (laser-PIXE or laser-driven PIXE): Coupling laser-generated proton sources to conventional beam steering devices successfully enhances the capture and transport of the laser-accelerated beam. This leads to a reduction of the high divergence and broad energy spread at the source. The design of our hybrid beamline is composed of an energy selector, followed by permanent quadrupole magnets aiming for better control and manipulation of the final proton beam parameters. This allows tailoring both, mean proton energy and spot sizes, yet keeping the system compact. We performed a theoretical study optimizing a beamline for laser-PIXE applications. Our design enables monochromatizing the beam and shaping its final spot size. We obtain spot sizes ranging between a fraction of mm up to cm scale at a fraction of nC proton charge per shot. These results pave the way for a versatile and tunable laserPIXE at a multi-Hz repetition rate using modern commercially available laser systems

    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
    • ā€¦
    corecore