Using ant colonies for solve the multiprocessor task graph scheduling

The problem of scheduling a parallel program presented by a weighted directed acyclic graph (DAG) to the set of homogeneous processors for minimizing the completion time of the program has been extensively studied as academic optimization problem which occurs in optimizing the execution time of parallel algorithm with parallel computer.In this paper, we propose an application of the Ant Colony Optimization (ACO) to a multiprocessor scheduling problem (MPSP). In the MPSP, no preemption is allowed and each operation demands a setup time on the machines. The problem seeks to compose a schedule that minimizes the total completion time.We therefore rely on heuristics to find solutions since solution methods are not feasible for most problems as such. This novel heuristic searching approach to the multiprocessor based on the ACO algorithm a collection of agents cooperate to effectively explore the search space.A computational experiment is conducted on a suit of benchmark application. By comparing our algorithm result obtained to that of previous heuristic algorithm, it is evince that the ACO algorithm exhibits competitive performance with small error ratio.

Ant colony for TSP

The aim of this work is to investigate Ant Colony Algorithm for the traveling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP graph. This paper is based on the ideas of ant colony algorithm and analysis the main parameters of the ant colony algorithm. Experimental results for solving TSP problems with ant colony algorithm show great effectiveness.

COMPARISON OF PARTIAL SHADING LOSSES IN FREE FIELD PV-PLANTS WITH DIFFERENT ARRAY CONFIGURATIONS

A common problem when planning large free field PV-plants is optimizing the ground occupation ratio while maintaining low shading losses. Due to the complexity of this task, several PV-plants have been built using various configurations. In order to compare the shading losses of different PV technologies and array designs, empirical performance data of five free field PV-plants operating in Germany was analyzed. The data collected comprised 140 winter days from October 2011 until March 2012. The relative shading losses were estimated by comparing the energy output of selected arrays in the front rows (shading-free) against that of shaded arrays in the back rows of the same plant. The results showed that landscape mounting with mc-Si PV-modules yielded significantly better results than portrait one. With CIGS modules, making cross-table strings using the lower modules was not beneficial as expected and had more losses than a one-string-per-table layout. Parallel substrings with CdTe showed relatively low losses. Among the two CdTe products analyzed, none showed a significantly better performance.

Detecting Plants on Railway Embankments

This paper investigates problems concerning vegetation along railways and proposes automatic means of detecting ground vegetation. Digital images of railway embankments have been acquired and used for the purpose. The current work mainly proposes two algorithms to be able to achieve automation. Initially a vegetation detection algorithm has been investigated for the purpose of detecting vegetation. Further a rail detection algorithm that is capable of identifying the rails and eventually the valid sampling area has been investigated. Results achieved in the current work report satisfactory (qualitative) detection rates.