This paper introduces the basic theory and procedure for working out solutions of ant colony genetic algorithm, describes optimization, constraints and objectives of construction project scheduling, then establishes basic model for scheduling optimization of construction project, and put forward improved ant colony genetic algorithm for solving the basic model. Performance of ant colony genetic...

Fact Gathering means generating rule base from available numerical data or data base. The intelligence of a fuzzy system lies in its rule base. Generating rule base is one of the most important and difficult tasks when designing fuzzy systems. Various rule base generation methods are used such as Neural networks, genetic algorithms, biogeography based optimization approach, ant colony optimizat...

Ant colony optimization (ACO) is a technique for optimization that was introduced in the early 1990’s. The inspiring source o f ant colony optimization is the foraging behavior of real ant colonies. This behavior is exploited in artificial ant colonies for the search of approximate solutions to discrete and continuous optimization problems and to important problems in telecommunications, such a...

Research in software testing has experienced a significant growth in recent years. One topic of special interest is fault detection techniques to reduce human interference and detect maximum faults. Priority is given to these techniques so that only higher priority techniques should be used instead of using individual techniques of lower priority. Bee Colony Optimization based upon natural phen...

Optimization techniques inspired by swarm intelligence have become increasingly popular during the last decade. They are characterized by a decentralized way of working that mimics the behavior of swarms of social insects, flocks of birds, or schools of fish. The advantage of these approaches over traditional techniques is their robustness and flexibility. These properties make swarm intelligen...

This paper proposes an approximate optimization algorithm combining P systems with ant colony optimization, called ACOPS, to solve traveling salesman problems, which are well-known and extensively studied NP-complete combinatorial optimization problems. ACOPS uses the pheromone model and pheromone update rules defined by ant colony optimization algorithms, and the hierarchical membrane structur...

Various studies have shown that the ant colony optimization (ACO) algorithm has a good performance in approximating complex combinatorial problems such as traveling salesman problem (TSP) for real-world applications. However, disadvantages long running time and easy stagnation still restrict its further wide application many fields. In this study, saltatory evolution (SEACO) is proposed to incr...