Hybrid population-based metaheuristic approaches for the space allocation problem
- 13 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 232-239
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
This publication has 8 references indexed in Scilit:
- Space-planning by ant colony optimisationInternational Journal of Computer Applications in Technology, 1999
- Multiobjective Heuristic Search1999
- Space allocation: An analysis of higher education requirements1998
- Hybrid genetic algorithms for bin-packing and related problemsAnnals of Operations Research, 1996
- Meta-Heuristics1996
- An Integer Goal Programming Model to Allocate Offices to Staff in an Academic InstitutionJournal of the Operational Research Society, 1995
- Planning Facilities at the University of Missouri-RollaInterfaces, 1992
- A Multiple Objective Approach to Space Planning for Academic FacilitiesManagement Science, 1979