Results 101 to 110 of about 21,266 (220)
Ingeniare: Revista Chilena de Ingeniería, 2011 En este trabajo se estudió el problema de secuenciamiento de trabajos en el taller de flujo de permutación con tiempos de preparación dependientes de la secuencia y minimización de makespan.
Eduardo Salazar Hornig +1 more
doaj
DynaThe traveling salesman problem (TSP) is the canonical combinatorial optimization problem famous throughout literature. There exists an objective function associated with every feasible solution.
Jerry L. Shaw +4 more
doaj +1 more source
The Application of Ant Colony Algorithm in Solve the Traveling Salesman Problem with Fuzzy Movement Time among Cities [PDF]
Muṭāli̒āt-i Mudīriyyat-i Ṣan̒atī, 2010 Traveling salesman problem (TSP) is one of the most well-known combinational optimization problems which recently has been a suitable base to validate different heuristic and Meta heuristic algorithms.
Jamshid Salehi Sadaghiani
doaj
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation, 1997 M. Dorigo, L. Gambardella
semanticscholar +1 more source
A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
Annals of Operations ResearchAbstract The traveling salesman (or salesperson) problem, short TSP, is of strong interest to many researchers from mathematics, economics, and computer science. Manifold TSP variants occur in nearly every scientific field and application domain: e.g., engineering, physics, biology, life sciences, and manufacturing.
Sophia Saller +2 more
openaire +2 more sources
LEADERS AND FOLLOWERS ALGORITHM FOR TRAVELING SALESMAN PROBLEM
BarekengLeaders and Followers algorithm is a metaheuristics algorithm. In solving continuous optimization, this algorithm is proved to be better than other well-known algorithms, such as Genetic Algorithm and Particle Swarm Optimization. This paper aims to apply
Helen Yuliana Angmalisang, Syaiful Anam
doaj +1 more source
Coevolutionary Memetic Algorithms for Solving Traveling Salesman Problem (TSP)
, 2013 ABSTRACT: In this thesis, Coevolutionary Memetic Algorithms are used for solving the well-known Traveling Salesman Problem (TSP). Traveling Salesman Problem is NP-Complete which means no algorithm can solve this problem in a computing time that increases polynomially with respect to the problem size.
openaire +1 more source
Solving the Traveling Salesman Problem Using a Modified Teaching-Learning Based Optimization Algorithm [PDF]
International Journal of Industrial Engineering and Production ResearchThe Traveling Salesman Problem (TSP) is a well-known problem in optimization and graph theory, where finding the optimal solution has always been of significant interest.
Ahmad Aliyari Boroujeni, Ameneh Khadivar
doaj
IAM-TSP: Iterative Approximate Methods for Solving the Travelling Salesman Problem
International Journal of Advanced Computer Science and Applications, 2023 Esra’a Alkafaween +5 more
openaire +1 more source
Multi-type ant colony system for solving the multiple traveling salesman problem.
Revista Técnica de la Facultad de Ingeniería, 2013 The Multiple Traveling Salesman problem (mTSP) is an extension of the well-known Traveling Sales- man Problem (TSP), where more than one salesman is allowed to be used in order to visit some cities just once.
Yasel José Costa Salas +3 more
doaj