A congested capacitated location problem with continuous network demand

¹ University of Haute-Alsace, IRIMAS UR 7499, 68100 Mulhouse, France
² Alliance Manchester Business School, University of Manchester, Manchester M15 6PB, UK
³ University of Haute-Alsace IRIMAS UR 7499, 68100 Mulhouse, France

^* Corresponding author: mahmoud.golabi@uha.fr

Received: 27 September 2021
Accepted: 24 September 2022

Abstract

This paper presents a multi-objective mixed-integer non-linear programming model for a congested multiple-server discrete facility location problem with uniformly distributed demands along the network edges. Regarding the capacity of each facility and the maximum waiting time threshold, the developed model aims to determine the number and locations of established facilities along with their corresponding number of assigned servers such that the traveling distance, the waiting time, the total cost, and the number of lost sales (uncovered customers) are minimized simultaneously. Also, this paper proposes modified versions of some of the existing heuristics and metaheuristic algorithms currently used to solve NP-hard location problems. Here, the memetic algorithm along with its modified version called the stochastic memetic algorithm, as well as the modified add and modified drop heuristics are used as the solution methods. Computational results and comparisons demonstrate that although the results obtained from the developed stochastic memetic algorithm are slightly better, the applied memetic algorithm could be considered as the most efficient approach in finding reasonable solutions with less required CPU times.