By Topic

A parallel hybrid GA for combinatorial optimization using grid technology

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)
Tang Jing ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore ; Meng Hiot Lim ; Yew Soon Ong

In this paper, we consider a parallel hybrid-GA (PHGA) for solving large combinatorial optimization problem. The approach of our PHGA is based on the island model whereby islands of subpopulations are farmed to multiple processing nodes for execution. The PHGA was applied to solve the quadratic assignment problems (QAP) to demonstrate the potential effectiveness of the models. In particular, we concentrate on QAP benchmarks of high complexity for n ranging from 60 to 256. Our results show that a two-island PHGA which employs a simplistic elite migration between islands outperforms the serial hybrid-GA (SHGA) significantly. As the size and complexity of the problem increases, the advantage of the PHGA in terms of computation time and solution quality becomes more evident. This opens up a wide channel for further exploration on implementation of the PHGA in a grid computing environment.

Published in:

Evolutionary Computation, 2003. CEC '03. The 2003 Congress on  (Volume:3 )

Date of Conference:

8-12 Dec. 2003