Research Repository

See what's under the surface

Evolutionary multi-objective optimization algorithms with probabilistic representation based on pheromone trails

Li, Hui; Landa-Silva, Dario; Gandibleux, Xavier

Authors

Hui Li

Xavier Gandibleux

Abstract

Recently, the research on quantum-inspired evolutionary algorithms (QEA) has attracted some attention in the area of evolutionary computation. QEA use a probabilistic representation, called Q-bit, to encode individuals in population. Unlike standard evolutionary algorithms, each Q-bit individual is a probability model, which can represent multiple solutions. Since probability models store global statistical information of good solutions found previously in the search, QEA have good potential to deal with hard optimization problems with many local optimal solutions. So far, not much work has been done on evolutionary multi-objective (EMO) algorithms with probabilistic representation. In this paper, we investigate the performance of two state-of-the-art EMO algorithms - MOEA/D and NSGA-II, with probabilistic representation based on pheromone trails, on the multi-objective travelling salesman problem. Our experimental results show that MOEA/D and NSGA-II with probabilistic presentation are very promising in sampling high-quality offspring solutions and in diversifying the search along the Pareto fronts.

Publication Date Jul 18, 2010
Peer Reviewed Peer Reviewed
Institution Citation Li, H., Landa-Silva, D., & Gandibleux, X. (2010). Evolutionary multi-objective optimization algorithms with probabilistic representation based on pheromone trails
Keywords multiobjective optimization, quantum computing, adaptive algorithms, encoding schemes, travelling salesman problem
Publisher URL http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5585998
Copyright Statement Copyright information regarding this work can be found at the following address: http://eprints.nottingh.../end_user_agreement.pdf
Additional Information ©2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Published in: 2010 IEEE Congress on Evolutionary Computation (CEC 2010). ISBN 9781424469093, doi:10.1109/CEC.2010.5585998

Files

dls_cec2010.pdf (297 Kb)
PDF

Copyright Statement
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf




You might also like


Downloadable Citations