Vehicle Routing Problem is a common problem in logistics, which can simulate in-plant and out-plant material handling. In the article, we demonstrate Problem, contains period, time window multiple depots. this case, customers must be served from several The position of nodes (depots customers), demand are known advance. number capacity constraint vehicles predefined. leave one depot, visit some...

Vehicle routing problem is a kind of common problem in logistics distribution center, in order to solve the high delivery cost of VRP and time constraint problem, the VRP model with the object level and constraints by semi-soft time window is built. Aiming to the semi-soft time window constraints the optimization of the model is discussed. Finally the numerical examples prove the superiority of...

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

A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. O...

The single vehicle routing problem with multiple routes is a variant of the vehicle routing problem where the vehicle can be dispatched to several routes during its workday to serve a number of customers. In this paper we propose a goal programming model for multi-objective single vehicle routing problem with time windows and multiple routes. To solve the model, we present a heuristic method wh...

One of the important extensions of the classical resource allocation problem is integrated resource allocation and routing problem with time window (IRARPTW). IRARPTW problem focuses on the time window for the service at the demanding node with the consideration of travel time of vehicle for a varying demand-oriented multi echelon supply chain with the consideration of limitation on the number ...