We present a unified heuristic which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacitated vehicle routing problem (CVRP), the multi-depot vehicle routing problem (MDVRP), the site-dependent vehicle routing problem (SDVRP) and the open vehicle routing problem (OVRP). All problemvariants are transformed int...

time-dependent vehicle routing problem is one of the most applicable but least-studied variants of routing and scheduling problems. in this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. to deal with the traffic congestions, we also considered that the vehicles are not forced to come...

In this article we introduce and implement a branch-and-cut-and-price algorithm for the Multiple Depot Vehicle Routing Problem with Stochastic Demands. We consider the delivery of a common commodity to a set of customers from a set of non-capacitated depots. The demand of each customer is described by a random variable, whose actual value becomes known upon arrival at the customer. The deliveri...

This paper concerns the Split Delivery Vehicle Routing Problem (SDVRP). This problem is a relaxation of the Capacitated Vehicle Routing Problem (CVRP) since the customers’ demands are allowed to be split. We deal with the cases where the fleet is unlimited (SDVRP-UF) and limited (SDVRP-LF). In order to solve them, we implemented a multi-start Iterated Local Search (ILS) based heuristic that inc...

We study a variant of the vehicle routing problem that allows vehicles with multiple compartments. The need for multiple compartments frequently arises in practical applications when there are several products of different quality or type, that must be kept or handled separately. The resulting problem is called the multi-compartment vehicle routing problem (MCVRP). We propose a tabu search heur...

This paper aims to present a generalized ontology model for the Vehicle Routing Problem (VRP) and it gives some out-plant material handling case studies. The is logistics task where customers with specific need products are served within least possible distance traveled by vehicles. has been highly investigated in operations research, computer science, transportation mathematics. As our new app...

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

This article deals with a complex vehicle routing problem that can be seen as a new extension of the basic vehicle routing problem. The proposed model is a multi-objective combinatorial optimization problem that considers three objectives and multiple periods, which models in a closer way the real distribution problems. The first objective is cost minimization, the second is balancing work leve...