Multi-Stage Algorithms for Solving a Generalized Capacitated P-median Location Problem

Abstract

The capacitated p-median location problem is one of the famous problems widely discussed in the literature, but its generalization to a multi-capacity case has not. This generalization, called multi-capacitated location problem, is characterized by allowing facilities to use one of several capacity levels. For this purpose, a predefined list of capacity levels supported by all potential facilities is established. In this paper, we will detail the mathematical formulation and propose a new solving method. We try to construct, indeed, a multi-stage heuristic algorithm that will be called BDF (Biggest Demand First). This new method appears in two approaches: Integrated BDF (IBDF) and Hybridized BDF (HBDF) will be improved by using a local search optimization. A valid lower bound to the optimal solution value is obtained by solving a lagrangian relaxation dual of the exact formulation. Computational results are presented at the end using new instances with higher ratio between the number of customers, facilities and capacity levels or adapted from those of p-median drawn from the literature. The obtained results show that the IBDF is much faster with medium quality solution while HBDF is slower but provides very good solutions close to the optimality.

Authors and Affiliations

Mohammed EL AMRANI, Youssef BENADADA

Keywords

Related Articles

Validating Antecedents of Customer Engagement in Social Networking Sites using Fuzzy Delphi Analysis

The concept of online customer engagement is getting imperative in modern business due to the uncontrolled conversation via cyber-avenue. This study validates the antecedents of customer engagement conceptualized in Soci...

Three Levels Quality Analysis Tool for Object Oriented Programming

In terms of evolution of software engineering methods for complex software developments techniques, new concepts have been emerged in the software languages, which used to develop software quality models. In this researc...

Corrupted MP4 Carving Using MP4-Karver

In the digital forensic, recovery of deleted and damaged video files play an important role in searching for the evidences. In this paper, MP4-Karver tool is proposed to recover and repair the corrupted videos. Moreover,...

Crypt-Tag Authentication in NFC Implementation for Medicine Data Management

This study focus on the implementation of expiry date detection for medicine using RFID in the health care industry. The motivation for doing this research is the process of searching for the expired medicine is a time c...

Predictive Performance Comparison Analysis of Relational & NoSQL Graph Databases

From last three decades, the relational databases are being used in many organizations of various natures such as Education, Health, Business and in many other applications. Traditional databases show tremendous performa...

Download PDF file
  • EP ID EP316112
  • DOI 10.14569/IJACSA.2018.090524
  • Views 91
  • Downloads 0

How To Cite

Mohammed EL AMRANI, Youssef BENADADA (2018). Multi-Stage Algorithms for Solving a Generalized Capacitated P-median Location Problem. International Journal of Advanced Computer Science & Applications, 9(5), 190-196. https://europub.co.uk/articles/-A-316112