By Topic

Sequential and parallel path-relinking algorithms for the quadratic assignment problem

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)
James, T. ; Dept. of Bus. Inf. Technol., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA ; Rego, C. ; Glover, F.

The quadratic assignment problem, a classical combinatorial optimization problem, has garnered much attention due to its many applications and solution complexity. This research represents the first use of parallelization for path relinking within the QAP setting. We used a simple form of path relinking to focus on the parallel implementation's elements and to determine their impact when used with a method of this type. Our computational results demonstrate highly attractive outcomes despite the procedure's simplicity and show in particular the value of a well-designed parallelization process in this context.

Published in:

Intelligent Systems, IEEE  (Volume:20 ,  Issue: 4 )