Now showing items 1-2 of 2
A clustering particle swarm optimizer for dynamic optimization.
In the real world, many applications are nonstationary optimization problems. This requires that optimization algorithms need to not only find the global optimal solution but also track the trajectory of the changing global ...
A hybrid genetic algorithm and inver over approach for the travelling salesman problem.
This paper proposes a two-phase hybrid approach for the travelling salesman problem (TSP). The first phase is based on a sequence based genetic algorithm (SBGA) with an embedded local search scheme. Within the SBGA, a ...