A Survey Paper on Solving Travelling Salesman problem Using Bee colony optimization
نویسندگان
چکیده
Traveling Salesman Problem (TSP) is about finding a Hamiltonian path with minimum cost. Travelling salesman problem (TSP) finds its application in many real world industrial applications including the areas such as logistics, transportation, and semiconductor industries. few potential applications of TSP includes finding an optimized scan chains route in integrated chip testing, parcels collection and sending in logistics companies, and transportation routing problem. This paper gives a brief overview of the various approaches that have been implemented to solve TSP and specifically bee colony optimization (BCO) for solving TSP. The BCO model is constructed algorithmically based on the collective intelligence shown in bee foraging behavior. Keywordsbee colony optimization, foraging behavior, heuristic search, travelling salesman problem,
منابع مشابه
A CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملA new hybrid heuristic approach for solving large traveling salesman problem
This study presents a novel problem called green travelling salesman problem (GTSP), an extension of the classical travelling salesman problem (TSP). Proposed GTSP considers not just for the route distance, also accounts emitted CO2, consumed fuel, travelling times/speed and their costs with a more comprehensive objective function. The aim of this study is to shed light on the trade-offs betwee...
متن کاملEnhanced Artificial Bee Colony Algorithm and It's Application to Travelling Salesman Problem
A rtificial bee Colony algorithm (ABC) is a population based heuristic search technique used for optimization problems. ABC is a very effective optimization technique for continuous optimization problem. Crossover operators have a better exploration property so crossover operators are added to the ABC. This paper presents ABC with different types of real coded crossover operator and its applica...
متن کامل