A constraint-guided method with evolutionary algorithms for economic problems

Nanlin Jin, Edward Tsang*, Jin Li

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)

Abstract

This paper presents an evolutionary algorithms based constrain-guided method (CGM) that is capable of handling both hard and soft constraints in optimization problems. While searching for constraint-satisfied solutions, the method differentiates candidate solutions by assigning them with different fitness values, enabling favorite solutions to be distinguished more likely and more effectively from unfavored ones. We illustrate the use of CGM in solving two economic problems with optimization involved: (1) searching equilibriums for bargaining problems; (2) reducing the rate of failure in financial prediction problems. The efficacy of the proposed CGM is analyzed and compared with some other computational techniques, including a repair method and a penalty method for the problem (1), a linear classifier and three neural networks for the problem (2), respectively. Our studies here suggest that the evolutionary algorithms based CGM compares favorably against those computational approaches.

Original languageEnglish
Pages (from-to)924-935
Number of pages12
JournalApplied Soft Computing
Volume9
Issue number3
DOIs
Publication statusPublished - Jun 2009
Externally publishedYes

Keywords

  • Constraint satisfaction
  • Economic problems
  • Genetic programming

Cite this