Ant colony optimization is a metaheuristic approach belonging to the model based search algorithm. It is a paradigm for designing metaheuristic algorithm for combinatorial problem. In this paper we discuss the Ant colony system. Ant colony system is one of the best algorithm of ant colony optimization. First we discuss the optimization,and one of the optimization problem is combinatiorial probl...

Water distribution networks are a fundamental part of any modern city and their daily operations constitute a significant expenditure in terms of energy and maintenance costs. Careful scheduling of pump operations may lead to significant energy savings and prevent wear and tear. By means of computer simulation, an optimal schedule of pumps can be found by an optimisation algorithm. The subject ...

Ant colony optimisation algorithms (ACO) work via a process called stigmergy in which ants deposit pheromone traces in order to influence foraging patterns. Pheromone traces are picked up and followed by other ants but they evaporate over time. Paths with more pheromone will survive longer and have a higher chance of getting followed and reinforced whilst weaker traces simply fade away. The pre...

in this paper, a new continuous ant colony optimization (caco) algorithm is proposed for optimal reservoir operation. the paper presents a new method of determining and setting a complete set of control parameters for any given problem, saving the user from a tedious trial and error based approach to determine them. the paper also proposes an elitist strategy for caco algorithm where best solut...

Grey cast iron of the grade ASTM 48 is in the use for manufacturing casting parts with low or middle duty or load, such as various stove parts, gas burners, boiler parts, protective cover, hand wheel, brackets, base plate, crane balls, counter weight, handle, machine base etc. The production volume rate is mainly lies with the material removal rate during machining process and this is essential...

The efficient scheduling of independent computational jobs in a heterogeneous computing (HC) environment is an important problem in domains such as grid computing. Finding optimal schedules for such an environment is (in general) an NP-hard problem, and so heuristic approaches must be used. In this paper we describe an ant colony optimisation (ACO) algorithm that, when combined with local and t...

Time and space assembly line balancing considers realistic multi-objective versions of the classical assembly line balancing industrial problems. It involves the joint optimisation of conflicting criteria such as the cycle time, the number of stations, and/or the area of these stations. The different problems included in this area also inherit the precedence constraints and the cycle time limit...