260,325 research outputs found

    Ant colony optimization with direct communication for the traveling salesman problem

    Get PDF
    This article is posted here with permission from IEEE - Copyright @ 2010 IEEEAnts in conventional ant colony optimization (ACO) algorithms use pheromone to communicate. Usually, this indirect communication leads the algorithm to a stagnation behaviour, where the ants follow the same path from early stages. This occurs because high levels of pheromone are developed, which force the ants to follow the same corresponding trails. As a result, the population gets trapped into a local optimum solution which is difficult to escape from it. In this paper, a direct communication (DC) scheme is proposed where ants are able to exchange cities with other ants that belong to their communication range. Experiments show that the DC scheme delays convergence and improves the solution quality of conventional ACO algorithms regarding the traveling salesman problem, since it guides the population towards the global optimum solution. The ACO algorithm with the proposed DC scheme has better performance, especially on large problem instances, even though it increases the computational time in comparison with a conventional ACO algorithm

    A memetic ant colony optimization algorithm for the dynamic travelling salesman problem

    Get PDF
    Copyright @ Springer-Verlag 2010.Ant colony optimization (ACO) has been successfully applied for combinatorial optimization problems, e.g., the travelling salesman problem (TSP), under stationary environments. In this paper, we consider the dynamic TSP (DTSP), where cities are replaced by new ones during the execution of the algorithm. Under such environments, traditional ACO algorithms face a serious challenge: once they converge, they cannot adapt efficiently to environmental changes. To improve the performance of ACO on the DTSP, we investigate a hybridized ACO with local search (LS), called Memetic ACO (M-ACO) algorithm, which is based on the population-based ACO (P-ACO) framework and an adaptive inver-over operator, to solve the DTSP. Moreover, to address premature convergence, we introduce random immigrants to the population of M-ACO when identical ants are stored. The simulation experiments on a series of dynamic environments generated from a set of benchmark TSP instances show that LS is beneficial for ACO algorithms when applied on the DTSP, since it achieves better performance than other traditional ACO and P-ACO algorithms.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/01 and Grant EP/E060722/02

    Multi-population genetic algorithms with immigrants scheme for dynamic shortest path routing problems in mobile ad hoc networks

    Get PDF
    Copyright @ Springer-Verlag Berlin Heidelberg 2010.The static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile ad hoc network (MANET), wireless mesh network, etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, that is, the network topology changes over time due to energy conservation or node mobility. Therefore, the SP problem turns out to be a dynamic optimization problem in mobile wireless networks. In this paper, we propose to use multi-population GAs with immigrants scheme to solve the dynamic SP problem in MANETs which is the representative of new generation wireless networks. The experimental results show that the proposed GAs can quickly adapt to the environmental changes (i.e., the network topology change) and produce good solutions after each change.This work was supported by the Engineering and Physical Sciences Research Council(EPSRC) of UK under Grant EP/E060722/1

    Ant colony optimization with immigrants schemes in dynamic environments

    Get PDF
    This is the post-print version of this article. The official published version can be accessed from the link below - Copyright @ 2010 Springer-VerlagIn recent years, there has been a growing interest in addressing dynamic optimization problems (DOPs) using evolutionary algorithms (EAs). Several approaches have been developed for EAs to increase the diversity of the population and enhance the performance of the algorithm for DOPs. Among these approaches, immigrants schemes have been found beneficial for EAs for DOPs. In this paper, random, elitismbased, and hybrid immigrants schemes are applied to ant colony optimization (ACO) for the dynamic travelling salesman problem (DTSP). The experimental results show that random immigrants are beneficial for ACO in fast changing environments, whereas elitism-based immigrants are beneficial for ACO in slowly changing environments. The ACO algorithm with hybrid immigrants scheme combines the merits of the random and elitism-based immigrants schemes. Moreover, the results show that the proposed algorithms outperform compared approaches in almost all dynamic test cases and that immigrant schemes efficiently improve the performance of ACO algorithms in DTSP.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1

    Solar Models with Revised Abundances and Opacities

    Full text link
    Using reconstructed opacities, we construct solar models with low heavy-element abundance. Rotational mixing and enhanced diffusion of helium and heavy elements are used to reconcile the recently observed abundances with helioseismology. The sound speed and density of models where the relative and absolute diffusion coefficients for helium and heavy elements have been increased agree with seismically inferred values at better than the 0.005 and 0.02 fractional level respectively. However, the surface helium abundance of the enhanced diffusion model is too low. The low helium problem in the enhanced diffusion model can be solved to a great extent by rotational mixing. The surface helium and the convection zone depth of rotating model M04R3, which has a surface Z of 0.0154, agree with the seismic results at the levels of 1 Ļƒ\sigma and 3 Ļƒ\sigma respectively. M04R3 is almost as good as the standard model M98. Some discrepancies between the models constructed in accord with the new element abundances and seismic constraints can be solved individually, but it seems difficult to resolve them as a whole scenario.Comment: 10 pages, 1 figur

    The two dimensional antiferromagnetic Heisenberg model in the presence of an external field

    Full text link
    We present numerical results on the zero temperature magnetization curve and the static structure factors of the two dimensional antiferromagnetic Heisenberg model in the presence of an external field. The impact of frustration is also studied.Comment: 6 pages, 16 figures, REVTE

    Angular momentum transport and element mixing in the stellar interior I. Application to the rotating Sun

    Full text link
    The purpose of this work was to obtain diffusion coefficient for the magnetic angular momentum transport and material transport in a rotating solar model. We assumed that the transport of both angular momentum and chemical elements caused by magnetic fields could be treated as a diffusion process. The diffusion coefficient depends on the stellar radius, angular velocity, and the configuration of magnetic fields. By using of this coefficient, it is found that our model becomes more consistent with the helioseismic results of total angular momentum, angular momentum density, and the rotation rate in a radiative region than the one without magnetic fields. Not only can the magnetic fields redistribute angular momentum efficiently, but they can also strengthen the coupling between the radiative and convective zones. As a result, the sharp gradient of the rotation rate is reduced at the bottom of the convective zone. The thickness of the layer of sharp radial change in the rotation rate is about 0.036 RāŠ™R_{\odot} in our model. Furthermore, the difference of the sound-speed square between the seismic Sun and the model is improved by mixing the material that is associated with angular momentum transport.Comment: 8 pages, 2 figure

    Two particles on a star graph II

    Full text link
    We consider a two particle system on a star graph with delta-function interaction. A complete description of the eigensolutions with real momenta is given; specifically it is shown that all eigensolutions can be written as integrals in the momentum plane of sums of products of appropriate one particle solutions.Comment: typos corrected, minor changes, journal ref adde

    Proposal for a QND which-path measurement using photons

    Get PDF
    A scheme is proposed for experimentally realizing the famous two-slit gedaenken experiment using photons. As elegantly discussed for electrons by Feynman, a particle's quantum pathways interfere to produce fringes in the probability density for the particle to be found at a particle location. If the path taken by the particle is experimentally determined, the complementarity principle says that the fringes must disappear. To carry out this experiment with photons is difficult because normally the act of determining a photon's location destroys it. We propose to overcome this difficulty by putting a type-2 optical parametric amplifier (OPA) in each arm of a Mach-Zehnder interferometer, and observing fringes at the output. An OPA responds to an input photon by increasing its probability to produce a pair of photons with polarization orthogonal to the input, the detection of which allows partial inference about the path taken by the input photon without destroying it. Thus, the measurement is of the quantum nondemolition (QND) type
    • ā€¦
    corecore