By Topic

Combinatorial problem solving using randomized dynamic tunneling on a production system

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
$33 $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

1 Author(s)
Y. Kanada ; Tsukuba Res. Center, Ibaraki, Japan

Levy and Montalvo (1985), Yao (1989), and Shima (1993) individually proposed tunneling algorithms. The tunneling algorithms employ analogy to the tunnel effect in physics, and are used to optimize continuous systems. The present paper proposes a method of solving combinatorial problems using a type of randomized dynamic tunneling technique. This method is based on a computational model called CCM*. CCM* is an extended version of the Chemical Casting Model (CCM). CCM was proposed by the author toward developing a method of solving open and incompletely-specified problems that may change while being solved, using self-organizing computation. The 0-1 integer programming problem is solved using CCM* with a very simple rule and an evaluation function. CCM* allows one to escape from local maxima by composing the rule dynamically and randomly. This cannot be done by using the original production rule. The author's experiments show that approximate solutions can be found more rapidly by CCM* than by using a branch-and-bound method in the case of 0-1 integer programming

Published in:

Systems, Man and Cybernetics, 1995. Intelligent Systems for the 21st Century., IEEE International Conference on  (Volume:4 )

Date of Conference:

22-25 Oct 1995