Travelling Salesman Problem solved 'in materio' by evolved carbon nanotube device

Created by W.Langdon from gp-bibliography.bib Revision:1.4524

  author =       "Kester Clegg and Julian Miller and Kieran Massey and 
                 Mike Petty",
  title =        "Travelling Salesman Problem solved 'in materio' by
                 evolved carbon nanotube device",
  booktitle =    "13th International Conference on Parallel Problem
                 Solving from Nature",
  year =         "2014",
  editor =       "Thomas Bartz-Beielstein and Juergen Branke and 
                 Bogdan Filipic and Jim Smith",
  publisher =    "Springer",
  isbn13 =       "978-3-319-10761-5",
  pages =        "692--701",
  series =       "Lecture Notes in Computer Science",
  address =      "Ljubljana, Slovenia",
  month =        "13-17 " # sep,
  volume =       "8672",
  keywords =     "genetic algorithms, genetic programming, Cartesian
                 genetic programming",
  DOI =          "doi:10.1007/978-3-319-10762-2_68",
  abstract =     "We report for the first time on finding shortest path
                 solutions for the travelling salesman problem (TSP)
                 using hybrid in materio computation: a technique that
                 uses search algorithms to configure materials for
                 computation. A single-walled carbon nanotube (SWCNT) /
                 polymer composite material deposited on a
                 micro-electrode array is configured using static
                 voltages so that voltage output readings determine the
                 path order in which to visit cities in a TSP. Our
                 initial results suggest that the hybrid computation
                 with the SWCNT material is able to solve small
                 instances of the TSP as efficiently as a comparable
                 evolutionary search algorithm performing the same
                 computation in software. Interestingly the results
                 indicate that the hybrid system's search performance on
                 TSPs scales linearly rather than exponentially on these
                 smaller instances. This exploratory work represents the
                 first step towards building SWCNT-based electrode
                 arrays in parallel so that they can solve much larger
  notes =        "up to 12 cities. 1+4-EA. TSP path approx 20th of an
                 inch. SWCNT-PMMA carbon needles mixed with PMMA in
                 Anisole. Comparison with Cartesian genetic programming.
                 Ten fold improvement in CGP.",

Genetic Programming entries for Kester Clegg Julian F Miller Kieran Massey Mike Petty