5,886 research outputs found
A sequence based genetic algorithm with local search for the travelling salesman problem
The standard Genetic Algorithm often suffers from slow convergence for solving combinatorial optimization problems. In this study, we present a sequence based genetic algorithm (SBGA) for the symmetric travelling salesman problem (TSP). In our proposed method, a set of sequences are extracted from the best individuals, which are used to guide the search of SBGA. Additionally, some procedures are applied to maintain the diversity by breaking the selected sequences into sub tours if the best individual of the population does not improve. SBGA is compared with the inver-over operator, a state-of-the-art algorithm for the TSP, on a set of benchmark TSPs. Experimental results show that the convergence speed of SBGA is very promising and much faster than that of the inver-over algorithm and that SBGA achieves a similar solution quality on all test TSPs
A hybrid genetic algorithm and inver over approach for the travelling salesman problem
This article posted here with permission of the IEEE - Copyright @ 2010 IEEEThis paper proposes a two-phase hybrid approach for the travelling salesman problem (TSP). The first phase is based on a sequence based genetic algorithm (SBGA) with an embedded local search scheme. Within the SBGA, a memory is introduced to store good sequences (sub-tours) extracted from previous good solutions and the stored sequences are used to guide the generation of offspring via local search during the evolution of the population. Additionally, we also apply some techniques to adapt the key parameters based on whether the best individual of the population improves or not and maintain the diversity. After SBGA finishes, the hybrid approach enters the second phase, where the inver over (IO) operator, which is a state-of-the-art algorithm for the TSP, is used to further improve the solution quality of the population. Experiments are carried out to investigate the performance of the proposed hybrid approach in comparison with several relevant algorithms on a set of benchmark TSP instances. The experimental results show that the proposed hybrid approach is efficient in finding good quality solutions for the test TSPs.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of the United Kingdom under Grant EP/E060722/1
Modeling Probability of Path Loss for DSDV, OLSR and DYMO above 802.11 and 802.11p
This paper presents path loss model along with framework for probability
distribution function for VANETs. Furthermore, we simulate three routing
protocols Destination Sequenced Distance Vector (DSDV), Optimized Link State
Routing (OLSR) and Dynamic MANET On-demand (DYMO) in NS-2 to evaluate and
compare their performance using two Mac-layer Protocols 802.11 and 802.11p. A
novel approach of this work is modifications in existing parameters to achieve
high efficiency. After extensive simulations, we observe that DSDV out performs
with 802.11p while DYMO gives best performance with 802.11.Comment: IEEE 8th International Conference on Broadband and Wireless
Computing, Communication and Applications (BWCCA'13), Compiegne, Franc
Recommended from our members
SAS-4 is recruited to a dynamic structure in newly forming centrioles that is stabilized by the gamma-tubulin-mediated addition of centriolar microtubules.
Centrioles are surrounded by pericentriolar material (PCM), which is proposed to promote new centriole assembly by concentrating gamma-tubulin. Here, we quantitatively monitor new centriole assembly in living Caenorhabditis elegans embryos, focusing on the conserved components SAS-4 and SAS-6. We show that SAS-4 and SAS-6 are coordinately recruited to the site of new centriole assembly and reach their maximum levels during S phase. Centriolar SAS-6 is subsequently reduced by a mechanism intrinsic to the early assembly pathway that does not require progression into mitosis. Centriolar SAS-4 remains in dynamic equilibrium with the cytoplasmic pool until late prophase, when it is stably incorporated in a step that requires gamma-tubulin and microtubule assembly. These results indicate that gamma-tubulin in the PCM stabilizes the nascent daughter centriole by promoting microtubule addition to its outer wall. Such a mechanism may help restrict new centriole assembly to the vicinity of preexisting parent centrioles that recruit PCM
Swarming and swirling in self-propelled polar granular rods
Using experiments with anisotropic vibrated rods and quasi-2D numerical
simulations, we show that shape plays an important role in the collective
dynamics of self-propelled (SP) particles. We demonstrate that SP rods exhibit
local ordering, aggregation at the side walls, and clustering absent in round
SP particles. Furthermore, we find that at sufficiently strong excitation SP
rods engage in a persistent swirling motion in which the velocity is strongly
correlated with particle orientation.Comment: 4 page
Deconstructing source location privacy-aware routing protocols
Source location privacy (SLP) is becoming an important property for a large class of security-critical wireless sensor network applications such as monitoring and tracking. Much of the previous work on SLP have focused on the development of various protocols to enhance the level of SLP imparted to the network, under various attacker models and other conditions. Others works have focused on analysing the level of SLP being imparted by a specific protocol. In this paper, we focus on deconstructing routing-based SLP protocols to enable a better understanding of their structure. We argue that the SLP-aware routing protocols can be classified into two main categories, namely (i) spatial and (ii) temporal. Based on this, we show that there are three important components, namely (i) decoy selection, (ii) use and routing of control messages and (iii) use and routing of decoy messages. The decoy selection technique imparts the spatial or temporal property of SLP-aware routing. We show the viability of the framework through the construction of well-known SLP-aware routing protocols using the identified components
- …
