By Topic

A Problem Solving Environment for Combinatorial Optimization Based on Parallel Meta-heuristics

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

4 Author(s)
Rong Huang ; Northwestern Polytech. Univ., Xi''an ; Shurong Tong ; Weihua Sheng ; Zhun Fan

Computational grid offers a great potential solution to parallel meta-heuristics toward combinatorial optimization. However, it is quite difficult for specialists in combinatorial optimization to develop parallel meta-heuristics in extremely heterogeneous computational environment, starting from scratch without any toolkit. This paper presents a problem solving environment for combinatorial optimization based on parallel meta-heuristics (PSEPMH) to help specialists to harness heterogeneous computational resources and handle dynamic granularity control. PSEPMH requires specialist to decompose one problem into two sub-problems with divide-and-conquer framework just as generic sequential algorithm. Then compiler of PSEPMH generates mobile agent code that automatically forms adaptive multi-granularity parallel computing at runtime by cloning himself and distributing along dynamic, complex grid environment with the support of PSEPMH. Not only can PSEPMH relieve specialists' burden, but also make use of the computational resources more efficiently.

Published in:

Computational Intelligence in Robotics and Automation, 2007. CIRA 2007. International Symposium on

Date of Conference:

20-23 June 2007