This paper introduces a parallel iterated tabu search heuristic for solving four different routing problems: the classical vehicle routing problem (VRP), the periodic VRP, the multi-depot VRP, and the site-dependent VRP. In addition, it is applicable to the time-window constrained variant of these problems. Using the iterated local search framework, the heuristic combines tabu search with a sim...

In this work we investigate two variants of the Stochastic Vehicle Routing Problem: The Vehicle Routing Problem with Stochastic Demands and the Vehicle Routing Problem with Stochastic Demands and Customers. We show that under some moderate conditions there is an asymptotic equivalence between the Vehicle Routing Problem with Stochastic Demands and the Traveling Salesman Problem, as well as betw...

In vehicle routing problems (VRPs) the decisions to be taken concern assignment of customers vehicles and sequencing assigned each vehicle. Additional may need jointly taken, depending on specific problem setting. this paper, after discussing different kinds in classes VRPs, class where decision about when routes start from depot has is considered related literature reviewed. This problems, tha...

It is well known that the final cost of commercial products is mostly due to expenses than to their transport. In this context, the vehicle routing problem appears aiming to optimize the routes of a fleet which is responsible for providing pick-up and delivery services. In face of the necessity in attending requests that come during the fleet operation time, the dynamic vehicle routing problem ...

This paper presents an artificial bee colony (ABC) algorithm adjusted for the capacitated vehicle routing problem. The vehicle routing problem is an NP-hard problem and capacitated vehicle routing problem variant (CVRP) is considered here. The artificial bee metaheuristic was successfully used mostly on continuous unconstrained and constrained problems. Here this algorithm has been implemented ...

This paper deals with a real-life vehicle delivery routing problem, which is a seafood product delivery routing problem. Considering the features of the seafood product delivery routing problem, this paper formulated this problem as a multi-depot open vehicle routing problem. Since the multi-depot open vehicle routing problem is a very complex problem, a method is used to reduce the complexity ...

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

We consider a Periodic Load-dependent Capacitated Vehicle Routing Problem (PLCVRP) encountered by medical centers and medical waste collection companies for the design of a weekly inventory routing schedule to transport medical wastes to treatment sites. In addition to minimization of transportation risk, occupational risk related to temporary storage of hazardous wastes at the health-care cent...

The paper presents an efficient Hybrid Genetic Search with Advanced Diversity Control for a large class of time-constrained vehicle routing problems, introducing several new features to manage the temporal dimension. New move evaluation techniques are proposed, accounting for penalized infeasible solutions with respect to time-window and duration constraints, and allowing to evaluate moves from...