Learn More
Ant colony optimization (ACO) is a population-based meta-heuristic for combinatorial optimization problems such as communication network routing problem(CNRP). This paper proposes an improved ant colony optimization(IACO), which adapts a new strategy to update the increased pheromone, called ant-weight strategy, and a mutation operation, to solve CNRP. The(More)
Genetic algorithm get local optimal solution too easily and converge slowly on selection problem of mobile IP routing, in order to solve the optimization problem, an approach based on quantum-behaved particle swarm optimization algorithm (QPSO) is proposed, the approach take advantages of quantum computation such as strongly parallel calculating abilities,(More)