@article{Fuentes-Penna_Estrada-Carrillo_Flores-Jiménez_Flores-Jiménez_Moreno-Gutiérrez_2014, title={Meta-Heuristic Algorithm based on Ant Colony Optimization Algorithm, Tabu Search and Project Scheduling Problem (PSP) for the Traveling Salesman Problem}, volume={5}, url={https://ijcopi.org/ojs/article/view/63}, abstractNote={<p><em>Traveling Salesman Problem (TSP) is focused to construct the path with the lowest distance between different places (nodes), visiting every one once. This paper proposed an algorithm to solve TSP adding three aspects: time, cost and effort, where the effort is calculated multiplying time, distance and cost factors and dividing by the sum of them; the aim of this estimation is optimizing the best way to visit the cities graph.</em></p>}, number={3}, journal={International Journal of Combinatorial Optimization Problems and Informatics}, author={Fuentes-Penna, Alejandro and Estrada-Carrillo, Marisa and Flores-Jiménez, Ivette and Flores-Jiménez, Ruth and Moreno-Gutiérrez, Silvia S.}, year={2014}, month={Nov.}, pages={2–15} }