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 joint solution of routing problems with soft and hard time windows has valuable practical applications. Simultaneous solution approaches to both types of problems are needed when: (a) the number of routes needed for hard time windows exceeds the number of available vehicles, (b) a study of cost-service tradeoffs is required or the dispatcher has qualitative information regarding the relativ...

In this study, a two echelons supply chain system in which a supplier is producing perishable product and distribute it to multiple customers is considered. By allowing lateral transshipment mechanism, it is also possible to deliver products to some customers in some periods in bulk, then customers using their own vehicle to transship goods between each other seeking further reduction in the ov...

We are considering a problem of faulttolerant wormhole unicast routing in computer networks, consisting of nodes (processor units), connected by bi-directional links. Each node can be viewed as the combination of a router and a processor with some RAM, bus and I/O circuitry. We concentrate on networks with arbitrary (irregular) topologies. The problem of routing in the presence of faults is div...

nowadays, the environmental impact of transportation project and, especially air pollution impacts, are major concerns in evaluating transportation projects. based on this concern, beside definition of traditional objective functions like total travel time and total investment cost, different type of environmental related function is considered as objective function in urban network design. in ...

In this paper, we study a rich vehicle routing problem incorporating various complexities found in real-life applications. The General Vehicle Routing Problem (GVRP) is a combined load acceptance and generalised vehicle routing problem. Among the real-life requirements are time window restrictions, a heterogeneous vehicle fleet with different travel times, travel costs and capacity, multi-dimen...

This article addresses resource allocation scheduling problems with slack due window on a single machine. Linear and convex are considered. Our goal is to determine the optimal schedule, window, allocation, minimizing various objective functions respect criteria (position-dependent weights number of early jobs, tardy starting time, size) consumption function. For linear problem, we study two ca...

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