2008 Second Asia International Conference on Modelling &Amp; Simulation (AMS) 2008
DOI: 10.1109/ams.2008.27
|View full text |Cite
|
Sign up to set email alerts
|

A Bee Colony Optimization Algorithm for Traveling Salesman Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
56
0
2

Year Published

2012
2012
2024
2024

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 116 publications
(58 citation statements)
references
References 21 publications
0
56
0
2
Order By: Relevance
“…It is based on the work proposed by Nakrani and Tovey [35] to solve a server allocation problem in datacenters. Two papers were the first to propose similar modifications to the original algorithm to solve a vehicle routing problem: Wong et al [36] to solve the TSP and Lu and Zhou [37] to solve the TSP.…”
Section: Bee Colony Optimizationmentioning
confidence: 99%
“…It is based on the work proposed by Nakrani and Tovey [35] to solve a server allocation problem in datacenters. Two papers were the first to propose similar modifications to the original algorithm to solve a vehicle routing problem: Wong et al [36] to solve the TSP and Lu and Zhou [37] to solve the TSP.…”
Section: Bee Colony Optimizationmentioning
confidence: 99%
“…It naturally arises as a sub-problem in various application areas such as network communication, manufacturing and transportation [13]. Formally, the TSP may be defined as follows [14], it is a permutation problem with the objective of finding the path of the minimum length (or the minimum cost) on an undirected graph that represents cities or nodes to be visited.…”
Section: Travelling Salesman Problemmentioning
confidence: 99%
“…Regression Testing involves three techniques , they are , Minimization -which seeks to reduce the test cases by eliminating the redundant test cases, Selection-that deals with the problem of selecting subset of test cases that tests the changed parts and the last one is Prioritization-it is concerned with the ordering of test cases. It uses Bee Colony algorithm [12].…”
Section: Regression Test Selection For Aspect Oriented Programsmentioning
confidence: 99%