- -

Solución al Problema de Secuenciación de Trabajos mediante el Problema del Agente Viajero

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Solución al Problema de Secuenciación de Trabajos mediante el Problema del Agente Viajero

Show full item record

Anaya Fuentes, G.; Hernández Gress, E.; Seck Tuoh Mora, J.; Medina Marín, J. (2016). Solución al Problema de Secuenciación de Trabajos mediante el Problema del Agente Viajero. Revista Iberoamericana de Automática e Informática industrial. 13(4):430-437. https://doi.org/10.1016/j.riai.2016.07.003

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/143544

Files in this item

Item Metadata

Title: Solución al Problema de Secuenciación de Trabajos mediante el Problema del Agente Viajero
Secondary Title: Solution of the Job-Shop Scheduling Problem through the Traveling Salesman Problem
Author: Anaya Fuentes, G.E. Hernández Gress, E.S. Seck Tuoh Mora, J.C. Medina Marín, J.
Issued date:
Abstract:
[ES] En este trabajo se estudia el Problema de Secuenciación de Trabajos codificado como un Problema de Agente Viajero y resuelto mediante Algoritmos Genéticos. Se propone un Algoritmo Genético en donde se comparan dos ...[+]


[EN] In this paper we proposed a solution to the Job-Shop Scheduling Problem using the Traveling Salesman Problem solved by Genetic Algorithms. We proposed a genetic algorithm where we compare two types of selection: ...[+]
Subjects: Efficient algorithms , Industrial production systems , Optimization problem , Traveling salesman problem , Algoritmos eficientes , Sistemas industriales de producción , Problemas de optimización , Problema de agente viajero
Copyrigths: Reconocimiento - No comercial - Sin obra derivada (by-nc-nd)
Source:
Revista Iberoamericana de Automática e Informática industrial. (issn: 1697-7912 ) (eissn: 1697-7920 )
DOI: 10.1016/j.riai.2016.07.003
Publisher:
Universitat Politècnica de València
Publisher version: https://doi.org/10.1016/j.riai.2016.07.003
Type: Artículo

References

Beasley, J., 1990.OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 11, 1069-1072.

Bektas, T., 2006. The multiple traveling salesman problem: an overview of formulations and solution procedures, 34,209-219.

Bozejko, W., Pempera J. and Smuntnicki C., 2009. Parallel simulated annealing for the Job Shop Scheduling problem. Biological Cybernetics, 60, 139-144. [+]
Beasley, J., 1990.OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 11, 1069-1072.

Bektas, T., 2006. The multiple traveling salesman problem: an overview of formulations and solution procedures, 34,209-219.

Bozejko, W., Pempera J. and Smuntnicki C., 2009. Parallel simulated annealing for the Job Shop Scheduling problem. Biological Cybernetics, 60, 139-144.

Buthainah F. and Hamza A., 2008. Enhanced Traveling Salesman Problem solving by Genetic Algorithm Technique. World Academy of Science, Engineering and Technology,38, 298-302.

Cerny, V., 1985. Thermodynamical Approach to the Traveling Salesman Problem: An Efficient Simulation Algorithm. Lecture note in computer science Proceedings of the 9th Intenational Conference on Computational Science, 5544, 631-640.

Chambers, L., 1998. Genetic Algorithms. University Western Press, Australia.

Chatterjee, S., Carrera C., and Linch L., 1996. Genetic Algorithms and traveling salesman problems. Siam Journal of Optimation, 515-529.

Chunguo, W., Wei X., and Yanchun L., 2004. A Modified Integer-Coding Genetic Algorithm for Job Shop Scheduling Problem, Trends in Artificial Intelligence. Lecture Notes in Computer Science Volum 3157,373-380.

Delgado E., 2005. Aplicación de Algoritmos Genéticos para la Programación de Tareas de una celda de manufactura. Ingeniería e Investigación: Universidad Nacional de Colombia, 24-31.

Dorigo, M., 1997. Ant colonies for the traveling salesman problem. Universidad Libre de Bruselas, Bélgica.

Fogel, D., 1998. An evolutionary approach to the traveling salesman problem. Biological Cybernetics, 60, 139-144.

Gao, S., Zhang L, and Zhang F. 2007. g. Solving Traveling Salesman Problem by Ant Colony Optimization Algorithm with Association Rule Proceedings of the Third International Conference on Natural Computation, 3, 693-698.

Ge, H., Du W., y Quian F., 2007. A hybrid algorithm based on swarm optimization and simulated annealing for job shop scheduling. Proceedings of the Third International Conference on Natural Computation, 3, 715-719.

Gerhard, R., 2006. Discrete and Combinatorial Optimization. Universidad de Heidelberg-Instituto de Ciencias de la Computación, Alemania.

Goldberg, D., 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Publishing Corporation, Estados Unidos de América.

Holland, J., 1992. Adaptation in Natural and Artificial Systems. MIT Press, Cambridge, Estados Unidos de América.

Jog, P., Kim J., Suh J., y Gucht D., 1991. Parallel Genetic Algorithms Applied to the Traveling Salesman Problem. European Journal of Operational Research, 490-510.

Juang, C., 2004. A hybrid genetic algorithm and particle swarm optimization for recurrent network design. IEEE Transactions on Evolutionary Computation, 34, 997-1006.

Larrañaga, P., Kuijpers C., Murga R., Inza I., y Dizdarevic S., 1999. Genetic Algorithms for the Traveling Salesman Problem: A review of Representations and Operators. Artificial Intelligence Review, 129-170.

Maldonado C. 2010. El mundo de las ciencias de la complejidad: Una investigación sobre qué son, su desarrollo y sus posibilidades. Universidad del Rosario.

Moon, C., Kim J., Choi G., y Seo Y., 2002. An efficient genetic algorithm for the traveling salesman problem with precedent constraints. European Journal of Operational Research, 606-617.

Ruiz, J., 2011. Complexity Indicators Applied to the Job Shop Scheduling Problem. International Journal of Combinatorial Optimization Problems and Informatics, 25-31.

Sivanamdam, S. y Deepa S, 2008. Introduction to Genetic Algorithms. Springer, Estados Unidos de América.

Tamilarasi, A. y Anantha K., 2010. An enhanced genetic algorithm with simulated annealing for jobshop scheduling. International Journal of Engineering Science and Technology 2, 144-151.

Wagner, H, 1975. Principles of Operations Research. 2ª ed. Englewood Cliffs, N.J. Prentice Hall, Estados Unidos de América.

Winston, W., 2005. Investigación de Operaciones: Aplicaciones y Algoritmos. Indiana University Press, Estados Unidos de América.

Yamada T., y Nakano R., 1997. Genetic Algorithms for Job Shop Scheduling. Proceedings of Modern Heuristic for Decision Support, UNICOM Seminar London, 67-81.

[-]

This item appears in the following Collection(s)

Show full item record