Mathematical Formulation for Location of Multiple Facilities on Deterministic Network

Authors

  • Dr. Shailendra Kumar   Assistant Professor in Mathematics, Govt. Raza P. G. College, Rampur, India

Keywords:

Facility Location, Deterministic Network, P-Median Problem, P-Center Problem, Integer Linear Programming, Optimization, Network Modeling, Urban Planning, Service Efficiency, Operations Research.

Abstract

Efficient placement of multiple facilities within a network is a critical challenge encountered in urban planning, logistics, transportation systems, and operations research. This paper presents a mathematical approach for solving this problem on a deterministic network, where travel times and transportation costs are fixed and known in advance. The main objective is to determine optimal facility locations that ensure maximum service efficiency, minimal cost, and improved overall network performance.In order to do this, we concentrate on p-median problem and p-center problem, two well-known location models. The p-median approach is appropriate for cost-sensitive applications like distribution and logistics since it seeks to reduce the average (or total) distance among demand nodes and the facilities to which they are assigned. However, in situations like emergency services or public facilities, the p-center model reduces the maximum distance a user must travel to reach a facility, which is essential for equitable service delivery. The methodology adopted in this study is based on mathematical modeling using integer linear programming (ILP). A graph with a collection of nodes (demand points) & edges (fixed trip charges or distances) is used to depict a deterministic network. Binary decision variables that specify whether a facility is positioned at a specific node and which demand points are allocated to which facilities are then used to create the facility location problem. Every demand node is assigned to the closest available facility by the ILP formulation, which guarantees that precisely p facilities are chosen. These models are solved using both real and simulated datasets utilizing optimization solvers like CPLEX and Gurobi. A sensitivity analysis is also carried out to look at how changing the quantity of facilities & demand distribution affects the solution's robustness and quality. We draw the conclusion that the p-median & p-center models are both useful instruments for strategic facility placement choices in deterministic networks based on the outcomes of the computational trials. While the p-center approach guarantees equity and accessibility for all demand nodes, the p-median model is excellent at lowering overall service costs. The results highlight how crucial it is to select the right model depending on the particular objectives and limitations of the application. This study provides a flexible and systematic framework for facility location that can be adapted across diverse sectors including healthcare, education, retail, and municipal services. Future research may extend this work by incorporating dynamic or stochastic elements into the network to reflect real-world variability in demand and travel conditions.

References

  1. Bozorgi-Amiri, A., Jolai, F., Sadegheih, A., &Tavakkoli-Moghaddam, R. (2014). Robust p-median location under demand uncertainty. Computers & Industrial Engineering, 75, 75–86.
  2. Church, R., &ReVelle, C. (1974). The maximal covering location problem. Papers of the Regional Science Association, 32(1), 101–118.
  3. Daneshzand Farzaneh, Shoeleh Razieh (2009), Multifacility Location Problem, Contributions to Management Science book series Published by Springer, DOI:10.1007/978-3-7908-2151-2_4
  4. Daskin, M. S. (2011). Network and Discrete Location: Models, Algorithms, and Applications. Wiley.
  5. Daskin, M. S. (2011). Network and Discrete Location: Models, Algorithms, and Applications. Wiley.
  6. Farahani, R. Z., SteadieSeifi, M., & Asgari, N. (2010). Multiple criteria facility location problems: A survey. Applied Mathematical Modelling, 34(7), 1689–1709.
  7. Hakimi, S. L. (1964). Optimum locations of switching centers and the absolute centers and medians of a graph. Operations Research, 12(3), 450–459.
  8. ReVelle, C., & Swain, R. (1970). Central facilities location. Geographical Analysis, 2(1), 30–42.
  9. Sadatasl Ali Akbar; Zarandi Mohammad Hossein Fazel; Sadeghi Abolfazl, (2016), A combined facility location and network design model with multi-type of capacitated links and backup facility and non-deterministic demand by fuzzy logic, Published in: 2016 Annual Conference of the North American Fuzzy Information Processing Society (NAFIPS), Publisher: IEEE, DOI: 10.1109/NAFIPS.2016.7851634
  10. Seyedhosseini, S.M., Makui, A., Shahanaghi, K. et al. (2016), Models, solution, methods and their applicability of dynamic location problems (DLPs) (a gap analysis for further research). Journal of Industrial Engineering International Volume 12, pages 311–341, (2016). https://doi.org/10.1007/s40092-016-0150-1
  11. Subramanian, A., Shirkhodaie, M., & Kim, M. K. (2015). Large-scale p-median solutions via hybrid genetic algorithms. Annals of Operations Research, 226(1), 331–353.

Downloads

Published

2018-01-25

Issue

Section

Research Articles

How to Cite

[1]
Dr. Shailendra Kumar "Mathematical Formulation for Location of Multiple Facilities on Deterministic Network" International Journal of Scientific Research in Science and Technology(IJSRST), Online ISSN : 2395-602X, Print ISSN : 2395-6011,Volume 4, Issue 2, pp.2381-2388, January-February-2018.