Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands

► We consider the capacitated location-routing problem with fuzzy demands (CLRP-FD). ► To model the CLRP-FD, we design a fuzzy chance constrained program, based on fuzzy credibility theory. ► To solve the CLRP-FD, we use a greedy clustering method (GCM) including the stochastic simulation. ► Numerical experiments obtained the best value preference index of the model and show the performance of the GCM.