A Tabu Search Algorithm for the Periodic Vehicle Routing Problem with Multiple Vehicle Trips and Accessibility Restrictions (with F. Alonso and M.J. Alvarez) Journal of the Operational Research Society vol.59, 2008, pp963-976
In this paper we consider a periodic vehicle routing problem that includes, in addition to the classical constraints, the possibility of a vehicle doing more than one route per day, as long as the maximum daily operation time for the vehicle is not exceeded. In addition some constraints relating to accessibility of the vehicles to the customers, in the sense that not every vehicle can visit every customer, must be observed. We refer to the problem we consider here as the Site-Dependent Multi-Trip Periodic Vehicle Routing Problem. An algorithm based on tabu search is presented for the problem and computational results presented on randomly generated test problems that are made publicly available. Our algorithm is also tested on a number of routing problems from the literature that constitute particular cases of the proposed problem. Specifically we consider the Periodic Vehicle Routing Problem; the Site-Dependent Vehicle Routing Problem; the Multi-Trip Vehicle Routing Problem; and the classical Vehicle Routing Problem. Computational results for our tabu search algorithm on test problems taken from the literature for all of these problems are presented.
Keywords: tabu search; periodic vehicle routing problem; multiple use of vehicles; accessibility restrictions; site-dependencies; multi-trip
J E Beasley