Particle Swarm Optimization and Grey Wolf Optimizer to Solve Continuous p-Median Location Problems

Rabie, Hassan Mohamed

doi:10.1007/978-3-030-31129-2_13

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

2022

Publication Types

Select...

Article2

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The problem was first introduced in [6,7], and has been proved to be an NP-hard optimization problem [8]. For largesize location problems, optimal solutions may not be reached, therefore, heuristic and metaheuristic approaches are usually the best way forward for solving these vertex p-median location problems [9,10]. For more information on the vertex p-median location problems, see [11][12][13].…”

Section: Introductionmentioning

confidence: 99%

A New Hybrid-Heuristic Approach for Vertex p-Median Location Problems

Rabie¹,

Salhi²

2022

IJACSA

Self Cite

View full text Add to dashboard Cite

In this paper, a new hybridization of a Myopic and Neighborhood approaches is proposed to solve large-size vertex p-median location problems. The effectiveness and efficiency of our approach are demonstrated empirically through an intensive computational experiment on large-size instances taken from TSPLib and BIRCH datasets, with the number of nodes varying from 734 to 9,976 for the former and from 9,600 to 20,000 nodes for the latter. The results show that the new approach, though relatively simple, yields better solutions compared to the ones in the literature. This demonstrates that a simpler approach that takes into account the advantages of other methods can lead to promising outcome and has the potential of being adopted in other combinatorial optimization problems.

show abstract