Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Integer Programming Models of Bookmobile Routing

  • Chapter
Aspects of Mathematical Modelling

Part of the book series: Mathematics and Biosciences in Interaction ((MBI))

  • 1265 Accesses

Abstract

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 utilise the County’s bookmobile resources can be modelled as an interesting variation of one of the classical models of operational research — the travelling salesman problem. The combination of the features that make this scenario non-standard include multiple depots, simultaneous cost minimisation 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 models for the bookmobile problem, and the outcome of its application to the Buskerud County bookmobile system.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Ascheuer, M. Fischetti and M. Grotschel, Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Mathematical Programming 90 (2001) 475–506.

    Article  MATH  MathSciNet  Google Scholar 

  2. E. Baker, An exact algorithm for the time constrained travelling salesman problem. Operations Research 31 (1983) 938–945.

    MATH  Google Scholar 

  3. T. Bektas, The multiple traveling salesman problem: An overview of formulations and solution procedures. OMEGA 34 (2006), 209–219.

    Article  Google Scholar 

  4. N.L. Biggs, E. K. LLoyd, and R. J. Wilson, Graph Theory 1736—1936. Clarendon Press, Oxford, 1976.

    MATH  Google Scholar 

  5. M. J. Brusco, and L. J. Jacobs, Optimal models for meal-break and start-time flexibility in continuous tour scheduling. Management Science 46 (2000), 1630–1641.

    Article  Google Scholar 

  6. R. E. Burkard, Travelling salesman and assignment problems: A survey. In: Discrete Optimization 1 (P. L. Hammer, E. L. Johnson, and B. H. Korte, eds.), Annals of Discrete Mathematics 4, North-Holland, Amsterdam (1979), 193–215.

    Google Scholar 

  7. W. B. Carlton and J. W. Barnes, Solving the travelling-salesman problem with time windows using tabu search. IEE Transactions 28 (1996), 617–629.

    Google Scholar 

  8. A.E. Cartera and C.T. Ragsdale, A new approach to solving the multiple traveling salesperson problem using genetic algorithms. European Journal of Operational Research 175 (2006), 246–257.

    Article  MathSciNet  Google Scholar 

  9. N. Chandran, T.T. Narendran, and K. Ganesh, A clustering approach to solve the multiple travelling salesmen problem. International Journal of Industrial and Systems Engineering 1 (2006), 1–20.

    Article  Google Scholar 

  10. G. B. Dantzig, R. Fulkerson, and S. M. Johnson, Solution of a large-scale traveling salesman problem. Operations Research 2 (1954), 393–410.

    MathSciNet  Google Scholar 

  11. Y. Dumas, J. Desrosiers, and E. Gelinas, An optimal algorithm for the travelling salesman problem with time windows. Operations Research 43 (1995), 367–371.

    MATH  MathSciNet  Google Scholar 

  12. F. Focacci, A. Lodi, and M. Milano, A hybrid exact algorithm for the TSPTW. INFORMS Journal on Computing 14 (2002), 403–17.

    Article  MathSciNet  Google Scholar 

  13. G. Gutin and A. P. Punnen, The Traveling Salesman Problem and Its Variations. Springer-Verlag, Berlin, 2006.

    Google Scholar 

  14. M. Held and R. M. Karp, The traveling-salesman problem and minimum spanning trees. Operations Research 18 (1970), 1138–1162.

    Article  MATH  MathSciNet  Google Scholar 

  15. A. Larsen, O.B. G. Madsen, and M. M. Solomon, The A-priori Dynamic Traveling Salesman Problem with Time Windows. Transportation Science 38 (2004), 459–472.

    Article  Google Scholar 

  16. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy-Khan, and D. B. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons, New York, 1985.

    MATH  Google Scholar 

  17. J.D. C. Little, K.G. Murty, D.W. Sweeney, and C. Karel, An algorithm for the traveling salesman problem, Operations Research 11 (1963), 972–989.

    MATH  Google Scholar 

  18. K. Menger, Das Botenproblem. In Ergebnisse eines Mathematischen Kolloquiums 2 (K. Menger, editor), Teubner, Leipzig (1932), 11–12.

    Google Scholar 

  19. S. Mitrovic-Minic and R. Krishnamurti, The multiple TSP with time windows: vehicle bounds based on precedence graphs. Operations Research Letters 34 (2006), 111–120.

    Article  MATH  MathSciNet  Google Scholar 

  20. H.D. Nguyen, I.Y.K. Yamamori, and M. Yasunaga, Implementation of an Effective Hybrid GA for Large-Scale Traveling Salesman Problems. IEEE Transactions on Systems, Man and Cybernetics Part B: Cybernetics 37 (2007), 92–99.

    Article  Google Scholar 

  21. J. W. Ohlmann and B. W. Thomas, A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows. INFORMS Journal on Computing 19 (2007), 80–90.

    Article  MathSciNet  Google Scholar 

  22. G. Pessant, M. Gendreau, J.-Y. Potvin, and J.-M. Rousseau, An exact constraint logic programming algorithm for the travelling salesman problem with time windows. INFORMS Journal on Computing 19 (1998), 12–29.

    Google Scholar 

  23. D. J. Rosenkrantz, R. E. Stearns, and P. M. Lewis II An Analysis of Several Heuristics for the Traveling Salesman Problem. SIAM Journal of Computing 6 (1977), 563–581.

    Article  MATH  MathSciNet  Google Scholar 

  24. B. Tolga, The multiple traveling salesman problem: an overview of formulations and solution procedures. OMEGA 34 (2006), 209–219.

    Article  Google Scholar 

  25. H-K. Tsai, J-M. Yang, Y-F. Tsai, and C-Y. Kao, An evolutionary algorithm for large traveling salesman problems. IEEE Transactions on Systems, Man and Cybernetics Part B: Cybernetics 34 (2004) 1718–1729.

    Article  Google Scholar 

  26. R. Wolfler-Calvo, A new heuristic for the travelling salesman problem with time windows. Transportation Science 34 (2000) 113–124.

    Article  Google Scholar 

  27. XPRESS-MP. Dash Optimization, Blisworth NN73BX, UK.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidade Federal de Goiás, Campus II Samambaia, Goiania/GO, 74000-001, Brazil

    Les R. Foulds

  2. Molde University College, P.O. Box 2110, NO-6402, Molde, Norway

    Stein W. Wallace

  3. University of Loughborough, Great Britain

    John Wilson

  4. School Information Systems Curtin Business School, Curtin University of Technology, GPO Box U1987, Perth, WA, 6845, Australia

    Martin West

Authors
  1. Les R. Foulds
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stein W. Wallace
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. John Wilson
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Martin West
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. Mathematics, Universiti Brunei Darussalam, BE1410, Gadong, Brunei

    Roger J. Hosking

  2. Dipto. Matematica, Università di Torino, Via Carlo Alberto 10, 10123, Torino, Italy

    Ezio Venturino

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Birkhäuser Verlag Basel/Switzerland

About this chapter

Cite this chapter

Foulds, L.R., Wallace, S.W., Wilson, J., West, M. (2008). Integer Programming Models of Bookmobile Routing. In: Hosking, R.J., Venturino, E. (eds) Aspects of Mathematical Modelling. Mathematics and Biosciences in Interaction. Birkhäuser Basel. https://doi.org/10.1007/978-3-7643-8591-0_18

Download citation

Publish with us

Policies and ethics

Search

Navigation