Consider the Traveling Salesman Problem which is NP-complete…
Consider the Traveling Salesman Problem which is NP-complete. In this problem, you are given a list of cities and the distance between each pair of cities. Typically, this is represented by a complete graph G(V,E) of vertices V representing the cities and edge lengths E representing the distance between each pair of cities. The goal of this problem is to find the shortest path that visits each city exactly once and returns to the origin city. How would you design a fitness function to use in a genetic algorithm for the Traveling Salesman Problem? You may assume that paths that do not meet the requirements of the problem have fitness zero.
Read DetailsOrganisms, road networks, and computer chips all share a des…
Organisms, road networks, and computer chips all share a design challenge related to the problem of delivering resources through a network to every node in the system. How does the size of the resource distribution network of these three systems grow with respect to system size?
Read DetailsIn the paper “Immunity by Design: An Artificial Immune Syste…
In the paper “Immunity by Design: An Artificial Immune System,” detection of foreign material is simulated by partial string matching using the r-contiguous bits rule. This rule states that two strings match iff they have the same symbols in at least r contiguous bit positions. The value of r determines how specific the detectors are. The authors of the paper mention a tradeoff that using this rule presents. What is this tradeoff?
Read Details