in any supply chain, distribution planning of products is of great importance to managers. with effective and flexible distribution planning, mangers can increase the efficiency of time, place, and delivery utility of whole supply chain. in this paper, inventory routing problem (irp) is applied to distribution planning of perishable products in a supply chain. the studied supply chain is compos...

Reliable location routing problem considers a location problem and a vehicle routing problem in order to select the optimal location of facilities and at the same time the optimal routes for vehicles considering the unexpected failure for facilities in which, all facilities may fail with a probability. In this paper, a bi-objective mathematical model has been developed to minimize the total cos...

In recent years a new type of wireless networks named wireless mesh networks has drawn the attention of researchers. In order to increase the capacity of mesh network, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi channel wireless mesh networks. Therefore, the main challenge of these networks is how to properly assign the channels to the radios. O...

In this work, the capacitated location-routing problem with simultaneous pickup and delivery (CLRP-SPD) is considered. This problem is a more realistic case of the capacitated location-routing problem (CLRP) and belongs to the reverse logistics of the supply chain. The problem has many real-life applications of which some have been addressed in the literature such as management of liquid petrol...

This paper considers a time dependent(the travel time is not constant throughout the day) pollution routing problem (TDPRP), which aids the decision makers in minimizing travel time, toll cost and emitted pollution cost.  In complexity of urban areas most of the time one point is accessible from another with more than one edge. In contrast to previous TDPRP models, which are designed with only ...

The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...