JabRef references

de León EP and Santana R (1997), "A genetic algorithm and a local search procedure for a Hamiltonian path problem", In Memorias del Encuentro Latino Iberoamericano de Optimización, I ELIO. Congreso Chileno de Investigación Operativa OPTIMA 97.. University of Conception, Chile, November 3-6, 1997. , pp. 226-232.

[Abstract] [BibTeX]

Abstract: This paper deals with Hávels conjecture that asserts that all bipartite graph formed with the middle levels of n-dimensional cube is Hamiltonian, when n is odd. This means that at
least one Hamiltonian cycle should be found in the graph.
We use a circular representation of the vertices of n-dimensional cube which make it
possible to introduce two group actions in order to reduce the problem to find out a
Hamiltonian path in multi - level quotient graphs.
We report on a hybrid genetic algorithm for the Hávels conjecture problem. We present
interesting results which show that this GA approach gives optimal solutions in multi-
level quotient graph. We use bitstring representation, an evolutionary fitness function,
restricted edge crossover operator, intelligent mutation, seeding and adaptive mutation
rate. Three Hamiltonian path are constructed with this method.

BibTeX:

@inproceedings{Ponce_and_Santana:1997,
  author = {E. Ponce de León and R. Santana},
  title = {A genetic algorithm and a local search procedure for a Hamiltonian path problem},
  booktitle = {Memorias del Encuentro Latino Iberoamericano de Optimización, I ELIO. Congreso Chileno de Investigación Operativa OPTIMA 97.},
  year = {1997},
  pages = {226-232}
}

de León EP, Santana R and Maldonado F (1997), "Algoritmos Genéticos y el problema del teñido de telas en la Industria Textil", In Proceedings of the First Symposium on Artificial Intelligence (CIMAF-97). Havana, Cuba, March, 1997. , pp. 18-28. Editora de la Academia de Ciencias de Cuba.

[Abstract] [BibTeX]

Abstract: La importancia práctica de la búsqueda de una secuencia de colores óptima en el proceso de teñido de prendas es bien conocido en el ambiente textil. Nosotros presentamos un enfoque a este problema utilizando Algoritmos Genéticos (AGs). Ellos han mostrado eficientes resultados en multiples problemas del mundo real. Su fuente de origen fue la observación, por parte de los investigadores de las ciencias de la computación, de los procesos de optimización que ocurren en la naturaleza. La modelación matem/'atica del problema nos conduce a identificarlo como el problema del viajante de comercio asimétrico. Se diseña una familia de AGs para el problema en cuestión. Un operador de entrecruzamiento es introducido. La función de adaptabilidad aprovecha información en los dos sentidos de la secuencia de colores a evaluar. Se presentan diferentes formas de aprovechar el conocimiento heurístico del problema. Resultados de este primer acercamiento al problema con AG son discutidos.

BibTeX:

@inproceedings{Ponce_et_al:1997,
  author = {E. Ponce de León and R. Santana and F. Maldonado},
  title = {Algoritmos Genéticos y el problema del teñido de telas en la Industria Textil},
  booktitle = {Proceedings of the First Symposium on Artificial Intelligence (CIMAF-97)},
  publisher = {Editora de la Academia de Ciencias de Cuba},
  year = {1997},
  pages = {18-28}
}

de León EP, Santana R, Brito I and Maldonado F (1997), "Análisis de una familia de algoritmos genéticos para un problema de secuencias en el teñido de telas", In Memorias del Encuentro Latino Iberoamericano de Optimización, I ELIO. Congreso Chileno de Investigación Operativa OPTIMA 97.. University of Conception, Chile, November 3-6, 1997.

[BibTeX]

BibTeX:

@inproceedings{Ponce_et_al:1997a,
  author = {E. Ponce de León and R. Santana and I. Brito and F. Maldonado},
  title = {Análisis de una familia de algoritmos genéticos para un problema de secuencias en el teñido de telas},
  booktitle = {Memorias del Encuentro Latino Iberoamericano de Optimización, I ELIO. Congreso Chileno de Investigación Operativa OPTIMA 97.},
  year = {1997},
  note = {In Spanish}
}

de León EP, Santana R and Ochoa A (1997), "A genetic algorithm for a Hamiltonian path problem: Mutation - crossover interaction", In Proceedings of the 13th ISPE/IEE International Conference on CAD/CAM Robotics and Factories of the Future 97. Universidad Tecnológica de Pereira, Colombia, December, 1997. , pp. 1001-1006.

[Abstract] [BibTeX]

Abstract: The GA method is especially useful in cases when the hypersurface, in which the optimum is searched, is of a high dimension and has many local optima. The complexity of such problems renders an exhaustive search through the space (using, for example, a grid search) useless. Due to local optima, there is a danger that direct optimization methods stop far away from the global optimum.

BibTeX:

@inproceedings{Ponce_et_al:1997b,
  author = {E. Ponce de León and R. Santana and A. Ochoa},
  title = {A genetic algorithm for a Hamiltonian path problem: Mutation - crossover interaction},
  booktitle = {Proceedings of the 13th ISPE/IEE International Conference on CAD/CAM Robotics and Factories of the Future 97},
  year = {1997},
  pages = {1001-1006}
}

de León EP, Santana R and Maldonado F (1997), "Algoritmos Genéticos y el problema del teñido de telas en la Industria Textil", Revista Latinoamericana de Tecnología Textil. IPN, Meexico Vol. 1(8), pp. 49-58.

[Abstract] [BibTeX]

BibTeX:

@article{Ponce_et_al:1997c,
  author = {E. Ponce de León and R. Santana and F. Maldonado},
  title = {Algoritmos Genéticos y el problema del teñido de telas en la Industria Textil},
  journal = {Revista Latinoamericana de Tecnología Textil},
  year = {1997},
  volume = {1},
  number = {8},
  pages = {49--58},
  note = {In Spanish}
}

de León EP, Ochoa A and Santana R (1997), "A Genetic Algorithm for a Hamiltonian Path Problem", In Proceedings of the X International Conference on Industrial and Engineering Applications of AI and Expert Systems. Atlanta. USA , pp. 13-19.

[Abstract] [BibTeX] [URL]

Abstract: The genetic algorithm (GA) is one of the stochastic search techniques with application to a wide variety of combinatorial optimization problems.
A conjecture of I. Havel, also attributed to P. Erdos, asserts that the simple graph G(k+1) (k>0), whose vertices are the subsets of cardinalities k and k+1 of the set 0,...,2k and whose adjacency is given by subset inclusion, is Hamiltonian. The search of a Hamiltonian cycle in this graph is reduced to find a Hamiltonian path in the multi-level graph. In this paper we describe a GA approach to this conjecture. We present theoretical and computational results which show that this GA approach finds the optimal solutions when we search path for each level of the graph. We introduce an evolutive fitness function, and discuss the impact of using non standard crossover operators. Seeding and adaptive mutation rate are used. Hamiltonian cycle in G(6) and G(7) are constructed.

BibTeX:

@inproceedings{Ponce_et_al:1997d,
  author = {E. Ponce de León and A. Ochoa and R. Santana},
  title = {A Genetic Algorithm for a Hamiltonian Path Problem},
  booktitle = {Proceedings of the X International Conference on Industrial and Engineering Applications of AI and Expert Systems},
  year = {1997},
  pages = {13--19},
  url = {http://books.google.es/books?hl=en&lr=&id=48FMFE2VwPkC&oi=fnd&pg=PA13&dq=info:otJvizwCRqsJ:scholar.google.com&ots=ubH-ZHpGno&sig=CGpqtfPgODzPRVIrwx2YkdG92yU&redir_esc=y#v=onepage&q&f=false}
}

Santana R and de León EP (1997), "A hybrid genetic algorithm for a Hamiltonian path problem", In Proceedings of the First Symposium on Artificial Intelligence (CIMAF-97). Havana, Cuba, March, 1997. , pp. 126-132. Editora de la Academia de Ciencias de Cuba.

[BibTeX]

BibTeX:

@inproceedings{Santana_and_Ponce:1997,
  author = {R. Santana and E. Ponce de León},
  title = {A hybrid genetic algorithm for a Hamiltonian path problem},
  booktitle = {Proceedings of the First Symposium on Artificial Intelligence (CIMAF-97)},
  publisher = {Editora de la Academia de Ciencias de Cuba},
  year = {1997},
  pages = {126-132}
}