ANT COLONY OPTIMIZATION ALGORITHM FOR HETEROGENEOUS REDUNDANCY ALLOCATION IN MULTI-STATE SERIES-PARALLEL SYSTEMS

2009 ◽  
Vol 16 (02) ◽  
pp. 163-186 ◽  
Author(s):  
MANJU AGARWAL ◽  
VIKAS K. SHARMA
Keyword(s):  
System Design ◽  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
System Reliability ◽  
Optimization Problems ◽  
Ant Colony ◽  
System Structure ◽  
Ant Colony Optimization Algorithm ◽  
Redundancy Allocation ◽  
Demand Distribution

This paper addresses the redundancy allocation problem of multi-state series-parallel reliability structures where each subsystem can consist of maximum two types of redundant components. The objective is to minimize the total investment cost of system design satisfying system reliability constraint and the consumer load demand. The demand distribution is presented as a piecewise cumulative load curve. The configuration uses the binary components from a list of available products to provide redundancy so as to increase system reliability. The components are characterized by their feeding capacity, reliability and cost. A system that consists of elements with different reliability and productivity parameters has the capacity strongly dependent upon the selection of components constituting its structure. An ant colony optimization algorithm has been presented to analyze the problem and suggest an optimal system structure. The solution approach consists of a series of simple steps as used in early ant colony optimization algorithms dealing with other optimization problems and still proves efficient over the prevalent methods with regard to solutions obtained/computation time. Three multi-state system design problems have been solved for illustration.

An Improved Ant Colony Optimization Algorithm Based on Immunization Strategy

2012 ◽  
Vol 490-495 ◽  
pp. 66-70
Author(s):  
Yang Nan
Keyword(s):  
Evolutionary Algorithm ◽  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Continuous Optimization ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Artificial Immune ◽  
Combination Optimization ◽  
Continuous Optimization Problems

Ant colony optimization has been become a very useful method for combination optimization problems. Based on close connections between combination optimization and continuous optimization, nowadays some scholars have studied to apply ant colony optimization to continuous optimization problems, and proposed some continuous ant colony optimizations. To improve the performance of those continuous ant colony optimizations, here the principles of evolutionary algorithm and artificial immune algorithm have been combined with the typical continuous Ant Colony Optimization, and the adaptive Cauchi mutation and thickness selection are used to operate the ant individual, so a new Immunized Ant Colony Optimization is proposed.

scholarly journals Opposition-Based Ant Colony Optimization Algorithm for the Traveling Salesman Problem

Mathematics ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1650
Author(s):  
Zhaojun Zhang ◽  
Zhaoxiong Xu ◽  
Shengyang Luan ◽  
Xuanyu Li ◽  
Yifei Sun
Keyword(s):  
Ant Colony Optimization ◽  
Traveling Salesman Problem ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Traveling Salesman ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Combinatorial Optimization Problems ◽  
Opposition Based Learning ◽  
The Traveling Salesman Problem

Opposition-based learning (OBL) has been widely used to improve many swarm intelligent optimization (SI) algorithms for continuous problems during the past few decades. When the SI optimization algorithms apply OBL to solve discrete problems, the construction and utilization of the opposite solution is the key issue. Ant colony optimization (ACO) generally used to solve combinatorial optimization problems is a kind of classical SI optimization algorithm. Opposition-based ACO which is combined in OBL is proposed to solve the symmetric traveling salesman problem (TSP) in this paper. Two strategies for constructing opposite path by OBL based on solution characteristics of TSP are also proposed. Then, in order to use information of opposite path to improve the performance of ACO, three different strategies, direction, indirection, and random methods, mentioned for pheromone update rules are discussed individually. According to the construction of the inverse solution and the way of using it in pheromone updating, three kinds of improved ant colony algorithms are proposed. To verify the feasibility and effectiveness of strategies, two kinds of ACO algorithms are employed to solve TSP instances. The results demonstrate that the performance of opposition-based ACO is better than that of ACO without OBL.

Sign in / Sign up

Export Citation Format

Share Document