The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Spatial multi-objective land use optimization: extensions to the non-dominated sorting genetic algorithm-II
Open accessAbstract
A spatial multi-objective land use optimization model defined by the acronym ‘NSGA-II-MOLU’ or the ‘non-dominated sorting genetic algorithm-II for multi-objective optimization of land use’ is proposed for searching for optimal land use scenarios which embrace multiple objectives and constraints extracted from the requirements of users, as well as providing support to the land use planning process. In this application, we took the MOLU model which was initially developed to integrate multiple objectives and coupled this with a revised version of the genetic algorithm NSGA-II which is based on specific crossover and mutation operators. The resulting NSGA-II-MOLU model is able to offer the possibility of efficiently searching over tens of thousands of solutions for trade-off sets which define non-dominated plans on the classical Pareto frontier. In this application, we chose the example of Tongzhou New Town, China, to demonstrate how the model could be employed to meet three conflicting objectives based on minimizing conversion costs, maximizing accessibility, and maximizing compatibilities between land uses. Our case study clearly shows the ability of the model to generate diversified land use planning scenarios which form the core of a land use planning support system. It also demonstrates the potential of the model to consider more complicated spatial objectives and variables with open-ended characteristics. The breakthroughs in spatial optimization that this model provides lead directly to other properties of the process in which further efficiencies in the process of optimization, more vivid visualizations, and more interactive planning support are possible. These form directions for future research.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
The Analytic Hierarchy Process
SAATY, T. L., & KEARNS, K. P. (1985) · Analytical Planning · doi:10.1016/b978-0-08-032599-6.50008-8 · Cited by 15,357
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1992) · Artificial Intelligence · doi:10.1007/978-3-662-02830-8 · Cited by 11,553
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Zitzler, E., & Thiele, L. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.797969 · Cited by 8,798
Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
Srinivas, N., & Deb, K. (1994) · Evolutionary Computation · doi:10.1162/evco.1994.2.3.221 · Cited by 6,935
A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-II
Deb, K., Agrawal, S., Pratap, A., & Meyarivan, T. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45356-3_83 · Cited by 5,289
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1996) · Springer eBooks · doi:10.1007/978-3-662-03315-9 · Cited by 5,095
Cited by
A Comprehensive Review on NSGA-II for Multi-Objective Combinatorial Optimization Problems
Verma, S., Pant, M., & Snasel, V. (2021) · IEEE Access · doi:10.1109/access.2021.3070634 · Cited by 974
A comprehensive survey on NSGA-II for multi-objective optimization and applications
Ma, H., Zhang, Y., Sun, S., Liu, T., & Shan, Y. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10526-z · Cited by 723
Cord, A. F., Bartkowski, B., Beckmann, M., Dittrich, A., Hermans-Neumann, K., Kaim, A., Lienhoop, N., Locher-Krause, K., Priess, J., Schröter-Schlaack, C., et al. (2017) · Ecosystem Services · doi:10.1016/j.ecoser.2017.07.012 · Cited by 582
Metadata
- Authors
- Cao, K., Batty, M., Huang, B., Liu, Y., Yu, L., & Chen, J.
- Venue
- International Journal of Geographical Information Science
- Publisher
- Informa UK Limited
- Published
- 2011-12
- Volume
- 25
- Issue
- 12
- Pages
- 1949-1969
- ISSN
- 0269-3798 (ISSN-L)
- 1365-8816
- 1362-3087
- OpenAlex
- W2116115717
- Cited by
- 254
- References
- 23
- FWCI
- 8.37
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Spatial multi-objective land use optimization: extensions to the non-dominated sorting genetic algorithm-II. https://app.cochat.ai/papers/10.1080/13658816.2011.570269
- The paper
- Cao, K., Batty, M., Huang, B., Liu, Y., Yu, L., & Chen, J. (2011). Spatial multi-objective land use optimization: extensions to the non-dominated sorting genetic algorithm-II. International Journal of Geographical Information Science. https://doi.org/10.1080/13658816.2011.570269
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.