In this paper, a novel methodology is proposed to solve a cooperative multi-depot vehicle routing problem. We establish a mathematical model for multi-owner VRP in which each owner (i.e. player) manages single or multiple depots. The basic idea consists of offering an option that owners cooperatively manage the VRP to save their costs. We present cooperative game theory techniques for cost savi...

The vehicle routing problem (VRP) determines a delivery route that minimizes the cost. In this study, we consider stochastic VRP with uncertainty and variation in customer demand, which may cause shortage of products during delivery. case, vehicles have to return depot replenish products. We model sum additional cost caused by normal

In this paper we present a new approach to tackle complex routing problems with an improved state representation that utilizes the model complexity better than previous methods. We enable by training from temporal differences. Specifically Q-Learning is employed. show our achieves state-of-the-art performance for autoregressive policies sequentially insert nodes construct solutions on Capacitat...

Wepropose a generalization of themulti-depot capacitated vehicle routing problemwhere the assumption of visiting each customer does not hold. In this problem, called the Multi-Depot Covering Tour Vehicle Routing Problem (MDCTVRP), the demand of each customer could be satisfied in two different ways: either by visiting the customer along the tour or by “covering” it. When a customer is visited, ...

Based on the characteristics of perishable goods, we extend the location-routing problem with distance constraints by adopting chance constrained goal programming approach to solve the uncertainty and to express the different priority levels of decisions. The random of depot construction costs and vehicle routing travel time is taken into account. Meanwhile, a two-stage genetic algorithm incorp...

This paper presents a unified exact method for solving an extended model of the well-known Capacitated Vehicle Routing Problem (CVRP), called the Heterogenous Vehicle Routing Problem (HVRP), where a mixed fleet of vehicles having different capacities, routing and fixed costs is used to supply a set of customers. The HVRP model considered in this paper contains as special cases: the Single Depot...

The vehicle routing problem with simultaneous distribution and collection (VRPSDC) is the variation of the capacitated vehicle routing problem that arises when the distribution of goods from a depot to a set of customers and the collection of waste from the customers to the depot must be performed by the same vehicles of limited capacity and the customers can be visited in any order. We study h...