Abstract
To find MST (Minimum Spanning Trees) in complete graph is a classical problem in operation research having network design as an important application. It is possible to solve MST problem efficiently, but its Biobjective versions are NP hard. In this paper, we present a comparison of two encoding schemes for representing tree in Biobjective optimization scenario. The three different instances of Biobjective MST have been solved by using two different encoding methods in the evolutionary algorithms; Pareto optimal front obtained has been taken into account for comparative study. Our evolutionary computation approach involves Biobjective MST problem using NSGAII (Nondominated Sorting Genetic Algorithm II) approach. We compare edge sets encoding with Prufer encoding in evolutionary algorithm for Biobjective MST, we find edge sets encoding outperforms the Prufer in Biobjective optimization scenario.
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 callDisclaimer: 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.
