Skip to main content
SpringerLink
Log in

Solution strategies for the vehicle routing problem with backhauls

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

The paper concerns the classical vehicle routing problem (VRP) with backhauls (VRPB), which can be seen as a special case of the asymmetric VRP with mixed backhauls (AVRPMB). We tackle the VRPB by: (i) directly applying a state-of-the-art AVRPMB matheuristic for the problem, in which a VRPB instance is transformed into an AVRPMB instance, i.e., the infeasible VRPB arcs are penalized; (ii) adapting the same matheuristic for the VRPB itself, in particular, preventing infeasible moves to be unnecessarily evaluated during the local search and also by only allowing feasible solutions to be explored in all steps of the algorithm; (iii) modifying the set partitioning formulation used in the matheuristic to specifically tackle the VRPB. The three approaches were capable of obtaining all best known solutions for the traditional benchmark instances and the result of two instances were improved. We also compare the performance and scalability of the three strategies for instances with up to 1000 customers.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Battarra, M., Cordeau, J.F., Iori, M.: Pickup-and-delivery problems for goods transportation (chapter 6). In: Toth, P., Vigo, D. (eds.) Vehicle Routing, pp. 161–191. Society for Industrial and Applied Mathematics, Philadelphia (2014)

    Chapter  Google Scholar 

  2. Brandão, J.: A new tabu search algorithm for the vehicle routing problem with backhauls. Eur. J. Oper. Res. 173(2), 540–555 (2006)

    Article  MathSciNet  Google Scholar 

  3. Brandão, J.: A deterministic iterated local search algorithm for the vehicle routing problem with backhauls. TOP 24(2), 445–465 (2016)

    Article  MathSciNet  Google Scholar 

  4. Cordeau, J.F., Gendreau, M., Laporte, G., Potvin, J.Y., Semet, F.: A guide to vehicle routing heuristics. J. Oper. Res. Soc. 53(5), 512–522 (2002)

    Article  Google Scholar 

  5. Cuervo, D.P., Goos, P., Sörensen, K., Arráiz, E.: An iterated local search algorithm for the vehicle routing problem with backhauls. Eur. J. Oper. Res. 237(2), 454–464 (2014)

    Article  Google Scholar 

  6. Gajpal, Y., Abad, P.: Multi-ant colony system (MACS) for a vehicle routing problem with backhauls. Eur. J. Oper. Res. 196(1), 102–117 (2009)

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  8. Koç, Ç., Laporte, G.: Vehicle routing with backhauls: review and research perspectives. Comput. Oper. Res. 91, 79–91 (2018)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  10. Osman, I.H., Wassan, N.A.: A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls. J. Sched. 5(4), 263–285 (2002)

    Article  MathSciNet  Google Scholar 

  11. Queiroga, E., Frota, Y., Sadykov, R., Subramanian, A., Uchoa, E.: On the exact solution for vehicle routing problems with backhauls. Tech. Rep. 3, Niterói, Brazil. http://www2.logis.uff.br/wp-content/uploads/2019/08/L-2019-3.pdf (2019). Accessed 8 Feb 2020

  12. Ropke, S., Pisinger, D.: A unified heuristic for a large class of vehicle routing problems with backhauls. Eur. J. Oper. Res. 171(3), 750–775 (2006)

    Article  MathSciNet  Google Scholar 

  13. Subramanian, A., Uchoa, E., Ochi, L.S.: A hybrid algorithm for a class of vehicle routing problems. Comput. Oper. Res. 40(10), 2519–2531 (2013)

    Article  Google Scholar 

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

    Article  Google Scholar 

  15. Uchoa, E., Pecin, D., Pessoa, A., Poggi, M., Vidal, T., Subramanian, A.: New benchmark instances for the capacitated vehicle routing problem. Eur. J. Oper. Res. 257(3), 845–858 (2017)

    Article  MathSciNet  Google Scholar 

  16. Vidal T (2019) Personal communication

  17. Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A unified solution framework for multi-attribute vehicle routing problems. Eur. J. Oper. Res. 234(3), 658–673 (2014)

    Article  MathSciNet  Google Scholar 

  18. Wassan, N.: Reactive tabu adaptive memory programming search for the vehicle routing problem with backhauls. J. Oper. Res. Soc. 58(12), 1630–1641 (2007)

    Article  Google Scholar 

  19. Zachariadis, E.E., Kiranoudis, C.T.: An effective local search approach for the vehicle routing problem with backhauls. Expert Syst. Appl. 39(3), 3174–3184 (2012)

    Article  Google Scholar 

Download references

Acknowledgements

We would like to thank Dr. Thibaut Vidal for kindly providing the upper bounds for the X instances. This research was partially supported by CNPq, Grants 428549/2016-0 and 307843/2018-1, and by CAPES – Finance Code 001.

Author information

Authors and Affiliations

  1. Departamento de Sistemas de Computação, Centro de Informática, Universidade Federal da Paraíba, Rua dos Escoteiros, Mangabeira, João Pessoa, PB, 58055-000, Brazil

    Anand Subramanian

  2. Instituto de Computação, Universidade Federal Fluminense, Rua Passo da Pátria, São Domingos, Niterói, RJ, 24210-240, Brazil

    Eduardo Queiroga

Authors
  1. Anand Subramanian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eduardo Queiroga
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anand Subramanian.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Subramanian, A., Queiroga, E. Solution strategies for the vehicle routing problem with backhauls. Optim Lett 14, 2429–2441 (2020). https://doi.org/10.1007/s11590-020-01564-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-020-01564-5

Keywords

Search

Navigation