A Hybrid Heuristic Based on a Particle Swarm Algorithm to Solve the Capacitated Location-Routing Problem With Fuzzy Demands

Abstract

In this paper, the capacitated location-routing problem with fuzzy demands (CLRP-FD) is considered, which simultaneously solves two problems: locating the facilities and designing the vehicle routes among the established facilities and customers. In the CLRP-FD, the capacities of the employed vehicles and established facilities cannot exceed, and the demands of the customers are assumed to be triangular fuzzy variables. To model the CLRP-FD, a fuzzy chance constrained programming approach is designed using fuzzy credibility theory. To solve this problem, a hybrid particle swarm optimization (HPSO) algorithm, which includes a stochastic simulation and a local search strategy based on the variable neighborhood search algorithm, is proposed. Finally, the influence of the value of the dispatcher preference index (DPI) on the total distribution cost is analyzed by conducting numerical experiments. To evaluate the efficiency of the proposed HPSO and the performance of the CLRP-FD model, the results obtained using the HPSO were compared with their corresponding lower bound provided using the CPLEX solver. Moreover, we also evaluated the performance of HPSO through computational experiments on some well-known benchmark CLRP instances. The numerical results show that the proposed HPSO is competitive, and can give a satisfactory solution in a reasonable amount of time.

Keywords

• Capacitated location-routing problem
• credibility theory
• fuzzy demand
• particle swarm optimization
• stochastic simulation