A controlled migration genetic algorithm operator for hardware-in-the-loop experimentation

In this paper, we describe the development of an extended migration operator, which combats the negative effects of noise on the effective search capabilities of genetic algorithms. The research is motivated by the need to minimize the num- ber of evaluations during hardware-in-the-loop experimentation, which can carry a significant cost penalty in terms of time or financial expense. The authors build on previous research, where convergence for search methods such as Simulated Annealing and Variable Neighbourhood search was accelerated by the implementation of an adaptive decision support operator. This methodology was found to be effective in searching noisy data surfaces. Providing that noise is not too significant, Genetic Al- gorithms can prove even more effective guiding experimentation. It will be shown that with the introduction of a Controlled Migration operator into the GA heuristic, data, which repre- sents a significant signal-to-noise ratio, can be searched with significant beneficial effects on the efficiency of hardware-in-the- loop experimentation, without a priori parameter tuning. The method is tested on an engine-in-the-loop experimental example, and shown to bring significant performance benefits

The Resource Leveling Problem with multiple resources using an adaptive genetic algorithm

Resource management ensures that a project is completed on time and at cost, and that its quality is as previously defined; nevertheless, resources are scarce and their use in the activities of the project leads to conflicts in the schedule. Resource Leveling Problems consider how to make the resource consumption as efficient as possible. This paper presents a new Adaptive Genetic Algorithm for the Resource Leveling Problem with multiple resources, and its novelty lies in using the Weibull distribution to establish an estimation of the global optimum as a termination condition. The extension of the project deadline with a penalty is allowed, avoiding the increase in the project criticality punishing the shift of activities. The algorithmis tested with the standard Project Scheduling Problem Library PSPLIB, and a complete analysis and benchmarking test instances are presented. The proposed algorithm is implemented using VBA for Excel 2010 in order to provide a flexible and powerful decision support system that enables practitioners to choose between different feasible solutions to a problem, and in addition it is easily adjustable to the constraints and particular needs of each project in realistic environments.This study was partially funded by the Spanish Ministry of Science and Innovation (research project BIA2011-23602).Ponz Tienda, JL.; Yepes Piqueras, V.; Pellicer Armiñana, E.; Moreno Flores, J. (2013). The Resource Leveling Problem with multiple resources using an adaptive genetic algorithm. Automation in Construction. 29(1):161-172. doi:10.1016/j.autcon.2012.10.003S16117229