A hybrid approach to constrained evolutionary computing: Case of product synthesis

Wen Yau Liang, Chun Che Huang

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Evolutionary computing (EC) is comprised of techniques involving evolutionary programming, evolution strategies, genetic algorithms (GA), and genetic programming. It has been widely used to solve optimization problems for large scale and complex systems. However, when insufficient knowledge is incorporated, EC is less efficient in terms of searching for an optimal solution. In addition, the GA 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. Due to these two reasons, this paper develops a generic GA incorporating knowledge extracted from the rough set theory. 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 initial population and constraining crossover using the rough set theory. The solution approach is exemplified by solving the problem of product synthesis, where there is a conflict between performance and cost. Manufacturing or assembling a product of high performance and quality at a low cost is critical for a company to maximize its advantages. Based on our experimental results, this approach has shown great promise and has reduced costs when the GA is in processing.

Original languageEnglish
Pages (from-to)1072-1085
Number of pages14
JournalOmega
Volume36
Issue number6
DOIs
Publication statusPublished - 2008 Dec 1

All Science Journal Classification (ASJC) codes

  • Strategy and Management
  • Management Science and Operations Research
  • Information Systems and Management

Fingerprint Dive into the research topics of 'A hybrid approach to constrained evolutionary computing: Case of product synthesis'. Together they form a unique fingerprint.

  • Cite this