Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/17891
Title: A permutation-based dual genetic algorithm for dynamic optimization problems
Authors: Liu, L
Wang, D
Ip, WH 
Keywords: Attribute-based dualism
Dynamic combinatorial optimization
Genetic algorithm
Partial-dualism scheme
Permutation
Issue Date: 2009
Publisher: Springer
Source: Soft computing, 2009, v. 13, no. 7, p. 725-738 How to cite?
Journal: Soft computing 
Abstract: Adaptation to dynamic optimization problems is currently receiving growing interest as one of the most important applications of genetic algorithms. Inspired by dualism and dominance in nature, genetic algorithms with the dualism mechanism have been applied for several dynamic problems with binary encoding. This paper investigates the idea of dualism for combinatorial optimization problems in dynamic environments, which are also extensively implemented in the real-world. A new variation of the GA, called the permutation-based dual genetic algorithm (PBDGA), is presented. Within this GA, two schemes based on the characters of the permutation in group theory are introduced: A partial-dualism scheme motivated by a new multi-attribute dualism mechanism and a learning scheme. Based on the dynamic test environments constructed by stationary benchmark problems, experiments are carried out to validate the proposed PBDGA. The experimental results show the efficiency of PBDGA in dynamic environments.
URI: http://hdl.handle.net/10397/17891
ISSN: 1432-7643
DOI: 10.1007/s00500-008-0345-5
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

6
Last Week
0
Last month
0
Citations as of Aug 18, 2017

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
0
Citations as of Aug 13, 2017

Page view(s)

31
Last Week
2
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.