An evolutive computation solution for the TSP: possible application to organizations

Abstract

This Thesis researches a possible improvement in the performance of the solution of certain NP-hard combinatorial optimization problems . Examples of these are pure sequencing problems. A summary of conventional methods is presented, and a comparison with those belonging to the field of Evolutive Computation is made. Also, a proposal of eventual improvements to the latter is included. The practical applications discussed in this thesis are strongly related to administration, network design in general, and circuit design.