Kombinasi Firefly Algorithm-Tabu Search untuk Penyelesaian Traveling Salesman Problem
نویسندگان
چکیده
منابع مشابه
Tabu Search on the Geometric Traveling Salesman Problem
I Abstract The Traveling Salesman Problem (TSP) is probably the most well-known problem of its genre: Combinatorial Optimization. New heuristics, built on the concept of local search, i.e. continuously to make transitions from one solution to another in the search for better solutions have shown to be successful, especially for medium-to large-scale problems (+1000 cities). This thesis presents...
متن کاملRandom gravitational emulation search algorithm (RGES (in scheduling traveling salesman problem
this article proposes a new algorithm for finding a good approximate set of non-dominated solutions for solving generalized traveling salesman problem. Random gravitational emulation search algorithm (RGES (is presented for solving traveling salesman problem. The algorithm based on random search concepts, and uses two parameters, speed and force of gravity in physics. The proposed algorithm is ...
متن کاملA Tabu Search Algorithm for the Symmetric Generalized Traveling Salesman Problem
The Generalized Traveling Salesman Problem (GTSP) consists of finding a least cost Hamiltonian circuit or cycle through several clusters of vertices. In this paper we propose a new tabu search algorithm which uses the problem’s configuration to guide the search and reduce the solution space. A new way to manage the tabu restrictions, specially adapted to this problem, is also proposed. Results ...
متن کاملBiogeography Migration Algorithm for Traveling Salesman Problem
Biogeography-based optimization algorithm(BBO) is a new kind of optimization algorithm based on Biogeography. It is designed based on the migration strategy of animals to solve the problem of optimization. In this paper, a new algorithm-Biogeography Migration Algorithm for Traveling Salesman Problem(TSPBMA) is presented. Migration operator is designed. It is tested on four classical TSP problem...
متن کاملTraveling Salesman Problem using Genetic Algorithm
Traveling Salesman Problem (TSP) is an NP-hard Problem, which has many different real life applications. Genetic Algorithms (GA) are robust and probabilistic search algorithms based on the mechanics of natural selection and survival of the fittest that is used to solve optimization and many real life problems. This paper presents Genetic Algorithm for TSP. Moreover it also shows best suitable p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Online Informatika
سال: 2017
ISSN: 2527-9165,2528-1682
DOI: 10.15575/join.v2i1.63