Discrete Firefly Algorithm for Traveling Salesman Problem
A New Movement Scheme
Gilang Kusuma Jati1, Ruli Manurung1 and Suyanto2, 1Faculty of Computer Science, Universitas Indonesia, Kampus UI, Depok, Jawa Barat, Indonesia, 2Faculty of Informatics, Telkom School of Technology, Jl. Telekomunikasi No. 1, Terusan Buah Batu, Bandung, Jawa Barat, Indonesia
13.1 Introduction
The traveling salesman problem (TSP) is one of the most studied problems and has received growing attention in artificial intelligence, computational mathematics, and optimization theory in recent years. The traveling salesman problem (TSP) is one of the most studied problems and has received growing attention in artificial intelligence, computational mathematics, and ...
Get Swarm Intelligence and Bio-Inspired Computation now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
