Morphing: Combining Structure and Randomness

Ian P. Gent, University of Strathclyde; Holger H. Hoos, University of British Columbia; Patrick Prosser and Toby Walsh, University of Strathclyde

We introduce a mechanism called "morphing" for introducing structure or randomness into a wide variety of problems. We illustrate the usefulness of morphing by performing several different experimental studies. These studies identify the impact of a "small-world" topology on the cost of coloring graphs, of asymmetry on the cost of finding the optimal TSP tour, and of the dimensionality of space on the cost of finding the optimal TSP tour. We predict that morphing will find many other uses.

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.