Multiple Region Coverage Path Planning for Autonomous Underwater Vehicle.

Coverage path planning methodology for an autonomous underwater vehicle to search multiple non-overlapping regions has been proposed in the paper. The proposed methodology is based on the genetic algorithm (GA). The GA used in the proposed methodology has been tuned for the specific problem, using design of experiment on an equivalent travelling salesman problem benchmark instance. Optimality of the generated paths was analysed through simulation studies. Results indicated that the proposed methodology generated shorter paths in comparison to conventional methods.

Genetic Algorithm for Solving the Resource Constrained Project Scheduling Problem

The present paper develops a multi–dimensional genetic algorithm for the Resource constrained project scheduling problem. This algorithm performs a series of perturbations in an attempt to improve the current solution, applying some problem dependant genetic operators. The procedure used is efficient and easy to implement. The approach was tested on sets of standard problems freely available on the Internet (PSPLIB) and the results were compared to those found in the literature. It was found that the algorithm used is able to generate competitive results compared to the best methods known so far and computes, for the first time, four optimal solutions for four benchmark instance.