Abstract
The multi-level paradigm is a simple and useful approach to tackle a number of combinatorial optimization problems. In this paper, we investigate a multi-objective multi-level algorithm to solve the bi-criteria maximum diversity problem. The computational results indicate that the proposed algorithm is very competitive in comparison with the original multi-objective optimization algorithms.
Author supplied keywords
Cite
CITATION STYLE
Xue, L. Y., Zeng, R. Q., Xu, H. Y., & Wen, Y. (2018). Solving Bi-criteria Maximum Diversity Problem with Multi-objective Multi-level Algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10956 LNAI, pp. 54–62). Springer Verlag. https://doi.org/10.1007/978-3-319-95957-3_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
