Efficient selection operators in NSGA-II for solving bi-objective multi-skill resource-constrained project scheduling problem

16Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

This paper presents multiple variances of selection operator used in Non-dominated Sorting Genetic Algorithm II applied to solving Bi-Objective Multi-Skill Resource Constrained Project Scheduling Problem. A hybrid Differential Evolution with Greedy Algorithm has been proven to work very well on the researched problem and so it is used to probe the multi-objective solution space. It is then determined whether a multi-objective approach can outperform single-objective approaches in finding potential Pareto Fronts. Additional modified selection operators and a clone prevention method have been introduced and experiments have shown the increase in efficiency caused by their utilization.

Cite

CITATION STYLE

APA

Myszkowski, P. B., Laszczyk, M., & Lichodij, J. (2017). Efficient selection operators in NSGA-II for solving bi-objective multi-skill resource-constrained project scheduling problem. In Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, FedCSIS 2017 (pp. 83–86). Institute of Electrical and Electronics Engineers Inc. https://doi.org/10.15439/2017F317

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