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

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

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...

Software Abstractions for Large-Scale Deep Learning Models in Big Data Analytics

The goal of big data analytics is to analyze datasets with a higher amount of volume, velocity, and variety for large-scale business intelligence problems. These workloads are normally processed with the distribution on...

Designing Novel Queries for Analysing NoSQL Data of Gene-Disease Associations

To precisely identify gene associated diseases has been an open area of research for biological scientists to ensure clinical and psychological symptoms and treatment for human diseases. Because whole Human Genome is def...

From PID to Nonlinear State Error Feedback Controller

In this paper an improved nonlinear state error feedback controller (INLSEF) has been proposed for perfect reference tracking and minimum control energy. It consists of a nonlinear tracking differentiator together with n...

Using an Integrated Framework for Conceptual Modeling

The Integrated Framework for Conceptual Modeling (IFCMod) is created to contribute to the quality of the information system through the integration of the functional and non-functional requirements. This paper attempts t...

Download PDF file
  • EP ID EP316112
  • DOI 10.14569/IJACSA.2018.090524
  • Views 89
  • 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