The decomposition concept in handling the space allocation problem

Abstract

The space allocation problem particularly in academic institutions is well known as a complex, difficult and time consuming task. In this paper, we discuss the application of the decomposition concept in handling the combinatorial optimization problem such as the university space allocation problem. In applying the decomposition, we introduce the bin and tuple concept. This method is found to simplify the entire problem and ease the problem solving process. Combined local search Memetic Algorithm is applied on the simplified problem. Combined local search refers to combination of optimum local searches for genetic operators in Memetic Algorithm. Nevertheless, without any restriction, other algorithms can be used on the simplified problem.