World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Multi-Objective Genetic Algorithm and Simulated Annealing with the Jumping Gene Adaptations

    https://doi.org/10.1142/9789812836526_0004Cited by:3 (Source: Crossref)
    Abstract:

    Two popular evolutionary techniques used for solving multi-objective optimization problems, namely, genetic algorithm and simulated annealing, are discussed. These techniques are inherently more robust than conventional optimization techniques. Incorporating a macro-macro mutation operator, namely, the jumping gene operator, inspired from biology, reduces the computational time required for convergence, significantly. It also helps to obtain the global optimal Pareto set where several Paretos exist. In this article, detailed descriptions of genetic algorithm and simulated annealing with the various jumping gene adaptations are presented and then three benchmark problems are solved using them.