Asset Details
Do you wish to reserve the book?
Particle Swarm Optimization to Solve Multi-Center Location Problem on Small Networks
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Particle Swarm Optimization to Solve Multi-Center Location Problem on Small Networks
Do you wish to request the book?
Particle Swarm Optimization to Solve Multi-Center Location Problem on Small Networks
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Particle Swarm Optimization to Solve Multi-Center Location Problem on Small Networks
2022
Overview
This paper addresses the multi-center location problem, in which a set of p centers to be located to minimize the maximum distance between a center p and its nearest demand point. The problem is NP-hard. Therefore, polynomial time-bounded algorithms are unlikely to yield an optimal solution. Particle swarm optimization (PSO) is a metaheuristic algorithm that has been shown to be effective in solving such hard and complex optimization problems. This paper presented a new PSO for the multi-center location problem on small networks. Three objectives are considered as follows: (1) developing a new PSO algorithm to solve the problem, (2) applying the developed algorithm to a set of well-known benchmark location problems, and comparing the results. (3) verifying the stability of the algorithm. The result is a simple but effective algorithm for solving multi-center problems on networks. The new proposed PSO algorithm solved multi-center location problems, when all candidate solutions can be investigated. PSO was found to be stable and the average time of runs increases linearly as the number of centers increases. The advantage of this algorithm is that, it calculates the optimal solution for each candidate solutions.
Publisher
جامعة بني سويف
Subject
