Affiliation:
1. Escuela Superior de Tlahuelilpan – Universidad Autónoma del Estado de Hidalgo (ESTl – UAEM) Mexico
2. Universidad Autónoma de Ciudad del Carmen., Mexico
Abstract
The main target of Traveling Salesman Problem (TSP) is to construct the path with the lowest time between different cities, visiting every one once. The Scheduling Project Ant Colony Optimization (SPANCO) Algorithm proposes a way to solve TSP problems adding three aspects: time, cost effort and scope, where the scope is the number of cities, the effort is calculated multiplying time, distance and delivering weight factors and dividing by the sum of them and optimizing the best way to visit the cities graph.
Publisher
North Atlantic University Union (NAUN)
Reference31 articles.
1. Dorigo M, Optimization, learning and natural algorithms. PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy, 1992 [in Italian].
2. E. Bonabeau, M. Dorigo and G. Theraulaz, Swarm Intelligence: From Natural to Artificial Systems. New York, NY: Oxford University Press, 1999.
3. Fuentes-Penna A., Ruiz-Vanoye J., PathiyamattomJoseph S. and Fernández-Medina M. A. Linear Responsibility Chart for PSP. 2011 Electronics, Robotics and Automotive Mechanics Conference
4. Huang, W., Ling, L., Wen, B., Cao, B. (2009). Project Scheduling Problem for Software Development with Random Fuzzy Activity Duration Times. Advances in Neural Networks – ISNN 2009. 6th International Symposium on Neural Networks, ISNN 2009. Wuhan, China, May 2009 Proceedings, Part II. Springer. LNCS 5552. ISSN: 0302-9743. ISBN-10: 3-642- 01509-3. ISBN.13: 978-3-642-01509-0
5. Ruiz-Vanoye Jorge A., Pathiyamattom-Joseph Sebastian. y Fernández-Medina Miguel A. and Fuentes-Penna A. Project Scheduling Problem for Software Development Library – PSPSWDLIB. Revista de Ciências da Computação, 2010, nº5.