Heuristic Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands

In this paper, the capacitated location routing problem with fuzzy demands (CLRP-FD) is considered. In CLRP-FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed, the vehicles and the depots have a predefined capacity to serve the customers that have fuzzy demands. To model the CLRP-FD, a fuzzy chance constrained programming is designed, based on fuzzy credibility theory. To solve the CLRP-FD, a greedy clustering method (GCM) including the stochastic simulation is proposed. To get the best value of the preference index of the model and analysis its influence on the final solution of the problem, numerical experiments are carried out. Finally, to show the performance of the model, computational experiments are performed on a real case in Ardakan.