Skip to main content

Automated Tuning of a Column Generation Algorithm

  • Conference paper
  • First Online:
Learning and Intelligent Optimization (LION 2020)

Abstract

This study concerns the use of automatic classification techniques for the purpose of self-tuning an exact optimization algorithm: in particular, the purpose is to automatically select the critical resource in a dynamic programming pricing algorithm within a branch-and-cut-and-price algorithm for the Electric Vehicle Routing Problem.

Partially funded by Regione Lombardia, grant agreement n. E97F17000000009, Project AD-COM.

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. Gleixner, A., et al.: The SCIP optimization suite 6.0, July 2018. Available at Optimization Online and as ZIB-Report 18–26. http://nbn-resolving.de/urn:nbn:de:0297-zib-69361. Accessed 28 Jan 2019

  2. Han, J., Kamber, M., Pei, J.: Data Mining: Concepts and Techniques, 3rd edn. Morgan Kaufmann Publishers, Waltam (2012)

    MATH  Google Scholar 

  3. Therneau, T., Atkinson, B.: rpart: recursive partitioning and regression trees. R package version 4.1-15 (2019). https://CRAN.R-project.org/package=rpart. Accessed 22 Jan 2019

  4. Meyer, D., Dimitriadou, E., Hornik, K., Weingessel, A., Leisch, F.: e1071: Misc Functions of the Department of Statistics, Probability Theory Group (Formerly: E1071), TU Wien. R package version 1.7-2. https://CRAN.R-project.org/package=e1071. Accessed 22 Jan 2019

  5. Chen, T., He, T., Benesty, M.: xgboost: extreme gradient boosting. R package version 0.4-2. https://CRAN.R-project.org/package=xgboost. Accessed 22 Jan 2019

  6. Baldacci, R., Mingozzi, A., Roberti, R.: New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59, 1269–1283 (2011)

    Article  MathSciNet  Google Scholar 

  7. Bezzi, D.: Algoritmo di ottimizzazione per l’Electric Vehicle Orienteering Problem. Master degree thesis, University of Milan (2017)

    Google Scholar 

  8. Bezzi, D., Ceselli, A., Righini, G.: Dynamic programming for the electric vehicle orienteering problem with multiple technologies. In: Odysseus 2018, Cagliari, Italy (2018)

    Google Scholar 

  9. 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). https://doi.org/10.1007/BF01589353

    Article  MathSciNet  MATH  Google Scholar 

  10. Desaulniers, G., Errico, F., Irnich, S., Schneider, M.: Exact algorithms for electric vehicle-routing problems with time windows. Oper. Res. 64(6), 1388–1405 (2016)

    Article  MathSciNet  Google Scholar 

  11. Feillet, D., Dejax, P., Gendreau, M., Gueguen, C.: An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44, 216–229 (2004)

    Article  MathSciNet  Google Scholar 

  12. Felipe Ortega, A., Ortuño Sánchez, M.T., Righini, G., Tirado Domínguez, G.: A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges. Transp. Res. Part E 71, 111–128 (2014)

    Article  Google Scholar 

  13. Keskin, M., Laporte, G., Çatay, B.: Electric vehicle routing problem with time-dependent waiting times at recharging stations. Comput. Oper. Res. 107, 77–94 (2019)

    Article  MathSciNet  Google Scholar 

  14. Pelletier, S., Jabali, O., Laporte, G.: Goods distribution with electric vehicles: review and research perspectives. Transp. Sci. 50(1), 3–22 (2016)

    Article  Google Scholar 

  15. Righini, G., Salani, M.: Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discret. Optim. 3, 255–273 (2006)

    Article  MathSciNet  Google Scholar 

  16. Righini, G., Salani, M.: New dynamic programming algorithms for the resource-constrained elementary shortest path problem. Networks 51, 155–170 (2008)

    Article  MathSciNet  Google Scholar 

  17. Righini, G., Salani, M.: Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming. Comput. Oper. Res. 36, 1191–1203 (2009)

    Article  Google Scholar 

  18. Schneider, M., Stenger, A., Goeke, D.: The electric vehicle-routing problem with time windows and recharging stations. Transp. Sci. 48, 500–520 (2014)

    Article  Google Scholar 

  19. Schneider, M.: Personal Communication (2014)

    Google Scholar 

  20. Khalil, E.B.: Machine learning for integer programming. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (2016)

    Google Scholar 

  21. Kruber, M., Lübbecke, M.E., Parmentier, A.: Learning when to use a decomposition. In: Salvagnin, D., Lombardi, M. (eds.) CPAIOR 2017. LNCS, vol. 10335, pp. 202–210. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-59776-8_16

    Chapter  Google Scholar 

  22. Basso, S., Ceselli, A., Tettamanzi, A.: Random sampling and machine learning to understand good decompositions. Ann. Oper. Res. 284, 501–526 (2018). https://doi.org/10.1007/s10479-018-3067-9

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alberto Ceselli .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bezzi, D., Ceselli, A., Righini, G. (2020). Automated Tuning of a Column Generation Algorithm. In: Kotsireas, I., Pardalos, P. (eds) Learning and Intelligent Optimization. LION 2020. Lecture Notes in Computer Science(), vol 12096. Springer, Cham. https://doi.org/10.1007/978-3-030-53552-0_21

Download citation

Publish with us

Policies and ethics