In this paper we revisit the idea of relating the genetic code to a Gray code. This idea was originally fostered by Rosemary Swanson as a “unifying concept for the amino acid code”. We show that cyclic arrangements of the codons which are different from the one proposed by Swanson, but which are still based on the principle of minimal change, yield a better grouping of the amino acids by simila...

Two instances of the traveling salesman problem, on the same node set (1,2 n} but with different cost matrices C and C , are equivalent iff there exist {a, hi:-1, n} such that for any 1 _ i, j _ n, j, C(i, j) C(i,j) q-at -bj [7]. One ofthe well-solved special cases of the traveling salesman problem (TSP) is the convex-hull-and-line TSP. We extend the solution scheme for this class of TSP given ...

All of the semantic minimalists come together in seeking to reduce contextual inputs in semantics to a minimum, but they disagree over what this quantity may be, and more specifically, the extent to which something can still be classed as “minimal”. With this issue increasingly addressed, three versions of semantic minimalism can be identified: weak, strong, and radical. They are still gathered...

We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...