By Topic

An Artificial Intelligence Algorithm for Multi-dimensional Knapsack Problem Based on Small World Phenomenon

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)
Du Wei ; Sch. of Manage., Xi''an Jiaotong Univ., Xi''an, China ; Li Shuzhuo

The genetic algorithm (GA) always loses diversity in the set of the candidate solutions and prematurely converges, when itpsilas used to solve the complex combinatorial optimization problems, such as 0-1 multi-dimensional knapsack problems. In order to overcome these shortcomings of GA, we propose an optimization algorithm for 0-1 multi-dimensional knapsack problems, called the binary-coding small world algorithm (BSWA), based on searching mechanisms in social networks. The BSWA emphasizes local rather (as mutation in GA) than global search (as crossover in GA) to find the solutions for optimization problems. Compared with the corresponding GA, the BSWA is capable of preserving diversity, avoiding premature convergence, and it converges faster. These properties suggest that the BSWA is a useful method for solving complicated optimization problems. The simulation studies show that the best known solutions of 72.73% of the 55 standard 0-1 knapsack problems can be found by the BSWA in each of the 50 independent runs and the final solutions found by the BSWA for the other problems are very close to the best known ones.

Published in:

Computer Science and Information Engineering, 2009 WRI World Congress on  (Volume:4 )

Date of Conference:

March 31 2009-April 2 2009