2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence) 2008
DOI: 10.1109/cec.2008.4630897
|View full text |Cite
|
Sign up to set email alerts
|

A two-step evolutionary and ACO approach for solving the multi-agent patrolling problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
18
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 16 publications
(18 citation statements)
references
References 7 publications
0
18
0
Order By: Relevance
“…The strategies belonging to the first class may be computed by an algorithm based on the Lin-Kernighan heuristic [10], as pointed out by Chevaleyre [3]. The strategies of the second class may be computed by an hybrid algorithm based on a combination of an Evolutionary Algorithm (EA) and an AntColony Optimization (ACO) algorithm [9]. We propose singlecore and multi-core variants for solving this problem.…”
Section: Introductionmentioning
confidence: 99%
“…The strategies belonging to the first class may be computed by an algorithm based on the Lin-Kernighan heuristic [10], as pointed out by Chevaleyre [3]. The strategies of the second class may be computed by an hybrid algorithm based on a combination of an Evolutionary Algorithm (EA) and an AntColony Optimization (ACO) algorithm [9]. We propose singlecore and multi-core variants for solving this problem.…”
Section: Introductionmentioning
confidence: 99%
“…The information that the ants collect during the search process is stored in the pheromone trail  with edges. The ant cooperates in finding the solution by exchanging information by the help of the pheromone chemical [9]. Edges are also associated with heuristic value  which represents information about the problem instance or its value is inverse of the distance.…”
Section: Acomentioning
confidence: 99%
“…The patrolling problem is usually specified formally as in [11,2,9,8]. Let the graph G = (V, E) where V is the set of nodes and E the edges.…”
Section: Mathematical Framework Of the Patrolling Taskmentioning
confidence: 99%
“…Such a strategy must optimize one or several given quality criteria [9]. π = {π 1 · · · π p } is made up of the p individual strategies π i of each agent i.…”
Section: Mathematical Framework Of the Patrolling Taskmentioning
confidence: 99%