using greedy clustering method to solve capacitated location-routing problem with fuzzy demands abstract 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 customerst...

this paper proposes a bi-objective model for the facility location problem under a congestion system. the idea of the model is motivated by applications of locating servers in bank automated teller machines (atms), communication networks, and so on. this model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within queueing frame...

This paper considers a single-sourcing network design problem for a three-level supply chain. For the first time, a novel mathematical model is presented considering risk-pooling, the inventory existence at distribution centers (DCs) under demand uncertainty, the existence of several alternatives to transport the product between facilities, and routing of vehicles from distribution centers to c...

One of the main critical steps that should be taken during natural disasters is the assignment and distribution of resources among affected people. In such situations, this can save many lives. Determining the demands for critical items (i.e., the number of injured people) is very important. Accordingly, a number of casualties and injured people have to be known during a disaster. Obtaining an ...

In this work we propose two memetic algorithms based on a Nondominated Sorting Genetic Algorithm II (NSGA-II) scheme for solving a bi-objective Transportation Location Routing Problem (TLRP). The TLRP we are dealing with, can be seen as an extension of the two stage Location Routing Problem, with a transportation problem with truck capacity as first stage. Two objectives are considered: minimiz...