Papers which use VRPSolver

Papers independent from the authors of the solver

  1. Adamo, T., G. Ghiani, P. Greco, and E. Guerriero. 2021. “Properties and Bounds for the Single-Vehicle Capacitated Routing Problem with Time-Dependent Travel Times and Multiple Trips.” INSTICC; SciTePress. https://doi.org/10.5220/0010322500820087.
  2. Bertazzi, Luca, and Xingyin Wang. 2022. “Matheuristics with Performance Guarantee for the Unsplit and Split Delivery Capacitated Vehicle Routing Problem.” Networks 80 (4): 482–501. https://doi.org/10.1002/net.22115.
  3. Borges, Yulle G. F., Rafael C. S. Schouery, and Flávio K. Miyazawa. 2023. “Mathematical Models and Exact Algorithms for the Colored Bin Packing Problem.” https://doi.org/10.48550/ARXIV.2305.15291.
  4. Eti, Serkan, and Mehmet İnel. 2022. “KÜMELEME VE TASARRUF ALGORİTMASI YARDIMIYLA SİPARİŞ TOPLAMA PROBLEMİ ÜZERİNE AMPİRİK BİR UYGULAMA.” Journal of Research in Business 7 (IMISC2021 Special Issue): 80–90. https://doi.org/10.54452/jrb.1020777.
  5. Gao, Kai, and Jingjin Yu. 2021. “Capacitated Vehicle Routing with Target Geometric Constraints.” In 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 7925–30. https://doi.org/10.1109/IROS51168.2021.9636123.
  6. Gao, Mujin, Yanru Chen, Junheng Li, and M. I. M. Wahab. 2023. “Hybrid Branch-and-Price-and-Cut Algorithm for the Two-Dimensional Vector Packing Problem with Time Windows.” Computers & Operations Research 157: 106267. https://doi.org/10.1016/j.cor.2023.106267.
  7. Li, Jingwen, Yining Ma, Ruize Gao, Zhiguang Cao, Andrew Lim, Wen Song, and Jie Zhang. 2022. “Deep Reinforcement Learning for Solving the Heterogeneous Capacitated Vehicle Routing Problem.” IEEE Transactions on Cybernetics 52 (12): 13572–85. https://doi.org/10.1109/TCYB.2021.3111082.
  8. Morabit, Mouad, Guy Desaulniers, and Andrea Lodi. 2022. “Learning to Repeatedly Solve Routing Problems.” arXiv. https://doi.org/10.48550/ARXIV.2212.08101.
  9. Nekooghadirli, Najmeh, Michel Gendreau, Jean-Yves Potvin, and Thibaut Vidal. 2022. “Workload Equity in Multi-Period Vehicle Routing Problems.” arXiv. https://doi.org/10.48550/ARXIV.2206.14596.
  10. Paro, Davide. 2022. “A Branch-and-Cut Based Pricer for the Capacitated Vehicle Routing Problem.” Master’s thesis, Department of Information Engineering, University of Padova. https://dparo.github.io/posts/msc-dissertation/.
  11. Pereira Oliveira, Willian Jorge. 2022. “Last Mile Delivery with Lockers, Formulations and Heuristics.” Master’s thesis, Universidade Federal de Viçosa. https://www.locus.ufv.br/handle/123456789/30484.
  12. Polten, Lukas, and Simon Emde. 2022. “Multi-Shuttle Crane Scheduling in Automated Storage and Retrieval Systems.” European Journal of Operational Research 302 (3): 892–908. https://doi.org/https://doi.org/10.1016/j.ejor.2022.01.043.
  13. Praxedes, Rafael Maranhão Rego. 2022. “Uma Abordagem Exata Unificada Para Uma Classe de Problemas de Roteamento de Veículos Come Coleta e Entrega Simultâneas.” Master’s thesis, Programa de pós-graduação em informática, Universidade Federal da Paraíba. https://repositorio.ufpb.br/jspui/handle/123456789/25260.
  14. Roboredo, Marcos Costa, Carlos Leonardo Ramos Póvoa, André Soares Velasco, and Frederico Galaxe Paes. 2022. “An Exact Approach for the Multi-Compartment Vehicle Routing Problem.” In Anais Do LIV Simpósio Brasileiro de Pesquisa Operacional. https://proceedings.science/sbpo/sbpo-2022/trabalhos/an-exact-approach-for-the-multi-compartment-vehicle-routing-problem.
  15. Subramanyam, Anirudh, Taner Cokyasar, Jeffrey Larson, and Monique Stinson. 2022. “Joint Routing of Conventional and Range-Extended Electric Vehicles in a Large Metropolitan Network.” Transportation Research Part C: Emerging Technologies 144: 103830. https://doi.org/https://doi.org/10.1016/j.trc.2022.103830.
  16. Volte, Gabriel, Eric Bourreau, Rodolphe Giroudeau, and Olivier Naud. 2023. “Using VRPSolver to Efficiently Solve the Differential Harvest Problem.” Computers & Operations Research 149: 106029. https://doi.org/10.1016/j.cor.2022.106029.
  17. Wang, Akang, Anirudh Subramanyam, and Chrysanthos E. Gounaris. 2022. “Robust Vehicle Routing Under Uncertainty via Branch-Price-and-Cut.” Optimization and Engineering 23 (4): 1895–1948. https://doi.org/10.1007/s11081-021-09680-6.

Papers by the authors of the solver

  1. Balster, Isaac, Teobaldo Bulhões, Pedro Munari, Artur Pessoa, and Ruslan Sadykov. 2022. “A New Family of Route Formulations for Split Delivery Vehicle Routing Problems.” HAL 03900628. Inria Centre at the University of Bordeaux. https://inria.hal.science/hal-03900628.
  2. Ben Mohamed, Imen, Walid Klibi, Ruslan Sadykov, Halil Şen, and François Vanderbeck. 2023. “The Two-Echelon Stochastic Multi-Period Capacitated Location-Routing Problem.” European Journal of Operational Research 306 (2): 645–67. https://doi.org/https://doi.org/10.1016/j.ejor.2022.07.022.
  3. Bulhões, Teobaldo, Ruslan Sadykov, Anand Subramanian, and Eduardo Uchoa. 2020. “On the Exact Solution of a Large Class of Parallel Machine Scheduling Problems.” Journal of Scheduling 23 (4): 411–29. https://doi.org/10.1007/s10951-020-00640-z.
  4. Clementino, Thailsson, Juan Rosas, Rosiane De Freitas, and Eduardo Uchoa. 2022. “Solving Real Urban VRPTW Instances by Applying a Branch-Cut-and-Price via VRPsolver.” In 2022 XVLIII Latin American Computer Conference (CLEI), 1–8. https://doi.org/10.1109/CLEI56649.2022.9959966.
  5. Damião, Caio Marinho, João Marcos Pereira Silva, and Eduardo Uchoa. 2023. “A Branch-Cut-and-Price Algorithm for the Cumulative Capacitated Vehicle Routing Problem.” 4OR 21: 47–71. https://doi.org/10.1007/s10288-021-00498-7.
  6. Errami, Najib, Eduardo Queiroga, Ruslan Sadykov, and Eduardo Uchoa. 2023. “VRPSolverEasy: A Python Library for the Exact Solution of a Rich Vehicle Routing Problem.” HAL 04057985. Inria Centre at the University of Bordeaux. https://inria.hal.science/hal-04057985.
  7. Freitas, Matheus, João Marcos Pereira Silva, and Eduardo Uchoa. 2023. “A Unified Exact Approach for Clustered and Generalized Vehicle Routing Problems.” Computers & Operations Research 149: 106040. https://doi.org/https://doi.org/10.1016/j.cor.2022.106040.
  8. Liguori, Pedro Henrique, A. Ridha Mahjoub, Guillaume Marques, Ruslan Sadykov, and Eduardo Uchoa. 2023. “Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems.” Operations Research accepted. https://doi.org/10.1287/opre.2023.2458.
  9. Marques, Guillaume, Ruslan Sadykov, Jean-Christophe Deschamps, and Rémy Dupas. 2020. “An Improved Branch-Cut-and-Price Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem.” Computers & Operations Research 114: 104833. https://doi.org/10.1016/j.cor.2019.104833.
  10. Pessoa, Artur, Michael Poss, Ruslan Sadykov, and François Vanderbeck. 2021. “Branch-and-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty.” Operations Research 69 (3): 739-754. https://doi.org/10.1287/opre.2020.2035.
  11. Pessoa, Artur, Ruslan Sadykov, and Eduardo Uchoa. 2021. “Solving Bin Packing Problems Using VRPSolver Models.” Operations Research Forum 2 (2): 20. https://doi.org/10.1007/s43069-020-00047-8.
  12. Queiroga, Eduardo, Yuri Frota, Ruslan Sadykov, Anand Subramanian, Eduardo Uchoa, and Thibaut Vidal. 2020. “On the Exact Solution of Vehicle Routing Problems with Backhauls.” European Journal of Operational Research 287 (1): 76–89. https://doi.org/10.1016/j.ejor.2020.04.047.
  13. Queiroga, Eduardo, Ruslan Sadykov, and Eduardo Uchoa. 2021. “A POPMUSIC Matheuristic for the Capacitated Vehicle Routing Problem.” Computers & Operations Research 136: 105475. https://doi.org/10.1016/j.cor.2021.105475.
  14. Queiroga, Eduardo, Ruslan Sadykov, Eduardo Uchoa, and Thibaut Vidal. 2022. “10,000 Optimal CVRP Solutions for Testing Machine Learning Based Heuristics.” In AAAI-22 Workshop on Machine Learning for Operations Research (ML4OR). https://openreview.net/forum?id=yHiMXKN6nTl.
  15. Roboredo, Marcos, Ruslan Sadykov, and Eduardo Uchoa. 2023. “Solving Vehicle Routing Problems with Intermediate Stops Using VRPSolver Models.” Networks 81 (3): 399–416. https://doi.org/https://doi.org/10.1002/net.22137.

Last updated: June 6, 2023.