Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

A novel stochastic method with modified extremal optimization and nearest neighbor search for hard combinatorial problems

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)
Guo-Qiang Zeng ; State Key Lab. of Ind. Control Technol., Zhejiang Univ., Hangzhou, China ; Yong-Zai Lu ; Wei-Jie Mao

The combinatorial optimization occurs in many real-world problems including the fields of engineering, physics and economics. It has been recognized that some problems with highly degenerate states are difficult to solve in terms of many existing optimization algorithms. This paper proposes a novel stochastic method with modified extremal optimization (EO) and nearest neighbor search to deal with these problems. It starts from making use of the recent discovered statistical property to generate the initial configurations by the nearest neighbor search and then further explores the complex configuration spaces by a modified EO approach that applies more general probability distributions-based evolution mechanism. The experimental results with some hard instances of traveling salesman problem (TSP), a popular benchmark for combinatorial optimization problems demonstrate that the proposed method may provide better performance than other physics-inspired algorithms such as simulated annealing, EO and self-organized algorithm.

Published in:

Intelligent Control and Automation (WCICA), 2010 8th World Congress on

Date of Conference:

7-9 July 2010