Skip to main content
SpringerLink
Log in
Book cover

Workshop on Engineering Applications

WEA 2018: Applied Computer Sciences in Engineering pp 108–119Cite as

A Mixed-Integer Linear Programming Model for a Selective Vehicle Routing Problem

  • Conference paper
  • First Online:

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 916))

Abstract

In this paper, we propose a new vehicle routing problem variant. The new problem is a type of selective vehicle routing model in which it is not necessary to visit all nodes, but to visit enough nodes in such a way that all clusters are visited and from which it is possible to cover all nodes. Here, a mixed-integer linear programming formulation (MILP) is proposed in order to model the problem. The MILP is tested by using adapted instances from the generalized vehicle routing problem (GVRP). The model is also tested on small size GVRP instances as a special case of our proposed model. The results allow to evaluate the impact of clusters configuration in solver efficacy.

This is a preview of subscription content, 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   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

Learn about institutional subscriptions

References

  1. Afsar, H.M., Labadie, N.: Team orienteering problem with decreasing profits. Electron. Notes Discret. Math. 41, 285–293 (2013)

    Article  Google Scholar 

  2. Afsar, H.M., Prins, C., Santos, A.C.: Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size. Int. Trans. Oper. Res. 21(1), 153–175 (2014)

    Article  MathSciNet  Google Scholar 

  3. Şahinyazan, F.G., Kara, B.Y., Taner, M.R.: Selective vehicle routing for a mobile blood donation system. Eur. J. Oper. Res. 245(1), 22–34 (2015)

    Article  MathSciNet  Google Scholar 

  4. Allahviranloo, M., Chow, J.Y., Recker, W.W.: Selective vehicle routing problems under uncertainty without recourse. Transp. Res. Part E: Logist. Transp. Rev. 62, 68–88 (2014)

    Article  Google Scholar 

  5. Archetti, C., Bianchessi, N., Speranza, M.G.: Optimal solutions for routing problems with profits. Discret. Appl. Math. 161(4–5), 547–557 (2013)

    Article  MathSciNet  Google Scholar 

  6. Baldacci, R., Bartolini, E., Laporte, G.: Some applications of the generalized vehicle routing problem. J. Oper. Res. Soc. 61(7), 1072–1077 (2010)

    Article  Google Scholar 

  7. Battarra, M., Erdoğan, G., Vigo, D.: Exact algorithms for the clustered vehicle routing problem. Oper. Res. 62(1), 58–71 (2014)

    Article  MathSciNet  Google Scholar 

  8. Bektaş, T., Erdoğan, G., Røpke, S.: Formulations and branch-and-cut algorithms for the generalized vehicle routing problem. Transp. Sci. 45(3), 299–316 (2011)

    Article  Google Scholar 

  9. Carrabs, F., Cerrone, C., Cerulli, R., Gaudioso, M.: A novel discretization scheme for the close enough traveling salesman problem. Comput. Oper. Res. 78, 163–171 (2017)

    Article  MathSciNet  Google Scholar 

  10. Doerner, K.F., Gronalt, M., Hartl, R.F., Kiechle, G., Reimann, M.: Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows. Comput. Oper. Res. 35(9), 3034–3048 (2008)

    Article  MathSciNet  Google Scholar 

  11. Ghiani, G., Improta, G.: An efficient transformation of the generalized vehicle routing problem. Eur. J. Oper. Res. 122(1), 11–17 (2000)

    Article  MathSciNet  Google Scholar 

  12. Golden, B.L., Levy, L., Vohra, R.: The orienteering problem. Nav. Res. Logist. 34(3), 307–318 (1987)

    Article  Google Scholar 

  13. Gulczynski, D.J., Heath, J.W., Price, C.C.: The close enough traveling salesman problem: a discussion of several heuristics. In: Alt, F.B., Fu, M.C., Golden, B.L. (eds.) Perspectives in Operations Research. Operations Research/Computer Science Interfaces, vol. 36, pp. 271–283. Springer, Boston (2006). https://doi.org/10.1007/978-0-387-39934-8_16

    Chapter  Google Scholar 

  14. Kara, I., Bektaş, T.: Integer linear programming formulation of the generalized vehicle routing problem. In: Proceedings of the 5th EURO/INFORMS Joint International Meeting (2003)

    Google Scholar 

  15. Laporte, G., Asef-Vaziri, A., Sriskandarajah, C.: Some applications of the generalized travelling salesman problem. J. Oper. Res. Soc. 47(12), 1461–1467 (1996)

    Article  Google Scholar 

  16. Mennell, W.K.: Heuristics for solving three routing problems: Close-enough traveling salesman problem, close-enough vehicle routing problem, sequence-dependent team orienteering problem. Ph.D. thesis, University of Maryland (2009)

    Google Scholar 

  17. Moccia, L., Cordeau, J.-F., Laporte, G.: An incremental tabu search heuristic for the generalized vehicle routing problem with time windows. J. Oper. Res. Soc. 63(2), 232–244 (2012)

    Article  Google Scholar 

  18. Palekar, U., Laporte, G.: Some applications of the clustered travelling salesman problem. J. Oper. Res. Soc. 53(9), 972–976 (2002)

    Article  Google Scholar 

  19. Pop, P., Pintea, C., Dumitrescu, D.: An ant colony algorithm for solving the dynamic generalized vehicle routing problem. Ovidius University Annals of Constanta. Series of Civil Engineering, vol. 1, pp. 373–382 (2009)

    Google Scholar 

  20. Pop, P.C., Kara, I., Marc, A.H.: New mathematical models of the generalized vehicle routing problem and extensions. Appl. Math. Model. 36(1), 97–107 (2012)

    Article  MathSciNet  Google Scholar 

  21. Pop, P.C., Matei, O., Sitar, C.P.: An improved hybrid algorithm for solving the generalized vehicle routing problem. Neurocomputing 109, 76–83 (2013)

    Article  Google Scholar 

  22. Sevaux, M., Sörensen, K., et al.: Hamiltonian paths in large clustered routing problems. In: Proceedings of the EU/MEeting 2008 Workshop on Metaheuristics for Logistics and Vehicle Routing, EU/ME, vol. 8, pp. 411–417 (2008)

    Google Scholar 

  23. Shuttleworth, R., Golden, B.L., Smith, S., Wasil, E.: Advances in meter reading: heuristic solution of the close enough traveling salesman problem over a street network. In: Golden, B., Raghavan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research/Computer Science Interfaces, vol. 43, pp. 487–501. Springer, Boston (2008). https://doi.org/10.1007/978-0-387-77778-8_2

    Chapter  MATH  Google Scholar 

  24. Tsiligirides, T.: Heuristic methods applied to orienteering. J. Oper. Res. Soc 35(9), 797–809 (1984)

    Article  Google Scholar 

  25. Valle, C.A., Martinez, L.C., da Cunha, A.S., Mateus, G.R.: Heuristic and exact algorithms for a min-max selective vehicle routing problem. Comput. Oper. Res. 38(7), 1054–1065 (2011)

    Article  MathSciNet  Google Scholar 

  26. Vidal, T., Battarra, M., Subramanian, A., Erdogan, G.: Hybrid metaheuristics for the clustered vehicle routing problem. Comput. Oper. Res. 58, 87–99 (2015)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Ciencias Matemáticas, Escuela de Ciencias, Universidad EAFIT, Medellín, Colombia

    Andrea Posada, Juan Carlos Rivera & Juan D. Palacio

Authors
  1. Andrea Posada
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Juan Carlos Rivera
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Juan D. Palacio
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Juan Carlos Rivera .

Editor information

Editors and Affiliations

  1. Department of Industrial Engineering, Universidad Distrital Francisco José de Caldas, Bogotá, Colombia

    Juan Carlos Figueroa-García

  2. Department of Industrial Engineering, University of Antioquia, Medellín, Colombia

    Juan G. Villegas

  3. Department of Electronics and Telecomunications Engineering, University of Antioquia, Medellín, Colombia

    Juan Rafael Orozco-Arroyave

  4. Department of Industrial Engineering, University of Antioquia, Medellín, Colombia

    Pablo Andres Maya Duque

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Posada, A., Rivera, J.C., Palacio, J.D. (2018). A Mixed-Integer Linear Programming Model for a Selective Vehicle Routing Problem. In: Figueroa-García, J., Villegas, J., Orozco-Arroyave, J., Maya Duque, P. (eds) Applied Computer Sciences in Engineering. WEA 2018. Communications in Computer and Information Science, vol 916. Springer, Cham. https://doi.org/10.1007/978-3-030-00353-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00353-1_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00352-4

  • Online ISBN: 978-3-030-00353-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation