A Mimetic Algorithm for Refinement of Lower Bound of Number of Tracks in Channel Routing Problem.
Debasri SahaRajat Kumar PalSamar Sen-SarmaPublished in: Intelligent Information Processing (2006)
Keyphrases
- routing problem
- worst case
- computational complexity
- lower bound
- randomized algorithm
- np hard
- dynamic programming
- objective function
- cost function
- search space
- optimization algorithm
- lower and upper bounds
- standard deviation
- optimal solution
- upper bound
- simulated annealing
- linear programming
- particle swarm optimization
- ant colony optimization
- convergence rate
- competitive ratio
- constant factor
- genetic algorithm