EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 59 / No 4 (July-August 2025) RAIRO-Oper. Res., 59 4 (2025) 2121-2146 References
Open Access
Issue
RAIRO-Oper. Res.
Volume 59, Number 4, July-August 2025
Page(s) 2121 - 2146
DOI https://doi.org/10.1051/ro/2025065
Published online 14 August 2025
  • C. Archetti, D. Feillet and M.G. Speranza, Complexity of routing problems with release dates. Eur. J. Oper. Res. 247 (2015) 797–803. [Google Scholar]
  • C. Archetti, D. Feillet, A. Mor and M.G. Speranza, An iterated local search for the Traveling Salesman Problem with release dates and completion time minimization. Comput. Oper. Res. 98 (2018) 24–37. [Google Scholar]
  • C. Archetti, D. Feillet, A. Mor and M.G. Speranza, Dynamic traveling salesman problem with stochastic release dates. Eur. J. Oper. Res. 3 (2020) 832–844. [Google Scholar]
  • Y. Arda, Y. Crama, D. Kronus, T. Pironet and H.P. Van, Multi-period vehicle loading with stochastic release dates. EURO J. Transp. Logist. 3 (2014) 93–119. [Google Scholar]
  • X. Cai, L. Jiang, S. Guo, H. Huang and H. Du, TLHSA and SACA: two heuristic algorithms for two variant VRP models. J. Comb. Optim. (2022) 1–27. [Google Scholar]
  • D. Cattaruzza, N. Absi and D. Feillet, The multi-trip vehicle routing problem with time windows and Release Dates. Transp. Sci. 50 (2016) 676–693. [Google Scholar]
  • R.F. Fachini and V.A. Armentano, Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows. Optim. Lett. 14 (2020) 579–609. [Google Scholar]
  • M. Fallah-Tafti, M. Honarvar, R. Tavakkoli-Moghaddam and A. Sadegheih, Mathematical modeling of a bi-objective hub location-routing problem for rapid transit networks. RAIRO-Oper. Res. 56 (2022) 3733–3763. [Google Scholar]
  • J. Gholami, K.K.A. Ghany and H.M. Zawbaa, A novel global harmony search algorithm for solving numerical optimizations. Soft Comput. 25 (2021) 2837–2849. [Google Scholar]
  • Z.X. Guo, L.Y. Shi, L.C. Chen and Y. Liang, A Harmony search-based memetic optimization model for integrated production and transportation scheduling in MTO manufacturing. Omega 66 (2017) 327–343. [Google Scholar]
  • A.S. Hesar, S.R. Kamel and M. Houshmand, A quantum multi-objective optimization algorithm based on harmony search method. Soft Comput. 25 (2021) 9427–9439. [Google Scholar]
  • C. Kohler, J.F. Ehmke and A.M. Campbell, Flexible time window management for attended home deliveries. Omega 91 (2020) 1–22. [Google Scholar]
  • C. Lavigne, D. Inghels, W. Dullaert and D. Reginald, A memetic algorithm for solving rich waste collection problems. Eur. J. Oper. Res. 308 (2023) 581–604. [Google Scholar]
  • W.L. Li, K.P. Li, P.N.R. Kumar and Q.N. Tian, Simultaneous product and service delivery vehicle routing problem with time windows and order release dates. Appl. Math. Model. 89 (2021) 669–687. [Google Scholar]
  • C. Lin, J.Y. Xu, J.Y. Baia, D.Y. Chung and H. Liu, Artificial bee colony algorithms for the order scheduling with release dates. Soft Comput. 23 (2019) 8677–8688. [Google Scholar]
  • L. Liu, K.P. Li and Z.X. Liu, A capacitated vehicle routing problem with order available time in e-commerce industry. Eng. Optimiz. 49 (2017) 449–465. [Google Scholar]
  • D. Manerba, R. Mansini and R. Zanotti, Attended home delivery: reducing last-mile environmental impact by changing customer habits. IFAC-Papers Online 51 (2018) 55–60. [Google Scholar]
  • D. Manjarres, I. Landa-Torres, S. Gil-Lopez, J.D. Ser, M.N. Bilbao, S. Salcedo-Sanz and Z.W. Greem, A survey on applications of the harmony search algorithm. Eng. Appl. Artif. Intel. 26 (2013) 1818–1831. [Google Scholar]
  • A. Mor and M.G. Speranza, Vehicle routing problems over time: a survey. Oper. Res. 18 (2020) 129–149. [Google Scholar]
  • P. Moscato, On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech Concurrent Computation Program (1989) (report 826). [Google Scholar]
  • Y. Peng, S. Gao, D. Yu, Y.P. Xiao and Y.J. Luo, Multi-objective optimization for multimodal transportation routing problem with stochastic transportation time based on data-driven approaches. RAIRO-Oper. Res. 57 (2023) 1745–1765. [Google Scholar]
  • V. Pillac, M. Gendreau, C. Guéret and A.L. Medaglia, A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225 (2013) 1–11. [Google Scholar]
  • C. Prins, A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31 (2004) 1985–2002. [Google Scholar]
  • F. Qiu, N. Geng and H. Wang, An improved memetic algorithm for integrated production scheduling and vehicle routing decisions. Comput. Oper. Res. 152 (2023) 106127. [Google Scholar]
  • D. Reyes, A.L. Erera and M.W.P. Savelsbergh, Complexity of routing problems with release dates and deadlines. Eur. J. Oper. Res. 266 (2018) 29–34. [Google Scholar]
  • L.F. Rodrigues, M.O. Dos Santos and B. Almada-Lobo, A memetic algorithm for the multi-product production routing problem. Comput. Ind. Eng. 182 (2023) 1–19. [Google Scholar]
  • H. Schaap, M. Schiffer, M. Schneider and G. Walther, A large neighborhood search for the vehicle routing problem with multiple time windows. Transp. Sci. 56 (2022) 1369–1392. [Google Scholar]
  • B.C. Shelbourne, M. Battarra and C.N. Potts, The vehicle routing problem with release and due dates. Inf. J. Comput. 29 (2017) 705–723. [Google Scholar]
  • J.T. Soman and R.J. Patil, A scatter search method for heterogeneous fleet vehicle routing problem with release dates under lateness dependente tardiness costs. Expert Syst. Appl. 150 (2020) 1–17. [Google Scholar]
  • X.R. Sun, K.P. Li and W.L. Li, The vehicle routing problem with release dates and flexible time windows. Eng. Optim. 54 (2022) 1–17. [Google Scholar]
  • D. Ta¸s, Electric vehicle routing with flexible time windows: a column generation solution approach. Transp. Lett. 13 (2020) 97–103. [Google Scholar]
  • D. Ta¸s, O. Jabali and T.V. Woensel, A vehicle routing problem with flexible time windows. Comput. Oper. Res. 52 (2014) 39–54. [Google Scholar]
  • Y. Wu and X. Lu, Capacitated vehicle routing problem on line with unsplittable demands. J. Comb. Optim. 44 (2022) 1953–1963. [Google Scholar]
  • Y. Yu, An exact price-cut-and-enumerate method for the capacitated multi-trip vehicle routing problem with time windows. Transp. Sci. 57 (2023) 230–251. [Google Scholar]
  • H. Zhang, Q. Zhang, L. Ma, Z. Zhang and Y. Liu, A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows. Inform. Sci. 490 (2019) 166–190. [Google Scholar]
  • L. Zhen, C.L. Ma, K. Wang, L. Xiao and W. Zhang, Multi-depot multi-trip vehicle routing problem with time windows and release dates. Transp. Res. E Logist. Transp. Rev. 135 (2020) 1–21. [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.