This paper deals with the key issue of management to improve the allocation capability, facilitating the optimization of the objective in minimizing the cost, with the accuracy in dynamic allocation of nearest customers to depot. A method has been proposed to solve the Multi Depot Vehicle Routing Problem (MDVRP) based on Ant Algorithm which is a modified version of the traditional Ant colony Op...

The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...

Using shared resources has created better opportunities in the field of sustainable logistics and procurement. The Multi-Depot Traveling Purchaser Problem under Shared Resources (MDTPPSR) is a new variant (TPP) inbound logistics. In this problem, each depot can purchase its products using other depots, vehicles do not have to return their starting depots. routing problem Multi-Trip, Open Vehicl...

this paper discusses the multi-depot vehicle routing problem of heterogeneous fleet of vehicles with time windows for perishable commodities. the objective of the problem is to minimize the total time required for servicing all customers that is equivalent to the total cost. commodities are delivered to the customers with defined time windows by a fleet of heterogeneous vehicles, which have lim...

In the aftermath of a large disaster, the routing of vehicles carrying critical supplies can greatly impact the arrival times to those in need. Since it is critical that the deliveries are both fast and fair to those being served, it is not clear that the classic cost-minimizing routing problems properly reflect the priorities relevant in disaster relief. In this paper, we take the first steps ...

As pointed out by Nagy and Salhi in their recent survey [1], many variants of the location routing problem (LRP) are addressed in the literature. Generally speaking the LRP consists of determining locations for depots from which customers are served on routes with the objective of minimizing the overall cost. In this talk we consider the capacitated locationrouting problem (CLRP) which is defin...