Skip to main content
select distinct n.content as name, r.content as role, t.nameID as nameID, n.unitID as unitID, n.departmentID as departmentID, n.facultyID as facultyID, n.provinceID as provinceID, n.countryID as countryID from transaction as t, Name as n, Role as r where t.itemID='93049' and t.nameID=n.id and t.roleID=r.id
scopus



Population-based incremental learning for multiobjective optimisation

Researcher

เครือข่ายคณะผู้วิจัย


เครือข่ายนักวิจัย+ผลงานวิจัย (full screen)

Abstract

The work in this paper presents the use of Population-based incremental learning (PBIL), one of the classic single-objective population-based optimisation methods, as a tool for multiobjective optimisation. The PBIL method with two different updating schemes of its probability vectors is presented. The performance of the two proposed multiobjective optimisers are measured and compared with four other established multiobjective evolutionary algorithms i.e. niched Pareto genetic algorithm, version 2 of non-dominated sorting genetic algorithm, version 2 of strength Pareto evolutionary algorithm, and Pareto archived evolution strategy. The optimisation methods are implemented to solve 8 bi-objective test problems where design variables are encoded as a binary string. The Pareto optimal solutions obtained from the various methods are compared and discussed. It can be concluded that, with the assigned test problems, the multiobjective PBIL methods are comparable to the previously developed algorithms in terms of convergence rate. The clear advantage in using PBILs is that they can provide considerably better population diversity. © 2007 Springer-Verlag Berlin Heidelberg.

Population-based incremental learning (20 items found) | Pareto archive (1 items found) | Multiobjective evolutionary optimisation | Non-dominated solutions | Performance comparison |

ต้นฉบับข้อมูล : scopus