Lin-Kernighan Heuristic Adaptations for the Generalized Traveling Salesman Problem

The Lin-Kernighan heuristic is known to be one of the most successful heuristics for the Traveling Salesman Problem (TSP). It has also proven its efficiency in application to some other problems. In this paper we discuss possible adaptations of TSP heuristics for the Generalized Traveling Salesman Problem (GTSP) and focus on the case of the Lin-Kernighan algorithm. At first, we provide an easy-to-understand description of the original Lin-Kernighan heuristic. Then we propose several adaptations, both trivial and complicated. Finally, we conduct a fair competition between all the variations of the Lin-Kernighan adaptation and some other GTSP heuristics. It appears that our adaptation of the Lin-Kernighan algorithm for the GTSP reproduces the success of the original heuristic. Different variations of our adaptation outperform all other heuristics in a wide range of trade-offs between solution quality and running time, making Lin-Kernighan the state-of-the-art GTSP local search.Comment: 25 page

A Tutorial on Clique Problems in Communications and Signal Processing

Since its first use by Euler on the problem of the seven bridges of K\"onigsberg, graph theory has shown excellent abilities in solving and unveiling the properties of multiple discrete optimization problems. The study of the structure of some integer programs reveals equivalence with graph theory problems making a large body of the literature readily available for solving and characterizing the complexity of these problems. This tutorial presents a framework for utilizing a particular graph theory problem, known as the clique problem, for solving communications and signal processing problems. In particular, the paper aims to illustrate the structural properties of integer programs that can be formulated as clique problems through multiple examples in communications and signal processing. To that end, the first part of the tutorial provides various optimal and heuristic solutions for the maximum clique, maximum weight clique, and $k$-clique problems. The tutorial, further, illustrates the use of the clique formulation through numerous contemporary examples in communications and signal processing, mainly in maximum access for non-orthogonal multiple access networks, throughput maximization using index and instantly decodable network coding, collision-free radio frequency identification networks, and resource allocation in cloud-radio access networks. Finally, the tutorial sheds light on the recent advances of such applications, and provides technical insights on ways of dealing with mixed discrete-continuous optimization problems

Cooperative beamsteering in wireless sensor network based on backtracking search algorithm

The progressive development of Wireless Sensor Network (WSNs) contributes to many applications such as in the intelligent transport system (ITS), safety monitoring, military and in natural disasters prevention. In parallel to WSNs, the idea of internet of things (IoT) is developed where IoT can be defined as an interconnection between identifiable devices within the internet connection in sensing and monitoring processes. With recent growth in both size and power efficient computing, the concept of the ubiquitous WSN has aggressively emerged as an acknowledged research topic. As the capabilities of individual nodes in WSNs increase, so does the opportunity to perform more complicated tasks, such as cooperative beamsteering (CB). This CB manages to improve the range of communications and save precious battery power during the transmission. Therefore, this research proposes a meta-heuristic algorithm to organize node location in array arrangement. It is expected to effectively improve radiation beampattern fluctuations, exhibits lower complexity and less energy. From the simulation that has been done, it's observed that the proposed algorithm helps to reduce the side lobe level, thus better radiation beampattern is achieved

Sewer networks monitoring through a topological backtracking

The interest in wastewater monitoring is always growing, with applications mainly aimed at detection of pollutants and at the environmental epidemiological surveillance. However, it often happens that the strategies proposed to manage these problems are inapplicable due to the lack of information on the hydraulics of the systems. To overcome this problem, the present paper develops and proposes a topological backtracking strategy for the optimal monitoring of sewer networks, which acts by subrogating the hydraulic information with the geometric ones, e.g., diameter and slope, thus not requiring any hydraulic simulation. The topological backtracking approach aims at evaluating an impact coefficient for each node of the network used to face with the problems of sensor location and network coverage for purposes related to the spread of contaminants and pathogens. Finally, the positioning of the sensors for each monitoring scheme is addressed by a priority rank, based on the efficiency of each sensor in terms of network coverage with respect to a specific weight (e.g., length, flow). The main goal is to design a monitoring scheme that provide the required coverage of the network by minimizing the number of sensors with respect to specific measurement threshold value. The results show the effectiveness of the strategy in supporting the optimal design with the topological-based backtracking approach without the necessity of performing hydraulic simulations, with great advantage in terms of required data and computational time

An Enhanced Pairwise Search Approach for Generating Optimum Number of Test Data and Reduce Execution Time

In recent days testing considers the most important task for building software that is free from error. Since the resources and time is limited to produce software, hence, it is not possible of performing exhaustive tests (i.e. to test all possible combinations of input data.) An alternative to get ride from this type exhaustive numbers and as well to reduce cost, an approach called Pairwise (2 way) test data generation approach will be effective. Most of the software faults in pairwise approach caused by unusual combination of input data.  Hence, the demand for the optimization of number of generated test-cases and reducing the execution time is growing in software industries. This paper proposes an enhancement in pairwise search approach which generates optimum number of input values for testing purposes.  In this approach it searches the most coverable pairs by pairing parameters and adopts one-test-at-a-time strategy for constructing a final test-suite.  Compared to other existing strategies, Our proposed approach is effective in terms of number of generated test cases and of execution time. Keywords:, Software testing, Pairwise testing, Combinatorial interaction testing, Test case generation

Soft Computing Techiniques for the Protein Folding Problem on High Performance Computing Architectures

The protein-folding problem has been extensively studied during the last fifty years. The understanding of the dynamics of global shape of a protein and the influence on its biological function can help us to discover new and more effective drugs to deal with diseases of pharmacological relevance. Different computational approaches have been developed by different researchers in order to foresee the threedimensional arrangement of atoms of proteins from their sequences. However, the computational complexity of this problem makes mandatory the search for new models, novel algorithmic strategies and hardware platforms that provide solutions in a reasonable time frame. We present in this revision work the past and last tendencies regarding protein folding simulations from both perspectives; hardware and software. Of particular interest to us are both the use of inexact solutions to this computationally hard problem as well as which hardware platforms have been used for running this kind of Soft Computing techniques.This work is jointly supported by the FundaciónSéneca (Agencia Regional de Ciencia y Tecnología, Región de Murcia) under grants 15290/PI/2010 and 18946/JLI/13, by the Spanish MEC and European Commission FEDER under grant with reference TEC2012-37945-C02-02 and TIN2012-31345, by the Nils Coordinated Mobility under grant 012-ABEL-CM-2014A, in part financed by the European Regional Development Fund (ERDF). We also thank NVIDIA for hardware donation within UCAM GPU educational and research centers.Ingeniería, Industria y Construcció

An efficient genetic algorithm for structural RNA pairwise alignment and its application to non-coding RNA discovery in yeast

<p>Abstract</p> <p>Background</p> <p>Aligning RNA sequences with low sequence identity has been a challenging problem since such a computation essentially needs an algorithm with high complexities for taking structural conservation into account. Although many sophisticated algorithms for the purpose have been proposed to date, further improvement in efficiency is necessary to accelerate its large-scale applications including non-coding RNA (ncRNA) discovery.</p> <p>Results</p> <p>We developed a new genetic algorithm, Cofolga2, for simultaneously computing pairwise RNA sequence alignment and consensus folding, and benchmarked it using BRAliBase 2.1. The benchmark results showed that our new algorithm is accurate and efficient in both time and memory usage. Then, combining with the originally trained SVM, we applied the new algorithm to novel ncRNA discovery where we compared <it>S. cerevisiae </it>genome with six related genomes in a pairwise manner. By focusing our search to the relatively short regions (50 bp to 2,000 bp) sandwiched by conserved sequences, we successfully predict 714 intergenic and 1,311 sense or antisense ncRNA candidates, which were found in the pairwise alignments with stable consensus secondary structure and low sequence identity (≤ 50%). By comparing with the previous predictions, we found that > 92% of the candidates is novel candidates. The estimated rate of false positives in the predicted candidates is 51%. Twenty-five percent of the intergenic candidates has supports for expression in cell, i.e. their genomic positions overlap those of the experimentally determined transcripts in literature. By manual inspection of the results, moreover, we obtained four multiple alignments with low sequence identity which reveal consensus structures shared by three species/sequences.</p> <p>Conclusion</p> <p>The present method gives an efficient tool complementary to sequence-alignment-based ncRNA finders.</p