The periodic vehicle routing problem (PVRP) first appeared in 1974 in a paper about
garbage collection (Beltrami and Bodin, Networks 4 (1974), 65–74). The wide applicability …

An increasing number of companies focus on customer satisfaction to increase the lifetime
value of each customer. In vehicle routing, customer satisfaction is often a result of …

We propose an algorithmic framework that successfully addresses three vehicle routing
problems: the multidepot VRP, the periodic VRP, and the multidepot periodic VRP with …

We propose a tabu search heuristic capable of solving three well‐known routing problems:
the periodic vehicle routing problem, the periodic traveling salesman problem, and the multi …

In the standard, capacitated vehicle routing problem (VRP), a homogeneous fleet of vehicles
services a set of customers from a single depot. Each vehicle has a fixed capacity that …

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 …

The aim of this paper is to propose a new heuristic for the Periodic Vehicle Routing Problem
(PVRP) without time windows. The PVRP extends the classical Vehicle Routing Problem …

A solution construction method and a tabu search improvement heuristic coupled with the
deviation concept found in deterministic annealing is developed to solve the truck and trailer …

This chapter presents an overview of the Period Vehicle Routing Problem, a generalization
of the classic vehicle routing problem in which driver routes are constructed over a period of …

In this paper, we study an extension of the PVRP where the vehicles can renew their
capacity at some intermediate facilities. Each vehicle returns to the depot only when its work …