Exact computation of the expectation curves of the bit-flip mutation using landscapes theory

Chicano, F., & Alba E. (2011). Exact computation of the expectation curves of the bit-flip mutation using landscapes theory. Proceedings of 13th Annual Genetic and Evolutionary Computation Conference, Dublin, Ireland, July 12-16, 2011. pp. 2027–2034.Bit-flip mutation is a common operation when a genetic algorithm is applied to solve a problem with binary representation. We use in this paper some results of landscapes theory and Krawtchouk polynomials to exactly compute the expected value of the fitness of a mutated solution. We prove that this expectation is a polynomial in p, the probability of flipping a single bit. We analyze these polynomials and propose some applications of the obtained theoretical results.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech. This research has been partially funded by the Spanish Ministry of Science and Innovation and FEDER under contract TIN2008-06491-C04-01 (the M∗ project) and the Andalusian Government under contract P07-TIC-03044 (DIRICOM project)

Elementary Landscape Decomposition of the Test Suite Minimization Problem

Chicano, F., Ferrer J., & Alba E. (2011). Elementary Landscape Decomposition of the Test Suite Minimization Problem. In Proceedings of Search Based Software Engineering, Szeged, Hungary, September 10-12, 2011. pp. 48–63.Landscape theory provides a formal framework in which combinatorial optimization problems can be theoretically characterized as a sum of a special kind of landscape called elementary landscape. The decomposition of the objective function of a problem into its elementary components provides additional knowledge on the problem that can be exploited to create new search methods for the problem. We analyze the Test Suite Minimization problem in Regression Testing from the point of view of landscape theory. We find the elementary landscape decomposition of the problem and propose a practical application of such decomposition for the search.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech. This research has been partially funded by the Spanish Ministry of Science and Innovation and FEDER under contract TIN2008-06491- C04-01 (the M∗ project) and the Andalusian Government under contract P07- TIC-03044 (DIRICOM project)

Comparing metaheuristic algorithms for error detection in Java programs

Chicano, F., Ferreira M., & Alba E. (2011). Comparing Metaheuristic Algorithms for Error Detection in Java Programs. In Proceedings of Search Based Software Engineering, Szeged, Hungary, September 10-12, 2011. pp. 82–96.Model checking is a fully automatic technique for checking concurrent software properties in which the states of a concurrent system are explored in an explicit or implicit way. The main drawback of this technique is the high memory consumption, which limits the size of the programs that can be checked. In the last years, some researchers have focused on the application of guided non-complete stochastic techniques to the search of the state space of such concurrent programs. In this paper, we compare five metaheuristic algorithms for this problem. The algorithms are Simulated Annealing, Ant Colony Optimization, Particle Swarm Optimization and two variants of Genetic Algorithm. To the best of our knowledge, it is the first time that Simulated Annealing has been applied to the problem. We use in the comparison a benchmark composed of 17 Java concurrent programs. We also compare the results of these algorithms with the ones of deterministic algorithms.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech. This research has been partially funded by the Spanish Ministry of Science and Innovation and FEDER under contract TIN2008-06491-C04-01 (the M∗ project) and the Andalusian Government under contract P07-TIC-03044 (DIRICOM project)

Windy Rural Collaborative Postmen Problem using ROS as Multi-agent System Architecture

[EN]In the last decades the urban areas have grown and as a result the transportation has become an important problem. We are exploring a potential solution for the last mile delivery problem in urban areas in a similar way that internet solves the delivery of information proble

Modelling and PID Control of a Rotary Dryer

This paper describes the modelling and the PID control of a drying process. The plant uses a co-current rotary dryer to evaporate moisture of a waste product generated by olive-oil mills, called alpeorujo or two phase cake. The paper shows the development of a model based upon first principles combined with experimental results. A control strategy has been tested under simulation based on PID controllers for the main loops in this process