Abstract
A new methodology is proposed in this paper to solve multiobjective optimisation problems (MOPs) by invoking genetic algorithms and solutions concepts of cooperative games. The weighting problems that are formulated by assigning some suitable weights to the multiple objective functions are usually solved to obtain the Pareto optimal solutions of MOPs. In this paper, the suitable weights will be taken from the core values of a cooperative game that is formulated from the original MOP by regarding the objective functions as players. Under these settings, we shall obtain a large set of all so-called Core-Pareto optimal solutions. In order to choose the best Core-Pareto optimal solution from this set, we shall invoke the genetic algorithms by setting a reasonable fitness function.
Sign-in/Register to access full text options 
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.
