Advertisement
Published in:
16-12-2019 | Original Article
Selecting park locations using a genetic algorithm and comprehensive satisfaction
Published in: International Journal of Machine Learning and Cybernetics | Issue 6/2020
Log inActivate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
Parks play an important role in beautifying the urban environment in cities and in improving the quality of life of citizens. The foremost step in park construction is solving the location problem. Government and resident satisfaction are proposed, and a linear programming model is suggested herein to study the park location problem. Furthermore, government and resident satisfaction are considered together in a metric we call comprehensive satisfaction, and a special solution model called the park location (PL) model is obtained; the properties of the PL model are also investigated. To solve the PL model, a special genetic algorithm in which random simulation is embedded is proposed. Finally, an application of the proposed approach for solving the park location problem is provided as an illustration. This study is expected to help readers to better compare the performance of the proposed method to alternatives.