A New Efficient Algorithm for Maximizing the Profit and the Compactness in Land Use Planing Problem

Abstract

This paper deals with a land-use planing problem in which the objective is to maximize the profit (or to minimize the cost) while ensuring the compactness. The original mathematical model is a multi-objective optimization problem with binary integer variables. It is then transformed to a single objective optimization problem. One may use a commercial software to solve such problem but the computation time is expensive especially in large scale problem. Hence, finding new efficient algorithms for the problem is necessary. Recently, two alternatives method based on genetic algorithm (GA) and non dominated sorting genetic algorithm (NSGA-II) are proposed. In this work, we propose a new local method based on difference of convex functions algorithm (DCA). The numerical results are compared with the one provided by GA. It shows that the proposed algorithm is much better and the obtained solutions are close to the global solutions.