A capacitated location-routing problem with customer satisfaction under facility disruption

This paper presents a mixed-integer programming model for a capacitated location-routing problem with customer satisfaction under disruption risk. The aim of this problem is to find the location of medical service centers (MSCs) and the best route of vehicles to serve customers. To solve the problem, a hybrid NSGA-II algorithm is proposed and the related results are compared with the traditional NSGA-II as a well-known evolutionary algorithm. The Taguchi method is used to tune the best values of parameters to run the algorithms. The computational results represent that the hybrid NSGA-II has a better performance than the NSGA-II.