Abstract: The traveling salesman problem (TSP) is one of the most extensively studied problems in the combinatorial optimization area and still presents unsolved challenges due to its NP-hard ...
Abstract: A discrete particle swarm optimization algorithm with adaptive inertia weight (DPSO-AIW) is proposed to solve the multiobjective Flexible Job-shop Scheduling Problem. The algorithm uses a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results