Hybrid population-based metaheuristic approaches for the space allocation problem

Citation

Burke E, Cowling P & Landa Silva JD (2001) Hybrid population-based metaheuristic approaches for the space allocation problem. In: Proceedings of the IEEE Conference on Evolutionary Computation, ICEC. Vol. 1. Congress on Evolutionary Computation 2001, Seoul, Korea, 27.05.2001-30.05.2001. Red Hook, NJ, USA: IEEE, pp. 232-239. http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=934394&abstractAccess=no&userType=inst; https://doi.org/10.1109/CEC.2001.934394

Abstract
A hybrid population-based metaheuristic for the space allocation problem in academic institutions is presented that is based upon previous experiments using a range of techniques including hill-climbing, simulated annealing, tabu search and genetic algorithms. The proposed approach incorporates the best characteristics of each technique, makes an automatic selection of the parameters according to the problem characteristics and surpasses the performance of these standard techniques in terms of the solution quality evaluated with a penalty function. This approach incorporates local search heuristics, adaptive cooling schedules and population-based techniques. Our experiments show that this technique produces competitive solutions for the space allocation problem. In this problem, it is often desirable to obtain a set of candidate solutions so that the decision maker can select the best among them. By controlling a common cooling schedule for the whole population in the simulated annealing component, it is possible to find one excellent solution or to produce a population of good solutions.

Keywords
genetic algorithms; search problems; simulated annealing