An evolutive computation solution for the TSP: possible application to organizations
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 Co...
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Articulo Revision |
| Lenguaje: | Inglés |
| Publicado: |
2001
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/50885 http://journal.info.unlp.edu.ar/wp-content/uploads/to2.pdf |
| Aporte de: |
| Sumario: | 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. |
|---|