Abstract

AbstractA 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.KeywordsSwarm IntelligenceContinuous Particle Swarm OptimizationUFLInertia FactorAcceleration Coefficient

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.