330 research outputs found
Solving Competitive Traveling Salesman Problem Using Gray Wolf Optimization Algorithm
In this paper a Gray Wolf Optimization (GWO) algorithm is presented to solve the Competitive Traveling Salesman Problem (CTSP). In CTSP, there are numbers of non-cooperative salesmen their goal is visiting a larger possible number of cities with lowest cost and most gained benefit. Each salesman will get a benefit when he visits unvisited city before all other salesmen. Two approaches have been used in this paper, the first one called static approach, it is mean evenly divides the cities among salesmen. The second approach is called parallel at which all cities are available to all salesmen and each salesman tries to visit as much as possible of the unvisited cities. The algorithms are executed for 1000 times and the results prove that the GWO is very efficient giving an indication of the superiority of GWO in solving CTSP
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
TRUSS STRUCTURE OPTIMIZATION BASED ON IMPROVED WOLF PACK ALGORITHM
Aiming at the optimization of truss structure, a wolf pack algorithm based on chaos and improved search strategy was proposed. The mathematical model of truss optimization was constructed, and the classical truss structure was optimized. The results were compared with those of other optimization algorithms. When selecting and updating the initial position of wolves, chaos idea was used to distribute the initial value evenly in the solution space; phase factor was introduced to optimize the formula of wolf detection; information interaction between wolves is increased and the number of runs is reduced. The numerical results show that the improved wolf pack algorithm has the characteristics of fewer parameters, simple programming, easy implementation, fast convergence speed, and can quickly find the optimal solution. It is suitable for the optimization design of the section size of space truss structures
A NOVEL APPROACH TO ORBITAL DEBRIS MITIGATION
Since mankind launched the first satellite into orbit in 1957, we have been inadvertently, yet deliberately, creating an environment in space that may ultimately lead to the end of our space exploration. Space debris, more specifically, orbital debris is a growing problem that must be dealt with sooner, rather than later. Several ideas have been developed to address the complex problem of orbital debris mitigation.
This research will investigate the possibility of removing orbital debris from the Low Earth Orbit (LEO) regime by using a metaheuristic algorithm to maximize collection of debris resulting from the February 2009 on-orbit collision of Iridium 33 and Cosmos 2251. This treatment will concentrate on the Iridium debris field for analysis. This research is necessary today, more than ever, as we embark on the launch of thousands of LEO spacecraft, which could result in the realization of the Kessler Syndrome, “The certain risk of failure on launch or during operations due to an on-orbit collision with debris” (Kessler & Cour-Palais, 1978)
Nature Inspired Range Based Wireless Sensor Node Localization Algorithms
Localization is one of the most important factors highly desirable for the performance of Wireless Sensor Network (WSN). Localization can be stated as the estimation of the location of the sensor nodes in sensor network. In the applications of WSN, the data gathered at sink node will be meaningless without localization information of the nodes. Due to size and complexity factors of the localization problem, it can be formulated as an optimization problem and thus can be approached with optimization algorithms. In this paper, the nature inspired algorithms are used and analyzed for an optimal estimation of the location of sensor nodes. The performance of the nature inspired algorithms viz. Flower pollination algorithm (FPA), Firefly algorithm (FA), Grey Wolf Optimization (GWO) and Particle Swarm Optimization (PSO) for localization in WSN is analyzed in terms of localization accuracy, number of localized nodes and computing time. The comparative analysis has shown that FPA is more proficient in determining
the coordinates of nodes by minimizing the localization error as compared to FA, PSO and GWO
Optimizing the Replication of Multi-Quality Web Applications Using ACO and WoLF
This thesis presents the adaptation of Ant Colony Optimization to a new NP-hard problem involving the replication of multi-quality database-driven web applications (DAs) by a large application service provider (ASP). The ASP must assign DA replicas to its network of heterogeneous servers so that user demand is satisfied and replica update loads are minimized. The algorithm proposed, AntDA, for solving this problem is novel in several respects: ants traverse a bipartite graph in both directions as they construct solutions, pheromone is used for traversing from one side of the bipartite graph to the other and back again, heuristic edge values change as ants construct solutions, and ants may sometimes produce infeasible solutions. Experiments show that AntDA outperforms several other solution methods, but there was room for improvement in the convergence rates of the ants. Therefore, in an attempt to achieve the goals of faster convergence and better solution values for larger problems, AntDA was combined with the variable-step policy hill-climbing algorithm called Win or Learn Fast (WoLF). In experimentation, the addition of this learning algorithm in AntDA provided for faster convergence while outperforming other solution methods
Introductory Review of Swarm Intelligence Techniques
With the rapid upliftment of technology, there has emerged a dire need to
fine-tune or optimize certain processes, software, models or structures, with
utmost accuracy and efficiency. Optimization algorithms are preferred over
other methods of optimization through experimentation or simulation, for their
generic problem-solving abilities and promising efficacy with the least human
intervention. In recent times, the inducement of natural phenomena into
algorithm design has immensely triggered the efficiency of optimization process
for even complex multi-dimensional, non-continuous, non-differentiable and
noisy problem search spaces. This chapter deals with the Swarm intelligence
(SI) based algorithms or Swarm Optimization Algorithms, which are a subset of
the greater Nature Inspired Optimization Algorithms (NIOAs). Swarm intelligence
involves the collective study of individuals and their mutual interactions
leading to intelligent behavior of the swarm. The chapter presents various
population-based SI algorithms, their fundamental structures along with their
mathematical models.Comment: Submitted to Springe
The Application of Ant Colony Optimization
The application of advanced analytics in science and technology is rapidly expanding, and developing optimization technics is critical to this expansion. Instead of relying on dated procedures, researchers can reap greater rewards by utilizing cutting-edge optimization techniques like population-based metaheuristic models, which can quickly generate a solution with acceptable quality. Ant Colony Optimization (ACO) is one the most critical and widely used models among heuristics and meta-heuristics. This book discusses ACO applications in Hybrid Electric Vehicles (HEVs), multi-robot systems, wireless multi-hop networks, and preventive, predictive maintenance
Recommended from our members
Chaos Gray Wolf global optimization algorithm based on Opposition-based Learning
The article archived on this institutional repository is a preprint. It is not certified by peer review. You are advised to consult the final version published by ACM at https://doi.org/10.1145/3596947.3596960 .Copyright © 2022 The Author(s). Gray wolf optimizer (GWO) is a new heuristic algorithm. It has few parameters and strong optimization ability and is used in many fields. However, when solving complex and multimodal functions, it is also easy to trap into the local optimum and premature convergence. In order to boost the performance of GWO, a tent chaotic map and opposition-based learning Grey Wolf Optimizer (CO-GWO) is proposed. Firstly, some better values of the population in the current generation are retained to avoid deterioration in the next generation. Secondly, tent chaotic map and opposition-based (OBL)are introduced to generate values that can traverse the whole feasible region as much as possible, which is conducive to jumping out of local optimization and accelerating convergence. Then, the coefficient is dynamically adjusted by the polynomial attenuation function of the 2-decay method. Finally, the proposed algorithm is tested on 23 benchmark functions. The results show that the proposed algorithm is superior to the conventional heuristic algorithms, GWO and its variants in search-efficiency, solution accuracy and convergence rate
- …