743 research outputs found

    Parallel hybrid chicken swarm optimization for solving the quadratic assignment problem

    Get PDF
    In this research, we intend to suggest a new method based on a parallel hybrid chicken swarm optimization (PHCSO) by integrating the constructive procedure of GRASP and an effective modified version of Tabu search. In this vein, the goal of this adaptation is straightforward about the fact of preventing the stagnation of the research. Furthermore, the proposed contribution looks at providing an optimal trade-off between the two key components of bio-inspired metaheuristics: local intensification and global diversification, which affect the efficiency of our proposed algorithm and the choice of the dependent parameters. Moreover, the pragmatic results of exhaustive experiments were promising while applying our algorithm on diverse QAPLIB instances . Finally, we briefly highlight perspectives for further research

    Matheuristics: using mathematics for heuristic design

    Get PDF
    Matheuristics are heuristic algorithms based on mathematical tools such as the ones provided by mathematical programming, that are structurally general enough to be applied to different problems with little adaptations to their abstract structure. The result can be metaheuristic hybrids having components derived from the mathematical model of the problems of interest, but the mathematical techniques themselves can define general heuristic solution frameworks. In this paper, we focus our attention on mathematical programming and its contributions to developing effective heuristics. We briefly describe the mathematical tools available and then some matheuristic approaches, reporting some representative examples from the literature. We also take the opportunity to provide some ideas for possible future development

    Metaheuristics and Their Hybridization to Solve the Bi-objective Ring Star Problem: a Comparative Study

    Get PDF
    This paper presents and experiments approaches to solve a new bi-objective routing problem called the ring star problem. It consists of locating a simple cycle through a subset of nodes of a graph while optimizing two kinds of cost. The first objective is the minimization of a ring cost that is related to the length of the cycle. The second one is the minimization of an assignment cost from non-visited nodes to visited ones. In spite of its obvious bi-objective formulation, this problem has always been investigated in a single-objective way. To tackle the bi-objective ring star problem, we first investigate different stand-alone search methods. Then, we propose two cooperative strategies that combines two multiple objective metaheuristics: an elitist evolutionary algorithm and a population-based local search. We apply this new hybrid approaches to well-known benchmark test instances and demonstrate their effectiveness in comparison to non-hybrid algorithms and to state-of-the-art methods

    A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications

    Get PDF
    Particle swarm optimization (PSO) is a heuristic global optimization method, proposed originally by Kennedy and Eberhart in 1995. It is now one of the most commonly used optimization techniques. This survey presented a comprehensive investigation of PSO. On one hand, we provided advances with PSO, including its modifications (including quantum-behaved PSO, bare-bones PSO, chaotic PSO, and fuzzy PSO), population topology (as fully connected, von Neumann, ring, star, random, etc.), hybridization (with genetic algorithm, simulated annealing, Tabu search, artificial immune system, ant colony algorithm, artificial bee colony, differential evolution, harmonic search, and biogeography-based optimization), extensions (to multiobjective, constrained, discrete, and binary optimization), theoretical analysis (parameter selection and tuning, and convergence analysis), and parallel implementation (in multicore, multiprocessor, GPU, and cloud computing forms). On the other hand, we offered a survey on applications of PSO to the following eight fields: electrical and electronic engineering, automation control systems, communication theory, operations research, mechanical engineering, fuel and energy, medicine, chemistry, and biology. It is hoped that this survey would be beneficial for the researchers studying PSO algorithms

    Hybridization as Cooperative Parallelism for the Quadratic Assignment Problem

    No full text
    International audienceThe Quadratic Assignment Problem is at the core of several real-life applications. Finding an optimal assignment is computationally very difficult, for many useful instances. The best results are obtained with hybrid heuristics, which result in complex solvers. We propose an alternate solution where hybridization is obtain by means of parallelism and cooperation between simple single-heuristic solvers. We present experimental evidence that this approach is very efficient and can effectively solve a wide variety of hard problems, often surpassing state-of-the-art systems

    A Comparative Analysis of OLSR Routing Protocol based on PSO and Cuckoo Search Optimization (CSO) in Manets

    Get PDF
    New developments in wireless communication have enabled the use of highly efficient and inexpensive wireless receivers in a variety of portable applications. Each node in a mobile network is a mobile device that independently organizes its own connection to the others and manages its own data transmissions. The adaptability, scalability, and cost reduction of mobile networks have attracted considerable attention. Because mobile networks are constantly changing, problems with routing and power usage are common. High error rates, energy limitations, and inadequate bandwidth are just a few of the issues plaguing mobile ad hoc networks. The relevance of routing protocols in dynamic multi-hop networks like Mobile Ad hoc Networks (MANET) has drawn the attention of many scholars. In this paper, we focus on  implementing an OLSR(Optimised Link State  Routing) protocol and evaluates its performance using two optmisation algorithm: Particle Swarm Optimization(OLSR) and Cuckoo Search Optimization (CSO). The simulation result suggests that PSO is superior to both CSO and the conventional OLSR routing technique. We implemented using NS-2 simulator for simulation and NAM for network animation
    • …
    corecore