Font Size: a A A

The Hybrid Artificial Bee Colony Algorithm Solves The Traveling Salesman Problem

Posted on:2021-01-16Degree:MasterType:Thesis
Country:ChinaCandidate:J S ZhuFull Text:PDF
GTID:2428330611481002Subject:Computer software and theory
Abstract/Summary:PDF Full Text Request
Traveling Salesman Problem(TSP)is one of the important research topics in computing,engineering,operations research,discrete mathematics,graph theory and other fields.TSP is defined as a salesman traveling in all cities and then returning to the original city at the lowest cost,which is an NP hard problem.In recent years,many swarm intelligence algorithms have been used to solve TSP problems.Swarm Intelligence(SI)is an important research direction for NP hard problems which are difficult to solve.The foraging behavior of bees is an intelligent social behavior,which belongs to the category of swarm intelligence.The resulting Artificial Bee Colony(ABC)algorithm is an algorithm that simulates the foraging behavior of bees.Since the birth of ABC,a lot of research has been done to improve the performance of ABC and apply it to different types of problems.A hybrid Genetic Algorithm ABC(GAABC)combining Genetic operators is proposed.This Algorithm takes the artificial bee colony Algorithm as the main structure,designs the crossover operation and heuristic variation in the Genetic Algorithm,and fuses them into the mainstructure to improve the overall performance of the Algorithm.In order to enrich the space of the whole solution set,a new solution is explored by using the 3-opt method for the stagnant scout bee.An example is given to verify the effectiveness of the hybrid algorithm.And put forward a kind of combined Quantum thought Quantum artificial swarm Algorithm(QUABC)to solve the TSP problem,the Algorithm for artificial colony Algorithm architecture,including every bee artificial fusion,a new Quantum coding,using Quantum bits to encode the access sequence of city,provides the solution set of the overall more diversity,and use the Quantum interference to find the best corresponding bits of bees value direction,guide the bee population individuals find all the bees find the global optimal solution,to enhance the overall performance of the Algorithm.Finally,the effectiveness of the algorithm is verified by experiments.
Keywords/Search Tags:travel salesman problem, artificial bee colony algorithm, inversion variation, crossover operation, quantum interference, quantum coding
PDF Full Text Request
Related items