Improved bounds for vehicle routing solutions

We present lower bounds for the vehicle routing problem (VRP) with and without split deliveries, improving the well known bound of Haimovich and Rinnooy Kan. These bounds are then utilized in a design of best-to-date approximation algorithms. Key words: Vehicle routing problem, Lower bound, Approximation algorithm

• Type: Journal
• Year: 2006
• Where: DISOPT
• Authors: Agustín Bompadre, Moshe Dror, James B. Orlin
• Keywords: Approximation Algorithm, DISOPT 2006, Lower Bound, Vehicle Routing Problem