Dynamic Optimization of Network Routing Problem through Ant Colony Optimization (ACO)

Search Based Software Engineering (SBSE) is a new paradigm of Software engineering, which considers software engineering problems as search problems and emphasizes to find out optimal solution for the given set of available solutions using metaheuristic techniques like hill climbing simulated annealing, evolutionary programming and tabu search. On the other hand AI techniques like Swarm particle optimization and Ant colony optimization (ACO) are used to find out solutions for dynamic problems. SBSE is yet not used for dynamic problems. In this study ACO techniques are applied on SBSE problem by considering Network routing problem as case study, in which the nature of problem is dynamic. Keywords: SBSE, ACO, Metaheuristic search techniques, dynamic optimizatio

Hybrid iterated local search algorithm for optimization route of airplane travel plans

The traveling salesman problem (TSP) is a very popular combinatorics problem. This problem has been widely applied to various real problems. The TSP problem has been classified as a Non-deterministic Polynomial Hard (NP-Hard), so a non-deterministic algorithm is needed to solve this problem. However, a non-deterministic algorithm can only produce a fairly good solution but does not guarantee an optimal solution. Therefore, there are still opportunities to develop new algorithms with better optimization results. This research develops a new algorithm by hybridizing three local search algorithms, namely, iterated local search (ILS) with simulated annealing (SA) and hill climbing (HC), to get a better optimization result. This algorithm aimed to solve TSP problems in the transportation sector, using a case study from the Traveling Salesman Challenge 2.0 (TSC 2.0). The test results show that the developed algorithm can optimize better by 15.7% on average and 11.4% based on the best results compared to previous studies using the Tabu-SA algorithm

Link Prediction by De-anonymization: How We Won the Kaggle Social Network Challenge

This paper describes the winning entry to the IJCNN 2011 Social Network Challenge run by Kaggle.com. The goal of the contest was to promote research on real-world link prediction, and the dataset was a graph obtained by crawling the popular Flickr social photo sharing website, with user identities scrubbed. By de-anonymizing much of the competition test set using our own Flickr crawl, we were able to effectively game the competition. Our attack represents a new application of de-anonymization to gaming machine learning contests, suggesting changes in how future competitions should be run. We introduce a new simulated annealing-based weighted graph matching algorithm for the seeding step of de-anonymization. We also show how to combine de-anonymization with link prediction---the latter is required to achieve good performance on the portion of the test set not de-anonymized---for example by training the predictor on the de-anonymized portion of the test set, and combining probabilistic predictions from de-anonymization and link prediction.Comment: 11 pages, 13 figures; submitted to IJCNN'201

ANALYSIS OF MARKOV CHAIN MONTE CARLO METHODS IN MULTI-INDENTURE INVENTORY OPTIMIZATION

U.S. Navy aircraft are required to meet minimum operational availability targets, while minimizing spare parts procurement costs. The current optimization model written by Salmeron and Buss, uses marginal analysis, as described by Sherbrooke, to determine optimal sparing policies for this highly complex multi-indenture model. The literature lacks alternative optimization methodologies for such a problem, so we propose an alternative approach utilizing simulated annealing (SA), a Markov Chain Monte Carlo algorithm. We present three SA approaches tested in three case studies of varying size and complexity. Our initial findings show that in very simple problems, SA is easily capable of outperforming marginal analysis; however, problems with more complexity have large optimality gaps. This is likely because the SA Markov chain is unable to effectively explore the multi-indenture structure of the problem. We implement a method to account for this structure that intelligently builds initial feasible solutions using an epsilon-greedy approach to marginal analysis. This approach produces better results than NAVARM in more than half of the trials on problems of moderate complexity. We also implement a novel method for calculating operational availability that may allow full scale problems to be optimized more efficiently.NAVSUP WSSLieutenant Commander, United States NavyApproved for public release. Distribution is unlimited