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

Authors

  • Gabriela F. Minetti Facultad de Informática - UNLP, Argentina

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.

Downloads

Download data is not yet available.

Downloads

Published

2001-05-01

How to Cite

Minetti, G. F. (2001). An evolutive computation solution for the TSP: possible application to organizations. Journal of Computer Science and Technology, 1(04), 3 p. Retrieved from https://journal.info.unlp.edu.ar/JCST/article/view/990

Issue

Section

Thesis Overview

Most read articles by the same author(s)