Developing a New Bi-Objective Functions Model for a Hierarchical Location-Allocation Problem Using the Queuing Theory and Mathematical Programming

Abstract

In this research, a hierarchical location-allocation problem is modeled in a queue framework. The queue model is considered as M/M/1/k, in which system capacity is finite, equals to k. This is the main contribution of the current research. Customer's enters to the system in order to find the service according to a Poisson. In this problem, the hierarchical location-allocation model is considered in two levels. Also, the model has two objective functions: maximizing the total number of demand coverage and minimizing the waiting time of customers in queues to receive services. After modeling and verifying the validity of the presented model, it is solved using NSGA II and MOPSO meta-heuristics.

Keywords

• Location-Allocation Problems
• Hierarchical Models
• M/M/m Queuing Model
• Multi-objective programming
• Taguchi method
• NSGA-II Algorithm