By Topic

Applying EGENET to solve continuous constrained optimization problems: a preliminary report

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
$33 $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)
V. Tam ; Dept. of Comput. Sci., Nat. Univ. of Singapore, Singapore

GENET and its extended model EGENET are artificial neural networks to efficiently solve finite constraint satisfaction problems such as the car-sequencing problems. Both models use the min-conflict heuristic to update every finite-domain variable for finding local minima, and then apply heuristic learning rule(s) to escape the local minima not representing solution(s). Since continuous and finite domains are completely different, researchers seldom considered to apply the EGENET approach to solve continuous constrained optimization problems. We consider an interesting proposal to modify the original EGENET model with the minimal effort for solving continuous constrained optimization problems. Our proposal immediately opens up new directions for studying many possible ways to approximate continuous domains using modified finite-domain solvers. Moreover, the preliminary benchmarks of our prototypes on some graph layout problems as practical examples demonstrated some advantages of our proposal which prompts for further investigation

Published in:

Information Intelligence and Systems, 1999. Proceedings. 1999 International Conference on

Date of Conference: