ant colony optimisation (aco) algorithm and adaptive refinement mechanism are used in this paper for solution of optimization problems. many of the real engineering problems are، however، of continuous nature and finding their solution by discrete ant based algorithms requires discretisation of the decision variables in which affected the convergence and performance of the algorithm. in this pa...

This paper proposes an ant colony optimization algorithm to assist railroad yard operational planning staff in their daily tasks. The proposed algorithm tries to minimize a multi-objective function that considers both fixed and variable transportation costs involved in moving railroad cars within the railroad yard area. This is accomplished by searching the best switch engine schedule for a giv...

One direction of ant colony optimization researches is dividing the ants’ population into several colonies. These colonies work together to collectively solve an optimization problem. This approach offers good opportunity to explore a large area of the search space. This paper proposes a new generic algorithmic approach that utilized multiple ant colonies with several new interaction techniques...

Free flight air traffic management is a paradigm shift to move the decision making process for route choices from air traffic controllers to the cockpit. It provides a unique opportunity to optimize flight routes in the presence of hazardous weather. However, the process of maximizing airspace capacity requires robust and safe weather avoidance algorithms. The problem involves a number of poten...

Existing ant colony optimization (ACO) for software testing cases generation is a very popular domain in software testing engineering. However, the traditional ACO has flaws, as early search pheromone is relatively scarce, search efficiency is low, search model is too simple, positive feedback mechanism is easy to produce the phenomenon of stagnation and precocity. This paper introduces improve...

In this paper, we propose a multi-objective evolutionary metaheuristic approach based on the Pareto Ant Colony Optimization (P-ACO) and non-dominated genetic sorting algorithms (NSGA II NSGA III) to solve bi-objective portfolio optimization problem. P-ACO is used select best assets composing efficient portfolio. Then, III are separately find proportional weights of budget allocated selected The...

the one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. in this paper a meta-heuristic method based on aco is presented to solve this problem. in this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...

this paper considers identical parallel machines scheduling problem with past-sequence-dependent setup times, deteriorating jobs and learning effects, in which the actual processing time of a job on each machine is given as a function of the processing times of the jobs already processed and its scheduled position on the corresponding machine. in addition, the setup time of a job on each machin...

Wireless Sensor Networks are the new generation of networks that typically are formed great numbers of nodes and the communications of these nodes are done as Wireless. The main goal of these networks is collecting data from neighboring environment of network sensors. Since the sensor nodes are battery operated and there is no possibility of charging or replacing the batteries, the lifetime of ...

The problem of optimal planning of multiple sources of distributed generation (DG) in distribution networks is treated in this paper using an improved Ant Colony Optimization algorithm (ACO). This objective of this problem is to determine the DG optimal size and location that in order to minimize the network real power losses. Considering the multiple sources of DG, both size and location are s...