The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem.
Bryant A. JulstromPublished in: GECCO (2005)
Keyphrases
- genetic algorithm
- spanning tree
- minimum cost
- undirected graph
- simulated annealing
- weighted graph
- edge detector
- routing decisions
- artificial neural networks
- edge detection
- source code
- edge information
- total cost
- evolutionary computation
- cost savings
- fitness function
- cost sensitive
- routing algorithm
- network topology
- evolutionary algorithm
- metaheuristic
- definite clause
- scale space
- fuzzy logic
- edge weights
- packet transmission
- routing protocol
- multi objective
- scheduling problem
- routing problem
- particle swarm optimization
- tabu search
- genetic algorithm ga