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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Altinakar, M., Qi, H.: Numerical-simulation based multiobjective optimization of agricultural land-use with uncertainty. In: World Environmental and Water Resources Congress, Honolulu, Hawaii, United States, pp. 1–10 (2008). https://doi.org/10.1061/40976(316)481
Aerts, J.C.J.H., Herwijnen, M., Stewart, T.: Using simulated annealing and spatial goal programming for solving a multi site land use allocation problem. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds.) Evolutionary Multi-criterion Optimization. EMO 2003, LNCS, vol. 2632, pp. 448–463. Springer, Heidelberg (2003)
Chetty, S., Adewumi, A.O.: Three new stochastic local search metaheuristics for the annual crop planning problem based on a new irrigation scheme. J. Appl. Math. 14 (2013). https://www.hindawi.com/journals/jam/2013/158538/
Aerts, J.C., Eisinger, E., Heuvelink, G.B., Stewart, T.J.: Using linear integer programming for multi-site land- use allocation. J. Geogr. Anal. 35, 148–169 (2003)
Le Thi, H.A.: Contribution à l’optimisation non-convex and l’optimisation globale: Théorie, Algorithmes et Applications, Habilitation à Diriger des recherches, Université de Rouen (1997)
Le Thi, H.A., Pham Dinh, T.: A continuous approach for globally solving linearly constrained quadratic zero-one programming problem. Optimization 50(1–2), 93–120 (2001)
Le Thi, H.A., Pham Dinh, T.: The DC(difference of convex functions) programming and DCA revisited with DC models of real world non-convex optimization problems. Ann. Oper. Res. 133, 23–46 (2005)
Le Thi, H.A., Pham Dinh, T., Huynh, V.N.: Exact penalty and error bounds in DC programming. J. Glob. Optim. 52(3), 509–535 (2012)
Le Thi, H.A., Pham Dinh, T.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world non convex optimization problems. Ann. Oper. Res. 133, 23–46 (2005)
Memmah, M.-M., Lescourret, F., Yao, X., Lavigne, C.: Metaheuristics for agricultural land use optimization. a review. Agron. Sustain. Dev. 35, 975–998 (2015)
Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to D.C programming: theory, algorithms and applications. Acta Math. Vietnamica 22(1), 289–355 (1997). Dedicated to Professor Hoang Tuy on the occasion of his 70th birthday
Pham Dinh, T., Le Thi, H.A.: DC optimization algorithms for solving the trust region subproblem. SIAM J. Optim. 8, 476–505 (1998)
Quynh, T.D.: A genetic algorithm and NSGA-II for a land use planing problem. In: Proceeding of REV-ECIT 2018, pp. 169–173 (2018). (in Vietnamese)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Quynh, T.D. (2020). A New Efficient Algorithm for Maximizing the Profit and the Compactness in Land Use Planing Problem. In: Le Thi, H., Le, H., Pham Dinh, T., Nguyen, N. (eds) Advanced Computational Methods for Knowledge Engineering. ICCSAMA 2019. Advances in Intelligent Systems and Computing, vol 1121. Springer, Cham. https://doi.org/10.1007/978-3-030-38364-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-38364-0_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-38363-3
Online ISBN: 978-3-030-38364-0
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)