A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands
Computers and Operations Research
Discrete facility location and routing of obnoxious activities
Discrete Applied Mathematics - International symposium on combinatorial optimisation
Parallel machine scheduling models with fuzzy processing times
Information Sciences—Informatics and Computer Science: An International Journal
Fuzzy fixed charge solid transportation problem and algorithm
Applied Soft Computing
Modeling capacitated location-allocation problem with fuzzy demands
Computers and Industrial Engineering
Computers and Operations Research
Study on continuous network design problem using simulated annealing and genetic algorithm
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Modeling fuzzy multi-period production planning and sourcing problem with credibility service levels
Journal of Computational and Applied Mathematics
A hybrid differential evolution algorithm to vehicle routing problem with fuzzy demands
Journal of Computational and Applied Mathematics
A hybrid intelligent algorithm for portfolio selection problem with fuzzy returns
Journal of Computational and Applied Mathematics
Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem
Expert Systems with Applications: An International Journal
Standby redundancy optimization problems with fuzzy lifetimes
Computers and Industrial Engineering
The open vehicle routing problem with fuzzy demands
Expert Systems with Applications: An International Journal
Information Sciences: an International Journal
Capacitated location-routing problem with time windows under uncertainty
Knowledge-Based Systems
Applied p-median and p-center algorithms for facility location problems
Expert Systems with Applications: An International Journal
Hi-index | 12.05 |
This paper addresses the fuzzy version of Capacitated Location Routing Problem (CLRP). The proposed CLRP is defined considering opening costs for depots, limited capacities of vehicles and a set of customers with known demands. There are some potential nodes to locate depots, fuzzy travel times between nodes, and also a time window to meet the demand of each customer. Although there exists several papers, manuscripts and technical reports in the literature concerning Location Routing Problem (LRP) extensions and solution procedures, most of them assume the variables to be crisp. In this paper, we present a multi-depot capacitated LRP (MDCLRP) in which travel time between two nodes is a fuzzy variable. A simulation-embedded Simulated Annealing (SA) procedure is proposed in order to solve the problem. The proposed framework is tested using a standard test problem of MDCLRP and results are analyzed and justified. This numerical example shows that the proposed method is robust and could be used in real world problems.