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...

the location-routing problem is a relatively new branch of logistics system. its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. in this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. another important issue in this regard ...

in this study the location routing problem with fuzzy parameters is taken into account, this problem involves determining the location of the depots and routing of the vehicles in order to serve the customers. in this study a location routing problem with fuzzy travel times and due dates is considered and two objective models are proposed. the considered objectives are minimizing the total cost...

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...

The location-routing problem is the most significant and yet new research field in location problems that considers simultaneously vehicle routing problem features with original one for achieving high-quality integrated distribution systems in beside of the global optimum. Simultaneous pickup and delivery based on time windows are the two main characteristics of logistic management that have be...

this research presents and solves a new mathematical model for school bus routing problem (sbrp). sbrp is a specific case of vehicle routing problem (vrp). despite prevalent models, this model includes location and routing simultaneously. besides, the vehicles are non-homogenous. in addition, instead of locating schools which are the depots, we consider locating bus stops that are mentioned &ap...

Location-Routing Problem (LRP) emerges as one of the hybrid optimization problems in distribution networks in which, total cost of the system would be reduced significantly by simultaneous optimization of locating a set of facilities among candidate locations and routing vehicles. In this paper, a mixed integer linear programming model is presented for a two-echelon location-routing problem wit...