Skip to main content

A Tangible Collaborative Decision Support System for Various Variants of the Vehicle Routing Problem

  • Conference paper
  • First Online:
Book cover Decision Support Systems V – Big Data Analytics for Decision Making (ICDSST 2015)

Part of the book series: Lecture Notes in Business Information Processing ((LNBIP,volume 216))

Included in the following conference series:

  • 2040 Accesses

Abstract

The Vehicle Routing Problem (VRP) is a well-known combinatorial optimization problem where a number of customers must be served with a fleet of vehicles. The classical variation of the VRP is the Capacicated Vehicle Routing Problem (CVRP) with the additional constraint that each vehicle must have uniform capacity. Many Decision Support Systems (DSS) have been implemented to solve real life problems of the VRP and its’ variants, but they do not allow multiple decision makers to explore several scenarios of a given problem simultaneously and collaborate with each other in order to find the best possible solution. In this paper, we extend our previous work [35] and incorporate in our spatial DSS four variants of the CVRP: (i) Distance Constrained Vehicle Routing Problem (DVRP), (ii) Vehicle Routing Problem with Time Windows (VRPTW), (iii) Vehicle Routing Problem with Backhauls (VRPB), and (iv) Vehicle Routing Problem With Pickup and Delivery (VRPPD). This extension allows decision makers to solve specific routing problems according to their needs. The proposed collaborative spatial DSS allows two decision makers to collaborate with each other in order to find the best possible solution through a tangible interface. The locations are added through interactive Google Maps and other parameters through user-friendly forms that can be manipulated via tangible interfaces. The proposed DSS has been implemented using Java, TUIO protocol, jsprit, and Google Maps.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

References

  1. Anderson, D., Anderson, E., Lesh, N., Marks, J., Mirtich, B., Ratajczak, D., Ryall, K.: Human-guided simple search. In: Seventeenth National Conference on Artificial Intelligence Conference Proceedings (AAAI-2000), pp. 209–216 (2000)

    Google Scholar 

  2. ArcGIS: http://www.esri.com/software/arcgis. Last access on 10 April 2014

  3. Athanasiadis, I.: Analysis, design and implementation of a hybrid system for teaching basic programming structures using traditional and tangible user interfaces to pre teenagers. MSc Thesis. School of Science and Technology, Hellenic Open University (2014)

    Google Scholar 

  4. Blasum, U., Hochstttler, W.: Application of the branch and cut method to the vehicle routing problem. Technical report, zaik2000-386, Zentrum fur Angewandte Informatik Koln (2000)

    Google Scholar 

  5. Bodin, L., Golden, B.L., Assad, A., Ball, M.O.: The state of the art in the routing and scheduling of vehicles and crews. Comput. Oper. Res. 10, 69–221 (1983)

    Google Scholar 

  6. Clarke, G., Wright, J.V.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12, 568–581 (1964)

    Article  Google Scholar 

  7. Cordeau, J.F., Gendreau, M., Hertz, A., Laporte, G., Sormany, J.S.: New heuristics for the vehicle routing problem. In: Langevin, A., Riopel, D. (eds.) Logistics Systems: Design and Optimzation, pp. 279–297. Springer, New York (2004)

    Google Scholar 

  8. Community Core Vision: http://nuicode.com/projects/tbeta. Last access on 10 April 2014

  9. Cook, W., Rich, J.L.: A parallel cutting plane algorithm for the vehicle routing problem with time windows. Technical report, Computational and Applied Mathematics, Rice University, Houston, TX (1999)

    Google Scholar 

  10. Dantzig, G.B., Ramser, R.H.: The truck dispatching problem. Manage. Sci. 6, 80–91 (1959)

    Article  Google Scholar 

  11. Deif, I., Bodin, L.D.: Extension of the clarke and wright algorithm for solving the vehicle routing problem with backhauling. In: Kidder, A. (ed.) Proceedings of the Babson College Conference on Software Uses in Transportation and Logistic Management, Babson Park, MA, pp. 75–96 (1984)

    Google Scholar 

  12. Dumas, Y., Desrosiers, J., Soumis, F.: The pickup and delivery problem with time windows. Eur. J. Oper. Res. 54, 7–22 (1991)

    Article  Google Scholar 

  13. Engelbrecht, A., Borges, M., Vivacqua, A.S.: Digital tabletops for situational awareness in emergency situations. In: 15th International Conference Proceedings on Computer Supported Cooperative Work in Design (CSCWD), pp. 669–676 (2011)

    Google Scholar 

  14. Fukasawa, R., Longo, H., Lysgaard, J., de Arago, M.P., Reis, M., Uchoa, E., Werneck, R.F.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Program. 106(3), 491–511 (2006)

    Article  Google Scholar 

  15. Goetschalckx, M., Jacobs-Blecha, C.: The vehicle routing problem with backhauls. Eur. J. Oper. Res. 42, 39–51 (1989)

    Article  Google Scholar 

  16. Hofstra, H., Scholten, H., Zlatanova, S., Scotta, A.: Multi-user tangible interfaces for effective decision-making in disaster management. In: Nayak, S., Zlatanova, S. (eds.) Remote Sensing and GIS Technologies for Monitoring and Prediction of Disasters, pp. 243–266. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  17. Homberger, J., Gehring, H.: Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR 37, 297–318 (1999)

    Google Scholar 

  18. Ioannou, G., Kritikos, M.N., Prastacos, G.P.: Map-Route: a GIS-based decision support system for intra-city vehicle routing with time windows. J. Oper. Res. Soc. 3, 842–854 (2002)

    Article  Google Scholar 

  19. jsprit: https://github.com/jsprit/jsprit. Last access on 10 April 2014

  20. Kallehauge, B., Larsen, J., Madsen, O.B.G.: Lagrangean duality and nondifferentiable optimization applied on routing with time windows-experimental results. Internal report IMM-REP-2000-8, Department of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark (2000)

    Google Scholar 

  21. Kaltenbrunner, M., Bovermann, T., Bencina, R., Costanza, E.: TUIO - a protocol for table-top tangible user interfaces. In: 6th International Workshop on Gesture in Human-Computer Interaction and Simulation Proceedings (2005)

    Google Scholar 

  22. Kohl, N., Desrosiers, J., Madsen, O.B.G., Solomon, M.M., Soumis, F.: 2-Path cuts for the vehicle routing problem with time windows. Transp. Sci. 33, 101–116 (1999)

    Article  Google Scholar 

  23. Kientz, J.A., Hayes, G.R., Abowd, G.D., Grinter, R.E.: From the war room to the living room: decision support for home-based therapy teams. In: 20th Anniversary Conference on Computer Supported Cooperative Work Proceedings, pp. 209–218 (2006)

    Google Scholar 

  24. Laporte, G.: Fifty years of vehicle routing. Transp. Sci. 43(4), 408–416 (2009)

    Article  Google Scholar 

  25. Laporte, G., Desrochers, M., Nobert, Y.: Two exact algorithms for the distance-constrained vehicle routing problem. Networks 14, 161–172 (1984)

    Article  Google Scholar 

  26. Laporte, G., Nobert, Y., Desrochers, M.: Optimal routing under capacity and distance restrictions. Oper. Res. 33, 1050–1073 (1985)

    Article  Google Scholar 

  27. Laporte, G., Semet, F.: Classical heuristics for the capacitated VRP. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, pp. 109–128. SIAM, Philadelphia (2002)

    Google Scholar 

  28. Larsen, J.: Parallellization of the vehicle routing problem with time windows. Ph.D. thesis. Department of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark (1999)

    Google Scholar 

  29. Lysgaard, J., Letchford, A.N., Eglese, R.W.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. 100(2), 423–445 (2004)

    Article  Google Scholar 

  30. Mingozzi, A., Giorgi, S., Baldacci, R.: An exact method for the vehicle routing problem with backhauls. Transp. Sci. 33, 315–329 (1999)

    Article  Google Scholar 

  31. Madni, T.M., Sulaiman, S.B., Tahir, M.: Content-orientation for collaborative learning using tabletop surfaces. In: Proceedings of 2013 International Conference on Information Science and Applications (ICISA), pp. 1–6. IEEE (2013)

    Google Scholar 

  32. Naddef, D., Rinaldi, G.: Branch-and-cut algorithms for the capacitated VRP. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, pp. 53–84. SIAM, Philadelphia (2002)

    Chapter  Google Scholar 

  33. Psaraftis, H.N.: k-Interchange procedures for local search in a precedence-constrained routing problem. Eur. J. Oper. Res. 13, 391–402 (1983)

    Article  Google Scholar 

  34. Ploskas, N., Athanasiadis, I., Papathanasiou, J., Samaras, N: An interactive spatial decision support system enabling co-located collaboration using tangible user interfaces for the multiple capacitated facility location problem. Int. J. Decis. Support Syst. Technol. 7(2) (submitted for publication)

    Google Scholar 

  35. Ploskas, N., Athanasiadis, I., Papathanasiou, J., Samaras, N: A collaborative spatial decision support system for the capacitated vehicle routing problem on a tabletop display. In: Decision Support Systems IV - Information and Knowledge Management in Decision Processes. Springer Proceedings in Business Information Processing (submitted for publication)

    Google Scholar 

  36. Rochat, Y., Taillard, E.D.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147–167 (1995)

    Article  Google Scholar 

  37. Ruiz, R., Maroto, C., Alcaraz, J.: A decision support system for a real vehicle routing problem. Eur. J. Oper. Res. 153(3), 593–606 (2004)

    Article  Google Scholar 

  38. Ruland, K.S., Rodin, E.Y.: The pickup and delivery problem: faces and branchand-cut algorithm. Comput. Math. Appl. 33, 1–13 (1997)

    Article  Google Scholar 

  39. Santos, L., Coutinho-Rodrigues, J., Antunes, C.H.: A web spatial decision support system for vehicle routing using Google Maps. Decis. Support Syst. 51(1), 1–9 (2011)

    Article  Google Scholar 

  40. Savelsbergh, M.W.P., Sol, M.: Drive: dynamic routing of independent vehicles. Oper. Res. 46, 474–490 (1998)

    Article  Google Scholar 

  41. Scott, S.D., Allavena, A., Cerar, K., Franck, G., Hazen, M., Shuter, T., Colliver, C.: Investigating tabletop interfaces to support collaborative decision-making in maritime operations. In: International Command and Control Research and Technology Symposium Proceedings (ICCRTS 2010), pp. 22–24 (2010)

    Google Scholar 

  42. Scotta, A., Pleizier, I.D., Scholten, H.J.: Tangible user interfaces in order to improve collaborative interactions and decision making. In: 25th Urban Data Management Symposium Proceedings, pp. 15–17 (2006)

    Google Scholar 

  43. Taillard, E.D., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31, 170–186 (1997)

    Article  Google Scholar 

  44. Tarantilis, C.D., Kiranoudis, C.T.: Using a spatial decision support system for solving the vehicle routing problem. Inf. Manage. 39(5), 359–375 (2002)

    Article  Google Scholar 

  45. Toth, P., Vigo, D.: An exact algorithm for the vehicle routing problem with backhauls. Transp. Sci. 31, 372–385 (1997)

    Article  Google Scholar 

  46. Toth, P., Vigo, D.: The Vehicle Routing Problem. Siam, Philadelphia (2001)

    Google Scholar 

  47. Toth, P., Vigo, D.: Branch-and-bound algorithms for the capacitated VRP. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, pp. 29–51. SIAM, Philadelphia (2001)

    Google Scholar 

  48. Unfolding: http://unfoldingmaps.org/. Last access on 10 April 2014

  49. Wilson, H., Sussman, J., Wang, H., Higonnet, B.: Scheduling algorithms for diala-ride systems. Technical report USL TR-70-13, Urban Systems Laboratory, MIT, Cambridge, MA (1971)

    Google Scholar 

  50. Yoshida, S., Yano, S., Ando, H.: Implementation of a tabletop 3D display based on light field reproduction. In: Posters of ACM SIGGRAPH 2010, p. 61. ACM (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nikolaos Ploskas .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Ploskas, N., Athanasiadis, I., Papathanasiou, J., Samaras, N. (2015). A Tangible Collaborative Decision Support System for Various Variants of the Vehicle Routing Problem. In: Delibašić, B., et al. Decision Support Systems V – Big Data Analytics for Decision Making. ICDSST 2015. Lecture Notes in Business Information Processing, vol 216. Springer, Cham. https://doi.org/10.1007/978-3-319-18533-0_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18533-0_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18532-3

  • Online ISBN: 978-3-319-18533-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics