The Coupled EigenAnt algorithm for shortest path problems.
Eugenius KaszkurewiczAmit Bhaya JayadevaJoão Marcos Meirelles da SilvaPublished in: IEEE Congress on Evolutionary Computation (2014)
Keyphrases
- shortest path problem
- dynamic programming
- search space
- computational cost
- optimization algorithm
- linear programming
- detection algorithm
- cost function
- theoretical analysis
- computationally efficient
- expectation maximization
- np hard
- benchmark problems
- k means
- preprocessing
- improved algorithm
- neural network
- convergence rate
- times faster
- matching algorithm
- recognition algorithm
- segmentation algorithm
- input data
- high accuracy
- objective function
- graph cuts
- data sets
- simulated annealing
- shortest path
- probabilistic model
- experimental evaluation
- knapsack problem
- significant improvement
- optimal solution
- selection algorithm
- similarity measure
- single source