By Topic

Solving Temporal Constraint Satisfaction Problems with Heuristic Based Evolutionary Algorithms

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

2 Author(s)
Jashmi, B.J. ; Comput. Sci. Dept., Univ. of Regina, Regina, SK ; Mouhoub, M.

In this paper we discuss the applicability of evolutionary algorithms enhanced by heuristics and adaptive fitness computation for solving the temporal constraint satisfaction problem (TCSP). This latter problem is an extension of the well known CSP, through our TemPro model, in order to handle numeric and symbolic temporal information. We test the evolutionary algorithms on randomly generated TCSPs and analyze and compare the performance of the algorithms tested, based on different measures. The results show that heuristics do not promise better performance for solving TCSPs. The basic genetic algorithm (GA) and microgenetic iterative descendant (MGID) are the most effective ones. We also noticed that MGID is more efficient than basic GA for easier problems.

Published in:

Tools with Artificial Intelligence, 2008. ICTAI '08. 20th IEEE International Conference on  (Volume:2 )

Date of Conference:

3-5 Nov. 2008