A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony programming in which instead of a genetic algorithm an ant colony algorithm is applied to search for the program. The test results demonstrate that the proposed idea can be used with success to solve the approximation problems.

At last month's Transmediale festival in Berlin [1], the Utrecht-based arts collective Social Fiction received the festival's prestigious Software award for their .walk (dot-walk) project, that combines computer code and "psychogeographic" streetwalking. During the walk, participants carry out an algorithmic series of instructions derived from computer code, that "calculates" the city as a gian...

This paper presents a hybrid ant colony optimisation (HACO) algorithm for solving job shop problems. The criterion considered is the maximum completion time, the so-called makespan. The HACO algorithm improves the performance of intelligence optimisation algorithm, which adopts ant colony optimisation (ACO) algorithm to search in the global solution space, and tabu search (TS) algorithm is util...

ZigBee is a new low complexity, low cost and low power wireless communication technology. ZigBee technology is used to build a wireless sensor network and we must consider the energy saving and simple of algorithm in designing routing algorithm for wireless sensor networks. As heuristic search algorithm of ant colony optimization has the advantages of good distribution, strong global search cap...

Path planning for uninhabited combat air vehicle (UCAV) is a class of complicated high dimensional optimization problem, which mainly centralizes on path planning considering the different kinds of constrains in the complex environment of war. In order to solve this problem, it is converted to a kind of constrained function optimization problem, and a wolf colony search algorithm based on the c...

In this paper, we present a hybrid algorithm combining ant colony optimization algorithm with the taboo search algorithm for the classical job shop scheduling problem. Instead of using the conventional construction approach to construct feasible schedules, the proposed ant colony optimization algorithm employs a novel decomposition method inspired by the shifting bottleneck procedure, and a mec...

The Ant Colony Optimization (ACO) is a metaheuristic inspired by the behavior of real ants in their search for the shortest paths to food sources. It has recently attracted a lot of attention and has been successfully applied to a number of different optimization problems. Due to the importance of the feature selection problem and the potential of ACO, this paper presents a novel method that ut...

We modify an artificial bee colony algorithm to (i) make the population size grow over time, and to (ii) apply local search on strategically selected solutions. The modified algorithm obtains very good results on a set of large-scale continuous optimization problems. This is not the first time we see that these algorithmic components make an initially non-competitive algorithm produce state-of-...