A developed NSGA-II algorithm for multi-objective chiller loading optimization problems

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

During recent years, for its simplicity and efficiency, the nondominated- sorting algorithm (NSGA-II) has been widely applied to solve multi-objective optimization problems. However, in the canonical NSGA-II, the resulted population may have multiple individuals with the same fitness values, and which makes the resulted population lack of diversity. To solve this kind of problem, in this study, we propose a developed NSGA-II algorithm (hereafter called NSGA-II-D). In NSGA-II-D, a novel duplicate individuals cleaning procedure is embedded to delete the individuals the same fitness values with other ones. Then, the proposed algorithm is tested on the well-known ZDT1 instance to verify the efficiency and performance. Finally, to solve the realisitc optimization problem in intelligent building system, we select a well-known optimal chiller loading (OCL) problem to test the ability to maintain population diversity. Experimental results on the benchmarks show the efficiency and effectiveness of the proposed algorithm.

Cite

CITATION STYLE

APA

Duan, P. Y., Wang, Y., Sang, H. Y., Wang, C. G., Qi, M. Y., & Li, J. Q. (2016). A developed NSGA-II algorithm for multi-objective chiller loading optimization problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9771, pp. 489–497). Springer Verlag. https://doi.org/10.1007/978-3-319-42291-6_49

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free