EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 59 / No 5 (September-October 2025) RAIRO-Oper. Res., 59 5 (2025) 3131-3152 References
Open Access
Issue
RAIRO-Oper. Res.
Volume 59, Number 5, September-October 2025
Page(s) 3131 - 3152
DOI https://doi.org/10.1051/ro/2025004
Published online 24 October 2025
  • M. Alinaghian and N. Shokouhi, Multi-depot multi-compartment vehicle routing problem, solved by a hybrid adaptive large neighborhood search. Omega 76 (2018) 85–99. [CrossRef] [Google Scholar]
  • P. Avella, M. Boccia and A. Sforza, Solving a fuel delivery problem by heuristic and exact approaches. Eur. J. Oper. Res. 152 (2004) 170–179. [Google Scholar]
  • F.F. Boctor, J. Renaud and F. Cornillier, Trip packing in petrol stations replenishment. Omega 39 (2011) 86–98. [Google Scholar]
  • O. Br¨aysy, A reactive variable neighborhood search for the vehicle-routing problem with time windows. INFORMS J. Comput. 15 (2003) 347–368. [Google Scholar]
  • E.D. Chajakis and M. Guignard, Scheduling deliveries in vehicles with multiple compartments. J. Global Optim. 26 (2003) 43–78. [Google Scholar]
  • B. Chen, R. Qu, R. Bai and W. Laesanklang, A variable neighborhood search algorithm with reinforcement learning for a real-life periodic vehicle routing problem with time windows and open routes. RAIRO-Oper. Res. 54 (2020) 1467–1494. [Google Scholar]
  • J. Chen, B. Dan and J. Shi, A variable neighborhood search approach for the multi-compartment vehicle routing problem with time windows considering carbon emission. J. Clean. Prod. 277 (2020) 123932. [Google Scholar]
  • L.C. Coelho and G. Laporte, Classification, models and exact algorithms for multi-compartment delivery problems. Eur. J. Oper. Res. 242 (2015) 854–864. [Google Scholar]
  • F. Cornillier, F.F. Boctor, G. Laporte and J. Renaud, An exact algorithm for the petrol station replenishment problem. J. Oper. Res. Soc. 59 (2008) 607–615. [Google Scholar]
  • F. Cornillier, F.F. Boctor, G. Laporte and J. Renaud, A heuristic for the multi-period petrol station replenishment problem. Eur. J. Oper. Res. 191 (2008) 295–305. [Google Scholar]
  • F. Cornillier, G. Laporte, F.F. Boctor and J. Renaud, The petrol station replenishment problem with time windows. Comput. Oper. Res. 36 (2009) 919–935. [Google Scholar]
  • F. Cornillier, F. Boctor and J. Renaud, Heuristics for the multi-depot petrol station replenishment problem with time windows. Eur. J. Oper. Res. 220 (2012) 361–369. [Google Scholar]
  • E. Demir, T. Bekta¸s and G. Laporte, An adaptive large neighborhood search heuristic for the pollution-routing problem. Eur. J. Oper. Res. 223 (2012) 346–359. [CrossRef] [Google Scholar]
  • A. El Fallahi, C. Prins and R.W. Calvo, A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Comput. Oper. Res. 35 (2008) 1725–1741. [Google Scholar]
  • R. Eshtehadi, E. Demir and Y. Huang, Solving the vehicle routing problem with multi-compartment vehicles for city logistics. Comput. Oper. Res. 115 (2020) 104859. [Google Scholar]
  • P. Hansen, N. Mladenovic and J.A. Moreno Perez, Variable neighborhood seach. Eur. J. Oper. Res. 191 (2008) 593–770. [Google Scholar]
  • K. Heßler, Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes. Eur. J. Oper. Res. 294 (2021) 188–205. [Google Scholar]
  • V.C. Hemmelmayr, K.F. Doerner and R.F. Hartl, A variable neighborhood search heuristic for periodic routing problems. Eur. J. Oper. Res. 195 (2009) 791–802. [Google Scholar]
  • T. Henke, M.G. Speranza and G. W¨ascher, The multi-compartment vehicle routing problem with flexible compartment sizes. Eur. J. Oper. Res. 246 (2015) 730–743. [Google Scholar]
  • E. Jabir, V.V. Panicker and R. Sridharan, Design and development of a hybrid ant colony-variable neighbourhood search algorithm for a multi-depot green vehicle routing problem. Transp. Res. Part D: Transp. Environ. 57 (2017) 422–457. [Google Scholar]
  • M. Keskin and B. Çatay, Partial recharge strategies for the electric vehicle routing problem with time windows. Transp. Res. Part C: Emerging Technol. 65 (2016) 111–127. [Google Scholar]
  • N.A. Kyriakakis, M. Marinaki and Y. Marinakis, A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 134 (2021) 105397. [Google Scholar]
  • R. Lahyani, L.C. Coelho, M. Khemakhem, G. Laporte and F. Semet, A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia. Omega 51 (2015) 1–10. [Google Scholar]
  • Z. Liu and X. Zuo, Inventory routing problem with split delivery and variable time windows for customers with small capacity and large sales. IEEE Trans. Intell. Transp. Syst. 25 (2024) 10375–10388. [Google Scholar]
  • Z. Liu, Y. Li, J. Xu and D. Bai, Multi-compartment electric vehicle routing problem for perishable products. Int. J. Crowd Sci. 8 (2024) 38–48. [Google Scholar]
  • Z. Liu, L. Sun, X. Zuo and H. Li, Heterogeneous electric vehicle routing problem with multiple compartments and multiple trips for the collection of classified waste. Int. J. Crowd Sci. 8 (2024) 130–139. [Google Scholar]
  • H. Luo, M. Dridi and O. Grunder, A branch-and-price algorithm for a routing and scheduling problem from economic and environmental perspectives. RAIRO-Oper. Res. 56 (2022) 3267–3292. [Google Scholar]
  • J.E. Mendoza, B. Castanier, C. Guéret, A.L. Medaglia and N. Velasco, Constructive heuristics for the multicompartment vehicle routing problem with stochastic demands. Transp. Sci. 45 (2011) 346–363. [Google Scholar]
  • N. Mladenović and P. Hansen, Variable neighborhood search. Comput. Oper. Res. 24 (1997) 1097–1100. [Google Scholar]
  • M. Ostermeier and A. Hübner, Vehicle selection for a multi-compartment vehicle routing problem. Eur. J. Oper. Res. 269 (2018) 682–694. [Google Scholar]
  • M. Ostermeier, T. Henke, A. Hübner and G. W¨ascher, Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions. Eur. J. Oper. Res. 292 (2021) 799–817. [Google Scholar]
  • D. Popović, M. Vidović and G. Radivojević, Variable neighborhood search heuristic for the inventory routing problem in fuel delivery. Expert Syst. App. 39 (2012) 13390–13398. [Google Scholar]
  • M. Rabbani, H. Farrokhi-Asl and H. Rafiei, A hybrid genetic algorithm for waste collection problem by heterogeneous fleet of vehicles with multiple separated compartments. J. Intell. Fuzzy Syst. 30 (2016) 1817–1830. [Google Scholar]
  • M. Reed, A. Yiannakou and R. Evering, An ant colony algorithm for the multi-compartment vehicle routing problem. Appl. Soft Comput. 15 (2014) 169–176. [Google Scholar]
  • D. Rezgui, J.C. Siala, W. Aggoune-Mtalaa and H. Bouziri, Application of a variable neighborhood search algorithm to a fleet size and mix vehicle routing problem with electric modular vehicles. Comput. Ind. Eng. 130 (2019) 537–550. [Google Scholar]
  • S. Ropke and D. Pisinger, An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40 (2006) 455–472. [CrossRef] [Google Scholar]
  • M.E.H. Sadati and B. Çatay, A hybrid variable neighborhood search approach for the multi-depot green vehicle routing problem. Transp. Res. Part E: Logistics Transp. Rev. 149 (2021) 102293. [Google Scholar]
  • P. Shaw, Using constraint programming and local search methods to solve vehicle routing problems, in International Conference on Principles and Practice of Constraint Programming. Springer (1998) 417–431. [Google Scholar]
  • M.M. Solomon, Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35 (1987) 254–265. [Google Scholar]
  • L. Wang, J. Kinable and T. Van Woensel, The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips. Comput. Oper. Res. 118 (2020) 104904. [Google Scholar]
  • X.-T. Wei, Q. Liao, H.-R. Zhang, Y.-T. Liang, B.-H. Wang, N. Xu and M. Yuan, MILP formulations for highway petrol station replenishment in initiative distribution mode. Petroleum Sci. 18 (2021) 994–1010. [Google Scholar]
  • H. Yahyaoui, I. Kaabachi, S. Krichen and A. Dekdouk, Two metaheuristic approaches for solving the multicompartment vehicle routing problem. Oper. Res. 20 (2020) 2085–2108. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.