A comparison study of Hill Climbing, Simulated Annealing and Genetic Algorithm for node placement problem in WMNs.
Shinji SakamotoElis KullaTetsuya OdaMakoto IkedaLeonard BarolliFatos XhafaPublished in: J. High Speed Networks (2014)
Keyphrases
- hill climbing
- simulated annealing
- genetic algorithm
- routing protocol
- wireless mesh networks
- mobile ad hoc networks
- genetic algorithm ga
- intermediate nodes
- tabu search
- simulated annealing algorithm
- metaheuristic
- evolutionary algorithm
- ad hoc networks
- roulette wheel selection
- mobile nodes
- network nodes
- hybrid algorithm
- direct search
- search procedure
- multi objective
- optimization method
- hill climbing algorithm
- fitness function
- harmony search
- wireless networking
- wireless networks
- hybrid evolutionary
- steepest ascent
- routing algorithm
- solution space
- search space
- social networks
- wireless sensor networks
- mesh network
- artificial neural networks
- neural network
- power supply
- multi hop
- genetic programming
- data transmission
- real time
- feasible solution
- differential evolution
- particle swarm optimization
- energy consumption