Abstract
As general purpose optimisation methods, evolutionary algorithms have been efficiently used to solve multi-objective combinatorial optimisation problems. However, few theoretical investigations have been conducted to understand the efficiency of evolutionary algorithms on such problems, and even fewer theoretical investigations have been conducted on multi-objective combinatorial optimisation problems coming from real world. In this paper, we analyse the performance of a simple multi-objective evolutionary algorithm on two simplified instances of the bi-objective minimum weight minimum label spanning tree problem, which comes from real world. Though these two instances are similar, the analysis results show that the simple multi-objective evolutionary algorithm is efficient for one instance, but it may be inefficient for the other. According to the analysis on the second instance, we think that the restart strategy may be useful in making the multi-objective evolutionary algorithm more efficient for the bi-objective problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computational Science and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
