The generic genetic algorithm incorporates with rough set theory - An application of the web services composition

Wen-Yau Liang, Chun Che Huang

Research output: Contribution to journalArticle

41 Citations (Scopus)

Abstract

Evolutionary computing (EC) techniques have been used traditionally used for solving challenging optimization problems. But the increase in data and information has reduced the performance capacity of the GA, but highlighted the cost of finding a solution by GA. In addition, the genetic algorithm employed in previous literature is modeled to solve one problem exactly. The GA needs to be redesigned, at a cost, for it to be applied to another problem. For these two reasons, this paper proposes a method for incorporating the GA and rough set theory. The superiority of the proposed GA in this paper lies in its ability to model problems and explore solutions generically. The advantages of the proposed solution approach include: (i) solving problems that can be decomposed into functional requirements, and (ii) improving the performance of the GA by reducing the domain range of the initial population and constrained crossover using rough set theory. The solution approach is exemplified by solving the problem of web services composition, where currently the general analysis and selection of services can be excessively complex and un-systemic. Based on our experimental results, this approach has shown great promise and operates effectively.

Original languageEnglish
Pages (from-to)5549-5556
Number of pages8
JournalExpert Systems with Applications
Volume36
Issue number3 PART 1
DOIs
Publication statusPublished - 2009 Jan 1

Fingerprint

Rough set theory
Web services
Genetic algorithms
Chemical analysis
Costs

All Science Journal Classification (ASJC) codes

  • Engineering(all)
  • Computer Science Applications
  • Artificial Intelligence

Cite this

@article{c500dfe3e02c4ec08263ce6ef0183f19,
title = "The generic genetic algorithm incorporates with rough set theory - An application of the web services composition",
abstract = "Evolutionary computing (EC) techniques have been used traditionally used for solving challenging optimization problems. But the increase in data and information has reduced the performance capacity of the GA, but highlighted the cost of finding a solution by GA. In addition, the genetic algorithm employed in previous literature is modeled to solve one problem exactly. The GA needs to be redesigned, at a cost, for it to be applied to another problem. For these two reasons, this paper proposes a method for incorporating the GA and rough set theory. The superiority of the proposed GA in this paper lies in its ability to model problems and explore solutions generically. The advantages of the proposed solution approach include: (i) solving problems that can be decomposed into functional requirements, and (ii) improving the performance of the GA by reducing the domain range of the initial population and constrained crossover using rough set theory. The solution approach is exemplified by solving the problem of web services composition, where currently the general analysis and selection of services can be excessively complex and un-systemic. Based on our experimental results, this approach has shown great promise and operates effectively.",
author = "Wen-Yau Liang and Huang, {Chun Che}",
year = "2009",
month = "1",
day = "1",
doi = "10.1016/j.eswa.2008.06.084",
language = "English",
volume = "36",
pages = "5549--5556",
journal = "Expert Systems with Applications",
issn = "0957-4174",
publisher = "Elsevier Limited",
number = "3 PART 1",

}

The generic genetic algorithm incorporates with rough set theory - An application of the web services composition. / Liang, Wen-Yau; Huang, Chun Che.

In: Expert Systems with Applications, Vol. 36, No. 3 PART 1, 01.01.2009, p. 5549-5556.

Research output: Contribution to journalArticle

TY - JOUR

T1 - The generic genetic algorithm incorporates with rough set theory - An application of the web services composition

AU - Liang, Wen-Yau

AU - Huang, Chun Che

PY - 2009/1/1

Y1 - 2009/1/1

N2 - Evolutionary computing (EC) techniques have been used traditionally used for solving challenging optimization problems. But the increase in data and information has reduced the performance capacity of the GA, but highlighted the cost of finding a solution by GA. In addition, the genetic algorithm employed in previous literature is modeled to solve one problem exactly. The GA needs to be redesigned, at a cost, for it to be applied to another problem. For these two reasons, this paper proposes a method for incorporating the GA and rough set theory. The superiority of the proposed GA in this paper lies in its ability to model problems and explore solutions generically. The advantages of the proposed solution approach include: (i) solving problems that can be decomposed into functional requirements, and (ii) improving the performance of the GA by reducing the domain range of the initial population and constrained crossover using rough set theory. The solution approach is exemplified by solving the problem of web services composition, where currently the general analysis and selection of services can be excessively complex and un-systemic. Based on our experimental results, this approach has shown great promise and operates effectively.

AB - Evolutionary computing (EC) techniques have been used traditionally used for solving challenging optimization problems. But the increase in data and information has reduced the performance capacity of the GA, but highlighted the cost of finding a solution by GA. In addition, the genetic algorithm employed in previous literature is modeled to solve one problem exactly. The GA needs to be redesigned, at a cost, for it to be applied to another problem. For these two reasons, this paper proposes a method for incorporating the GA and rough set theory. The superiority of the proposed GA in this paper lies in its ability to model problems and explore solutions generically. The advantages of the proposed solution approach include: (i) solving problems that can be decomposed into functional requirements, and (ii) improving the performance of the GA by reducing the domain range of the initial population and constrained crossover using rough set theory. The solution approach is exemplified by solving the problem of web services composition, where currently the general analysis and selection of services can be excessively complex and un-systemic. Based on our experimental results, this approach has shown great promise and operates effectively.

UR - http://www.scopus.com/inward/record.url?scp=58349089674&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=58349089674&partnerID=8YFLogxK

U2 - 10.1016/j.eswa.2008.06.084

DO - 10.1016/j.eswa.2008.06.084

M3 - Article

AN - SCOPUS:58349089674

VL - 36

SP - 5549

EP - 5556

JO - Expert Systems with Applications

JF - Expert Systems with Applications

SN - 0957-4174

IS - 3 PART 1

ER -