By Topic

Improving the Performance of Heuristic Searches with Judicious Initial Point Selection

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

3 Author(s)
Tahaee, S.A. ; Comput. Eng. Dept., Sharif Univ. of Technol., Tehran ; Jahangir, A.H. ; Habibi-Masouleh, H.

In this paper we claim that local optimization can produce proper start point for genetic search. We completely test this claim on partitioning problem and on the performance of genetic search in a real problem that is finding aggregation tree in the sensor networks. The presented method (named Tendency algorithm) increases the performance of heuristic searches, and can be used in parallel with other tuning methods. The paper justifies the logic behind tendency algorithm by measuring the "entropy" of solution (in regard to optimal solution), and by numerous empirical tests.

Published in:

Embedded Computing, 2008. SEC '08. Fifth IEEE International Symposium on

Date of Conference:

6-8 Oct. 2008