A modified continuous particle swarm optimization algorithm for uncapacitated facility location problem
S Saha, A Kole, K Dey - … , AIM 2011, Nagpur, Maharashtra, India, April 21 …, 2011 - Springer
S Saha, A Kole, K Dey
Information Technology and Mobile Communication: International Conference, AIM …, 2011•SpringerA continuous version of particle swarm optimization (CPSO) is employed to solve
uncapacitated facility location (UFL) problem which is one of the most widely studied in
combinatorial optimization. The basic algorithm had already been published in the
Research Article “A Discrete Particle Swarm Optimization Algorithm for Uncapacitated
Facility Location Problem”[1]. But in addition to that, the algorithm is slightly modified here to
get better result in a lesser time. To make a reasonable comparison, the same benchmark …
uncapacitated facility location (UFL) problem which is one of the most widely studied in
combinatorial optimization. The basic algorithm had already been published in the
Research Article “A Discrete Particle Swarm Optimization Algorithm for Uncapacitated
Facility Location Problem”[1]. But in addition to that, the algorithm is slightly modified here to
get better result in a lesser time. To make a reasonable comparison, the same benchmark …
Abstract
A continuous version of particle swarm optimization (CPSO) is employed to solve uncapacitated facility location (UFL) problem which is one of the most widely studied in combinatorial optimization. The basic algorithm had already been published in the Research Article “A Discrete Particle Swarm Optimization Algorithm for Uncapacitated Facility Location Problem” [1]. But in addition to that, the algorithm is slightly modified here to get better result in a lesser time. To make a reasonable comparison, the same benchmark suites that are collected from OR-library [6] are applied here. In conclusion, the results showed that this modified CPSO algorithm is slightly better than the published CPSO algorithm.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果