Skip to main content
SpringerLink
Log in

Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery

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

Abstract

This work proposes a Branch-cut-and-price (BCP) approach for the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). We also deal with a particular case of the VRPSPD, known as the Vehicle Routing Problem with Mixed Pickup and Delivery. The BCP algorithm was tested in well-known benchmark instances involving up to 200 customers. Four instances were solved for the first time and some LBs were improved.

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

Similar content being viewed by others

References

  1. Berbeglia, G., Cordeau, J.F., Gribkovskaia, I., Laporte, G.: Static pickup and delivery problems: a classification scheme and survey. Top 15, 1–31 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  2. Christofides, N., Mingozzi, A., Toth, P.: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Program. 20, 255–282 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  3. Dell’Amico, M., Righini, G., Salani, M.: A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection. Transp. Sci. 40(2), 235–247 (2006)

    Article  Google Scholar 

  4. Dethloff, J.: Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR Spektr. 23, 79–96 (2001)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Gajpal, Y., Abad, P.: An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup. Comput. Oper. Res. 36(12), 3215–3223 (2009)

    Article  MATH  Google Scholar 

  7. Lysgaard, J.: A package of separation routines for the capacited vehicle routing problem. Technical report. www.hha.dk/lys/CVRPSEP.htm (2003)

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Montané, F.A.T., Galvão, R.D.: A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Comput. Oper. Res. 33(3), 595–619 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  10. Salhi, S., Nagy, G.: A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. J. Oper. Res. Soc. 50, 1034–1042 (1999)

    MATH  Google Scholar 

  11. Subramanian, A., Drummond, L.M.A., Bentes, C., Ochi, L.S., Farias, R.: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 37(11), 1899–1911 (2010)

    Article  MATH  Google Scholar 

  12. Subramanian, A., Uchoa, E., Ochi, L.S.: New lower bounds for the vehicle routing problem with simultaneous pickup and delivery. In: Proceedings of the 9th International Symposium on Experimental Algorithms (SEA). Lecture Notes in Computer Science, pp. 276–287 (2010)

  13. Subramanian, A., Uchoa, E., Ochi, L.S.: New lower bounds for the vehicle routing problem with simultaneous pickup and delivery. Technical Report 01/10, UFF, Niterói, Brazil (2010)

  14. Subramanian, A., Uchoa, E., Pessoa, A.A., Ochi, L.S.: Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery. Oper. Res. Lett. 39(5), 338–341 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  15. Zachariadis, E.E., Kiranoudis, C.T.: A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pick-ups and deliveries. Expert Syst. Appl. 38(3), 2717–2726 (2011)

    Article  Google Scholar 

Download references

Acknowledgments

This work was partially supported by the following Brazilian research agencies: CNP\(_\mathrm{q}\), CAPES and FAPERJ.

Author information

Authors and Affiliations

  1. Departamento de Engenharia de Produção, Centro de Tecnologia, Universidade Federal da Paraíba, Campus I-Bloco G, Cidade Universitária, João Pessoa, PB,  58051-970, Brazil

    Anand Subramanian

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

    Anand Subramanian & Luiz Satoru Ochi

  3. Departamento de Engenharia de Produção, Universidade Federal Fluminense, Rua Passo da Pátria 156, Bloco E-4ºandar, São Domingos, Niterói, RJ, 24210-240, Brazil

    Eduardo Uchoa & Artur Alves Pessoa

Authors
  1. Anand Subramanian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eduardo Uchoa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Artur Alves Pessoa
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Luiz Satoru Ochi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anand Subramanian.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Subramanian, A., Uchoa, E., Pessoa, A.A. et al. Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery. Optim Lett 7, 1569–1581 (2013). https://doi.org/10.1007/s11590-012-0570-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-012-0570-9

Keywords

Search

Navigation