Bookmobile routing and scheduling in Buskerud County , Norway

A bookmobile is a specially adapted bus or van used as part of the outreach operations of public library systems. Bookmobiles play a significant part in the service of the public library system in Buskerud County, Norway. They are used to deliver and collect library materials (printed books, audio books, periodicals, and music) to and from borrower groups throughout the County, many in remote areas. The question of how best to utilize the County’s bookmobile resources can be modelled as an interesting variation of one of the classical models of OR; the vehicle scheduling and routing problem. The combination of the features that make this scenario nonstandard include: multiple depots, simultaneous cost minimization and prize collection objectives, differing customer service levels, time windows, route start time flexibility for some routes, multiple route duration restrictions, route lunch breaks, and overnight stays on certain routes. We report on a model for the bookmobile problem and the outcome of applying it to the Buskerud County bookmobile system.

[1]  W. Turner,et al.  Transportation Routing Problem—A Survey , 1974 .

[2]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[3]  Mark S. Daskin,et al.  Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms , 1992, Transp. Sci..

[4]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[5]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

[6]  Fred Glover,et al.  Extensions of the Petal Method for Vehicle Routeing , 1993 .

[7]  Magid Igbaria,et al.  FleetManager: a microcomputer-based decision support system for vehicle routing , 1996, Decis. Support Syst..

[8]  Jean-Yves Potvin,et al.  The Vehicle Routing Problem with Time Windows Part I: Tabu Search , 1996, INFORMS J. Comput..

[9]  Bruce L. Golden,et al.  The team orienteering problem , 1996 .

[10]  John E. Beasley,et al.  The Vehicle Routing-Allocation Problem: A unifying framework , 1996 .

[11]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[12]  Steven E. Butt,et al.  An optimal solution procedure for the multiple tour maximum collection problem using column generation , 1999, Comput. Oper. Res..

[13]  Larry W. Jacobs,et al.  Optimal Models for Meal-Break and Start-Time Flexibility in Continuous Tour Scheduling , 2000 .

[14]  Vladimir Vacic,et al.  VEHICLE ROUTING PROBLEM WITH TIME WINDOWS , 2014 .