52 research outputs found

    Convergence results for continuous-time dynamics arising in ant colony optimization

    Full text link
    This paper studies the asymptotic behavior of several continuous-time dynamical systems which are analogs of ant colony optimization algorithms that solve shortest path problems. Local asymptotic stability of the equilibrium corresponding to the shortest path is shown under mild assumptions. A complete study is given for a recently proposed model called EigenAnt: global asymptotic stability is shown, and the speed of convergence is calculated explicitly and shown to be proportional to the difference between the reciprocals of the second shortest and the shortest paths.Comment: A short version of this paper was published in the preprints of the 19th World Congress of the International Federation of Automatic Control, Cape Town, South Africa, 24-29 August 201

    An improved Ant Colony System for the Sequential Ordering Problem

    Full text link
    It is not rare that the performance of one metaheuristic algorithm can be improved by incorporating ideas taken from another. In this article we present how Simulated Annealing (SA) can be used to improve the efficiency of the Ant Colony System (ACS) and Enhanced ACS when solving the Sequential Ordering Problem (SOP). Moreover, we show how the very same ideas can be applied to improve the convergence of a dedicated local search, i.e. the SOP-3-exchange algorithm. A statistical analysis of the proposed algorithms both in terms of finding suitable parameter values and the quality of the generated solutions is presented based on a series of computational experiments conducted on SOP instances from the well-known TSPLIB and SOPLIB2006 repositories. The proposed ACS-SA and EACS-SA algorithms often generate solutions of better quality than the ACS and EACS, respectively. Moreover, the EACS-SA algorithm combined with the proposed SOP-3-exchange-SA local search was able to find 10 new best solutions for the SOP instances from the SOPLIB2006 repository, thus improving the state-of-the-art results as known from the literature. Overall, the best known or improved solutions were found in 41 out of 48 cases.Comment: 30 pages, 8 tables, 11 figure

    Hybridization of enhanced ant colony system and Tabu search algorithm for packet routing in wireless sensor network

    Get PDF
    In Wireless Sensor Network (WSN), high transmission time occurs when search agent focuses on the same sensor nodes, while local optima problem happens when agent gets trapped in a blind alley during searching. Swarm intelligence algorithms have been applied in solving these problems including the Ant Colony System (ACS) which is one of the ant colony optimization variants. However, ACS suffers from local optima and stagnation problems in medium and large sized environments due to an ineffective exploration mechanism. This research proposes a hybridization of Enhanced ACS and Tabu Search (EACS(TS)) algorithm for packet routing in WSN. The EACS(TS) selects sensor nodes with high pheromone values which are calculated based on the residual energy and current pheromone value of each sensor node. Local optima is prevented by marking the node that has no potential neighbour node as a Tabu node and storing it in the Tabu list. Local pheromone update is performed to encourage exploration to other potential sensor nodes while global pheromone update is applied to encourage the exploitation of optimal sensor nodes. Experiments were performed in a simulated WSN environment supported by a Routing Modelling Application Simulation Environment (RMASE) framework to evaluate the performance of EACS(TS). A total of 6 datasets were deployed to evaluate the effectiveness of the proposed algorithm. Results showed that EACS(TS) outperformed in terms of success rate, packet loss, latency, and energy efficiency when compared with single swarm intelligence routing algorithms which are Energy-Efficient Ant-Based Routing (EEABR), BeeSensor and Termite-hill. Better performances were also achieved for success rate, throughput, and latency when compared to other hybrid routing algorithms such as Fish Swarm Ant Colony Optimization (FSACO), Cuckoo Search-based Clustering Algorithm (ICSCA), and BeeSensor-C. The outcome of this research contributes an optimized routing algorithm for WSN. This will lead to a better quality of service and minimum energy utilization

    The tabu ant colony optimizer and its application in an energy market

    Get PDF
    A new ant colony optimizer, the \u27tabu ant colony optimizer\u27 (TabuACO) is introduced, tested, and applied to a contemporary problem. The TabuACO uses both attractive and repulsive pheromones to speed convergence to a solution. The dual pheromone TabuACO is benchmarked against several other solvers using the traveling salesman problem (TSP), the quadratic assignment problem (QAP), and the Steiner tree problem. In tree-shaped puzzles, the dual pheromone TabuACO was able to demonstrate a significant improvement in performance over a conventional ACO. As the amount of connectedness in the network increased, the dual pheromone TabuACO offered less improvement in performance over the conventional ACO until it was applied to fully-interconnected mesh-shaped puzzles, where it offered no improvement. The TabuACO is then applied to implement a transactive energy market and tested with published circuit models from IEEE and EPRI. In the IEEE feeder model, the application was able to limit the sale of power through an overloaded transformer and compensate by bringing downstream power online to relieve it. In the EPRI feeder model, rapid voltage changes due to clouds passing over PV arrays caused the PV contribution to outstrip the ability of the substation to compensate. The TabuACO application was able to find a manageable limit to the photovoltaic energy that could be contributed on a cloudy day --Abstract, page iii

    A Bare-Bones Ant Colony Optimization Algorithm that Performs Competitively on the Sequential Ordering Problem

    No full text
    EigenAnt is a bare-bones ant colony optimization algorithm that has been proven to converge to the optimal solution under certain conditions. In this paper, we extend EigenAnt to the sequential ordering problem (SOP), comparing its performance to Gambardella et al.\u27s enhanced ant colony system (EACS), a model that has been found to have state-of-the-art performance on the SOP. Our experimental results, using the SOPLIB2006 instance library, indicate that there is no statistically significant difference in performance between our proposed method and the state-of-the-art EACS method

    Using MapReduce Streaming for Distributed Life Simulation on the Cloud

    Get PDF
    Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable to various lattice-based a-life models. We implement and empirically evaluate our algorithms’ performance on Amazon’s Elastic MR cloud. Our experiments demonstrate that a single MR optimization technique called strip partitioning can reduce the execution time of continuous life simulations by 64%. To the best of our knowledge, we are the first to propose and evaluate MR streaming algorithms for lattice-based simulations. Our algorithms can serve as prototypes in the development of novel MR simulation algorithms for large-scale lattice-based a-life models.https://digitalcommons.chapman.edu/scs_books/1014/thumbnail.jp

    Grid-enabled adaptive surrugate modeling for computer aided engineering

    Get PDF

    Music in Evolution and Evolution in Music

    Get PDF
    Music in Evolution and Evolution in Music by Steven Jan is a comprehensive account of the relationships between evolutionary theory and music. Examining the ‘evolutionary algorithm’ that drives biological and musical-cultural evolution, the book provides a distinctive commentary on how musicality and music can shed light on our understanding of Darwin’s famous theory, and vice-versa. Comprised of seven chapters, with several musical examples, figures and definitions of terms, this original and accessible book is a valuable resource for anyone interested in the relationships between music and evolutionary thought. Jan guides the reader through key evolutionary ideas and the development of human musicality, before exploring cultural evolution, evolutionary ideas in musical scholarship, animal vocalisations, music generated through technology, and the nature of consciousness as an evolutionary phenomenon. A unique examination of how evolutionary thought intersects with music, Music in Evolution and Evolution in Music is essential to our understanding of how and why music arose in our species and why it is such a significant presence in our lives
    • …
    corecore