By Topic

Hybrid genetic algorithm for solving the computable general equilibrium model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Chuan-yu Xu ; Dept. of Math., Hangzhou Inst. of Commerce, China

It is a part of the main contents for mathematical economics to solve the equilibrium point of computable general equilibrium (CGE) models. Scarfs algorithm is the fundamental approach to this task. But, it depends on the number of subsimplices in unit simplex. The number is proportional to Zn-1. Therefore, the time complexity of Scarfs algorithm is G(Zn-1). To solve this problem, the hybrid genetic algorithm (HGA) is put forward. HGA has the mechanism combining the global optimization with the local optimization. HGA takes CGE as the problem of optimization and its solvent is the search for fixed point in unit complex. The time complexity of HGA does not depend on any subsimplex in unit simplex. The simulation example with n=3 shows that the time complexity of HGA is O(n) and the error is 0.01 resulted from HGA. However, under the same error of 0.01, the time complexity of Scarfs algorithm is O (1002). So HGA is efficient.

Published in:

Machine Learning and Cybernetics, 2004. Proceedings of 2004 International Conference on  (Volume:4 )

Date of Conference:

26-29 Aug. 2004