An optimal evacuation route plan has to be established to overcome the problem of poor coordination and uneven distribution of vehicles before or during disaster. This article introduces the evacuation vehicle routing problem (EVRP) as a new variant to the vehicle routing problem (VRP). EVRP is a process of moving vehicles from a vehicle location to the potentially flooded area (PFA), and from ...

Transportation plays a crucial role in both production and service industry. In modern times, the importance of supplying the goods on time to warehouses, production units and finally to the customers is not lost on logistic companies. Vehicle Routing Problems (VRP) models evolved to be more advanced, which led to the growth of computational complexity. Optimizing transportation routes for comp...

This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to minimize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogeneous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation aff...

This research addresses an empirical multi-depot vehicle routing case for a fixed-route trucking carrier. In this case, the characteristics of vehicle routing problems, including multi-depots, dispatching quantity, routes arrangement and time-window constraints, are considered in order to reduce the delivering cost. A hybrid heuristic algorithm is developed in order to solve this practical prob...

increasing of the distribution efficiency is one of the most objectives of an integrated logistic system developed as a new management philosophy in the past few decades. the problem is examind in two parts: facilities location problem (flp) for long policies and vehicle routing problem (vrp) to meet the customer demand. these two components can be solved separately; however, this solution may ...

In this work, we present a multi-phase hybrid algorithm based on clustering to solve the multi-depots vehicle routing problem (MDVRP). The proposed algorithm initially adopts K-means algorithm to execute the clustering analyses, which take the depots as the centroids of the clusters, for the all customers of MDVRP, then implements the local depth search using the Shuffled Frog Leaping Algorithm...

This paper presents a new mathematical model of the vehicle routing problem in the context of city distribution, which considers multi-depot, multi-model vehicles and multi-task. The objective function includes three parts: transport cost, deadheading cost and time cost. To solve this mathematical model, a self-adaptive and polymorphic ant colony algorithm (APACA) has been introduced. Finally, ...

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