Results 171 to 180 of about 15,296 (207)
Some of the next articles are maybe not open access.
High Performance Ant Colony Optimizer (HPACO) for Travelling Salesman Problem (TSP)
2014Travelling Salesman Problem (TSP) is a classical combinatorial optimization problem. This problem is NP-hard in nature and is well suited for evaluation of unconventional algorithmic approaches based on natural computation. Ant Colony Optimization (ACO) technique is one of the popular unconventional optimization technique to solve this problem. In this
Sudip Kumar Sahana, Aruna Jain
openaire +1 more source
Improved Dynamic Ant Colony System (DACS) on symmetric Traveling Salesman Problem (TSP)
2007 International Conference on Intelligent and Advanced Systems, 2007Ants are a fascinating creature that demonstrates a capability of finding food and bring it back to their nest. Their ability as a colony to find paths or routes to the food sources has inspired the development of an algorithm namely ant colony system (ACS). The principle of cooperation has been the backbone in these algorithmic developments.
Helmi Md Rais +2 more
openaire +1 more source
Small and large TSP: Two polynomially solvable cases of the traveling salesman problem
European Journal of Operational Research, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
van Dal, René +2 more
openaire +2 more sources
Ant colony optimization for traveling salesman problem based on parameters optimization
Applied Soft Computing Journal, 2021Zunpu Han
exaly
Solving Dynamic Traveling Salesman Problems With Deep Reinforcement Learning
IEEE Transactions on Neural Networks and Learning Systems, 2023Zizhen Zhang, Hong Liu, MengChu Zhou
exaly
PENERAPAN METODE BRANCH AND BOUND PADA PENYELESAIAN MASALAH TRAVELING SALESMAN PROBLEM (TSP ) [PDF]
, 2015 Traveling Salesman Problem (TSP ) adalah permasalahan pendistribu- sian barang atau jasa yang mengharuskan seseorang mengunjungi setiap tempat dengan mempertimbangkan jarak atau biaya seminimal mungkin. Selain itu TSP merupakan kasus nyata dari graf Hamilton dimana setiap titik harus tepat dile- wati satu kali.
openaire