By Topic

Using randomization to solve the deterministic single and multiple vehicle routing problem with service time constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Jairo R. Montoya-Torres ; Escuela de Ciencias Económicas y Administrativas, Universidad de La Sabana, Autopista norte de Bogotá, D.C., Chía (Cundinamarca), Colombia ; Edgar Gutierrez Franco ; Edgar H. Alfonso-Lizarazo ; Ana X. Halabi

This paper considers the deterministic vehicle routing problem with service time requirements for delivery. Service requests are also available at different times known at the initial time of route planning. This paper presents an approach based on the generation of service sequences (routes) using randomness. Both the single-vehicle and the multiple-vehicle cases are studied. Our approach is validated using random-generated data and compared against the optimal solution obtained by mathematical programming for small-sized instances, as well as against known lower bounds for medium to large-sized instances. Results show that our approach is competitive with reference to the value of the objective function, and requires less computational time in comparison with the exact resolution procedure.

Published in:

Proceedings of the 2009 Winter Simulation Conference (WSC)

Date of Conference:

13-16 Dec. 2009