The Science and Information (SAI) Organization
  • Home
  • About Us
  • Journals
  • Conferences
  • Contact Us

Publication Links

  • IJACSA
  • Author Guidelines
  • Publication Policies
  • Digital Archiving Policy
  • Promote your Publication
  • Metadata Harvesting (OAI2)

IJACSA

  • About the Journal
  • Call for Papers
  • Editorial Board
  • Author Guidelines
  • Submit your Paper
  • Current Issue
  • Archives
  • Indexing
  • Fees/ APC
  • Reviewers
  • Apply as a Reviewer

IJARAI

  • About the Journal
  • Archives
  • Indexing & Archiving

Special Issues

  • Home
  • Archives
  • Proposals
  • Guest Editors
  • SUSAI-EE 2025
  • ICONS-BA 2025
  • IoT-BLOCK 2025

Future of Information and Communication Conference (FICC)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Computing Conference

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Intelligent Systems Conference (IntelliSys)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Future Technologies Conference (FTC)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact
  • Home
  • Call for Papers
  • Editorial Board
  • Guidelines
  • Submit
  • Current Issue
  • Archives
  • Indexing
  • Fees
  • Reviewers
  • Subscribe

DOI: 10.14569/IJACSA.2013.041215
PDF

A particle swarm optimization algorithm for the continuous absolute p-center location problem with Euclidean distance

Author 1: Hassan M. Rabie
Author 2: Dr. Ihab A. El-Khodary
Author 3: Prof. Assem A. Tharwat

International Journal of Advanced Computer Science and Applications(IJACSA), Volume 4 Issue 12, 2013.

  • Abstract and Keywords
  • How to Cite this Article
  • {} BibTeX Source

Abstract: The p-center location problem is concerned with determining the location of p centers in a plane/space to serve n demand points having fixed locations. The continuous absolute p-center location problem attempts to locate facilities anywhere in a space/plane with Euclidean distance. The continuous Euclidean p-center location problem seeks to locate p facilities so that the maximum Euclidean distance to a set of n demand points is minimized. A particle swarm optimization (PSO) algorithm previously advised for the solution of the absolute p-center problem on a network has been extended to solve the absolute p-center problem on space/plan with Euclidean distance. In this paper we develop a PSO algorithm for the continuous absolute p-center location problem to minimize the maximum Euclidean distance from each customer to his/her nearest facility, called “PSO-ED”. This problem is proven to be NP-hard. We tested the proposed algorithm “PSO-ED” on a set of 2D and 3D problems and compared the results with a branch and bound algorithm. The numerical experiments show that PSO-ED algorithm can solve optimally location problems with Euclidean distance including up to 1,904,711 points.

Keywords: absolute p-center; location problem; particle swarm optimization

Hassan M. Rabie, Dr. Ihab A. El-Khodary and Prof. Assem A. Tharwat, “A particle swarm optimization algorithm for the continuous absolute p-center location problem with Euclidean distance” International Journal of Advanced Computer Science and Applications(IJACSA), 4(12), 2013. http://dx.doi.org/10.14569/IJACSA.2013.041215

@article{Rabie2013,
title = {A particle swarm optimization algorithm for the continuous absolute p-center location problem with Euclidean distance},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2013.041215},
url = {http://dx.doi.org/10.14569/IJACSA.2013.041215},
year = {2013},
publisher = {The Science and Information Organization},
volume = {4},
number = {12},
author = {Hassan M. Rabie and Dr. Ihab A. El-Khodary and Prof. Assem A. Tharwat}
}



Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.

IJACSA

Upcoming Conferences

IntelliSys 2025

28-29 August 2025

  • Amsterdam, The Netherlands

Future Technologies Conference 2025

6-7 November 2025

  • Munich, Germany

Healthcare Conference 2026

21-22 May 2026

  • Amsterdam, The Netherlands

Computing Conference 2026

9-10 July 2026

  • London, United Kingdom

IntelliSys 2026

3-4 September 2026

  • Amsterdam, The Netherlands

Computer Vision Conference 2026

15-16 October 2026

  • Berlin, Germany
The Science and Information (SAI) Organization
BACK TO TOP

Computer Science Journal

  • About the Journal
  • Call for Papers
  • Submit Paper
  • Indexing

Our Conferences

  • Computing Conference
  • Intelligent Systems Conference
  • Future Technologies Conference
  • Communication Conference

Help & Support

  • Contact Us
  • About Us
  • Terms and Conditions
  • Privacy Policy

© The Science and Information (SAI) Organization Limited. All rights reserved. Registered in England and Wales. Company Number 8933205. thesai.org