An alternative heuristic for capacitated p-median problem (CPMP)

Author

Shariff, S. Sarifah Radiah ; Moin, Noor Hasnah ; Omar, Murad

Author_Institution

Fac. of Comput. & Math. Sci., Univ. Teknol. MARA, Shah Alam, Malaysia

fYear

2013

fDate

7-9 April 2013

Firstpage

916

Lastpage

921

Abstract

The p-median (PMP) has the objective of minimizing total distance, a customer/patient needs to travel in order to get a service. Various algorithms have been developed to solve the problem and in this paper, an alternative approach of Genetic Algorithm based heuristics is used to solve the problem in minimizing the travelled distance for a patient to get healthcare service. Combination of the nearly-optimal number of facilities to open and the random node order assignment is used to minimize the average traveled distance. The approach is used to solve a capacitated PMP (or CPMP) and found to solve all the CPMP in shorter time and in more promising result.

Keywords

facility location; genetic algorithms; health care; minimisation; CPMP; Malaysian Ministry-of-Health; capacitated p-median problem; genetic algorithm based heuristics; healthcare service; location problem; open node order assignment; public healthcare facilities; random node order assignment; total distance minimization; travelled distance minimization; Genetic algorithms; IP networks; Optimized production technology; genetic algorithm; location problem; public healthcare facilities;

fLanguage

English

Publisher

ieee

Conference_Titel

Business Engineering and Industrial Applications Colloquium (BEIAC), 2013 IEEE

Conference_Location

Langkawi

Print_ISBN

978-1-4673-5967-2

Type

conf

DOI

10.1109/BEIAC.2013.6560271

Filename

6560271