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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Bruecker PD, Beliën J, Boeck LD, Jaeger SD, Demeulemeester E (2018) A model enhancement approach for optimizing the integrated shift scheduling and vehicle routing problem in waste collection. Eur J Oper Res 266:278–290
Shahabi M, Tafreshian A, Unnikrishnan A, Boyles SD (2018) Joint production-inventory-location problem with multi-variate normal demand. Transp Res Part B 110:60–78
Gutjahr WJ, Dzubur N (2016) Bi-objective bilevel optimization of distribution center locations considering user equilibria. Transp Res Part E 85:1–22
Tang X, Lehu’ed’e F, P’eton O (2016) Location of distribution centers in a multi-period collaborative distribution network. Electron Notes Discrete Math 52:293–300
Zhuge D, Yu SC, Zhen L, Wang WR (2016) Multi-period distribution center location and scale decision in supply chain network. Comput Ind Eng 101:216–226
He YD, Wang X, Lin Y, Zhou FL, Zhou L (2017) Sustainable decision making for joint distribution center location choice. Transp Res Part D 55:202–216
Zhang B, Peng J, Li SG (2017) Covering location problem of emergency service facilities in an uncertain environment. Appl Math Model 51:429–447
Marín A, Martínez-Merino LI, Rodríguez-Chía AM, Saldanha-da-Gama F (2018) Multi-period stochastic covering location problems: modeling framework and solution approach. Eur J Oper Res 268:432–449
Amiri-Aref M, Klibi W, Babai MZ (2018) The multi-sourcing location inventory problem with stochastic demand. Eur J Oper Res 266:72–87
Fazayeli S, Eydi A, Kamalabadi IN (2018) Location-routing problem in multimodal transportation network with time windows and fuzzy demands: presenting a two-part genetic algorithm. Comput Ind Eng 119:233–246
Tapia-Ubeda FJ, Miranda PA, Macchi M (2018) A Generalized Benders Decomposition based algorithm for an inventory location problem with stochastic inventory capacity constraints. Eur J Oper Res 267:806–817
Chio HG, Kim J, Yoon Y, Moon BR (2019) Investigation of incremental hybrid genetic algorithm with subgraph isomorphism problem. Swarm Evol Comput 49:75–86
Mokshin AV, Mokshin VV, Sharnin LM (2019) Adaptive genetic algorithms used to analyze behavior of complex system. Commun Nonlinear Sci Numer Simul 71:174–178
Lin CS, Lee IL, Wu MC (2019) Merits of using chromosome representations and shadow chromosomes in genetic algorithms for solving scheduling problems. Robot Comput Integr Manuf 58:196–207
Zhang HW, Xie JW, Ge J, Zhang ZJ, Zong BF (2019) A hybrid adaptively genetic algorithm for task scheduling problem in the phased array radar. Eur J Oper Res 272:868–878
Cui ZH, Sun B, Wang G, Xue Y, Chen JJ (2017) A novel oriented cuckoo search algorithm to improve DV-Hop performance for cyber-physical systems. J Parallel Distrib Comput 103:42–52
Zhang MQ, Wang H, Cui ZH, Chen JJ (2018) Hybrid multi-objective cuckoo search with dynamical local search. Memet Comput 10:199–208
Cui ZH, Zhang JJ, Wang YC, Cao Y, Cai XJ, Zhang WS, Chen JJ (2019) A pigeon-inspired optimization algorithm for many-objective optimization problems. Sci China Inf Sci 62:070212. https://doi.org/10.1007/s11432-018-9729-5
Acknowledgements
This work was supported by the National Natural Science Foundation of China (Grant Nos. 71771078, 31670704) and the Youth Fund Project of Hebei Education Department (Grant No. QN2018236).
Author information
Authors and Affiliations
Corresponding authors
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Ge, Y., Xin, B., Zhou, L. et al. Selecting park locations using a genetic algorithm and comprehensive satisfaction. Int. J. Mach. Learn. & Cyber. 11, 1331–1338 (2020). https://doi.org/10.1007/s13042-019-01043-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13042-019-01043-z