Optimizing the Multi-Level Location-Assignment Problem in Queue Networks Using a Multi-Objective Optimization Approach

Abstract

Using hubs in distribution networks is an efficient approach. In this paper, a model for the location-allocation problem is designed within the framework of the queuing network in which services have several levels, and customers must go through these levels to complete the service. The purpose of the model is to locate an appropriate number of facilities among potential locations and allocate customers. The model is presented as a multi-objective nonlinear mixed-integer programming model. The objective functions include the summation of the customer and the waiting time in the system and the waiting time in the system and minimizing the maximum possibility of unemployment in the facility. To solve the model, the technique of accurate solution of the epsilon constraint method is used for multi-objective optimization, and Pareto solutions of the problem will be calculated. Moreover, the sensitivity analysis of the problem is performed, and the results demonstrate sensitivity to customer demand rate. Based on the results obtained, it can be concluded that the proposed model is able to greatly summate the customer and the waiting time in the system and reduce the maximum probability of unemployment at several levels of all facilities. The model can also be further developed by choosing vehicles for each customer.

Keywords

• location-assignment
• hub
• reinforced epsilon constraint method
• multilevel services
• queue theory
• multi-objective optimization