Evolutionary Rough Parallel Multi-Objective Optimization Algorithm
| hal.structure.identifier | Department of Computer Science & Engineering [Jadavpur] | |
| dc.contributor.author | MAULIK, Ujjwal | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| hal.structure.identifier | Models and Algorithms for the Genome [ MAGNOME] | |
| hal.structure.identifier | Department of Information Technology [GCELT] | |
| dc.contributor.author | SARKAR, Anasua | |
| dc.date.accessioned | 2024-04-15T09:47:51Z | |
| dc.date.available | 2024-04-15T09:47:51Z | |
| dc.date.issued | 2010-01 | |
| dc.identifier.issn | 0169-2968 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/198132 | |
| dc.description.abstractEn | A hybrid unsupervised learning algorithm, which is termed as Parallel Rough-based Archived Multi-Objective Simulated Annealing (PARAMOSA), is proposed in this article. It comprises a judicious integration of the principles of the rough sets theory and the scalable distributed paradigm with the archived multi-objective simulated annealing approach. While the concept of boundary approximations of rough sets in this implementation, deals with the incompleteness in the dynamic classification method with the quality of classification coefficient as the classificatory competencemeasurement, the time-efficient parallel approach enables faster convergence of the Pareto-archived evolution strategy. It incorporates both the rough set-based dynamic archive classifi- cation method and the distributed implementation as a two-phase speedup strategy in this algorithm. A measure of the amount of domination between two solutions has been incorporated in this work to determine the acceptance probability of a new solution with an improvement in the spread of the non-dominated solutions in the Pareto-front by adopting rough sets theory. A complexity analysis of the proposed algorithm is provided. An extensive comparative study of the proposed algorithm with three other existing and well-known Multi-Objective Evolutionary Algorithms (MOEAs) demonstrate the effectiveness of the former with respect to four existing performance metrics and eleven benchmark test problems of varying degrees of difficulties. The superiority of this new parallel implementation over other algorithms also has been demonstrated in timing, which achieves a near optimal speedup with a minimal communication overhead. | |
| dc.language.iso | en | |
| dc.publisher | Polskie Towarzystwo Matematyczne | |
| dc.title.en | Evolutionary Rough Parallel Multi-Objective Optimization Algorithm | |
| dc.type | Article de revue | |
| dc.identifier.doi | 10.3233/FI-2010-237 | |
| dc.subject.hal | Informatique [cs]/Bio-informatique [q-bio.QM] | |
| dc.subject.hal | Sciences du Vivant [q-bio]/Bio-Informatique, Biologie Systémique [q-bio.QM] | |
| bordeaux.journal | Fundamenta Informaticae | |
| bordeaux.page | 13-27 | |
| bordeaux.volume | 99 | |
| bordeaux.hal.laboratories | Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 | * |
| bordeaux.issue | 1 | |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | inria-00563544 | |
| hal.version | 1 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//inria-00563544v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Fundamenta%20Informaticae&rft.date=2010-01&rft.volume=99&rft.issue=1&rft.spage=13-27&rft.epage=13-27&rft.eissn=0169-2968&rft.issn=0169-2968&rft.au=MAULIK,%20Ujjwal&SARKAR,%20Anasua&rft.genre=article |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||