Open Access
RAIRO-Oper. Res.
Volume 56, Number 5, September-October 2022
Page(s) 3267 - 3292
Published online 14 September 2022
  • T. Bektaş and G. Laporte, The pollution-routing problem. Transp. Res. Part B: Methodol. 45 (2011) 1232–1250. [CrossRef] [Google Scholar]
  • L. Cai, W. Lv, L. Xiao and Z. Xu, Total carbon emissions minimization in connected and automated vehicle routing problem with speed variables. Expert Syst. App. 165 (2021) 113910. [CrossRef] [Google Scholar]
  • C.A. Cruz, P. Munari and R. Morabito, A branch-and-price method for the vehicle allocation problem. Comput. Ind. Eng. 149 (2020) 106745. [CrossRef] [Google Scholar]
  • S. Dabia, S. Ropke, T.V. Woensel and T. De Kok, Branch and price for the time-dependent vehicle routing problem with time windows. Transp. Sci. 47 (2013) 380–396. [CrossRef] [Google Scholar]
  • S. Dabia, E. Demir and T.V. Woensel, An exact approach for a variant of the pollution-routing problem. Transp. Sci. 51 (2017) 607–628. [CrossRef] [Google Scholar]
  • E. Demir, T. Bektaş 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]
  • G. Desaulniers, J. Desrosiers and M.M. Solomon, Column Generation. Vol. 5. Springer Science & Business Media (2006). [Google Scholar]
  • S. Erdoğan and E. Miller-Hooks, A green vehicle routing problem. Transp. Res. Part E: Logistics Transp. Rev. 48 (2012) 100–114. [CrossRef] [Google Scholar]
  • A.M. Fathollahi-Fard, M. Hajiaghaei-Keshteli and R. Tavakkoli-Moghaddam, A bi-objective green home health care routing problem. J. Cleaner Prod. 200 (2018) 423–443. [CrossRef] [Google Scholar]
  • A.M. Fathollahi-Fard, K. Govindan, M. Hajiaghaei-Keshteli and A. Ahmadi, A green home health care supply chain: new modified simulated annealing algorithms. J. Cleaner Prod. 240 (2019) 118200. [CrossRef] [Google Scholar]
  • D. Feillet, A tutorial on column generation and branch-and-price for vehicle routing problems. 4or 8 (2010) 407–424. [CrossRef] [MathSciNet] [Google Scholar]
  • M.W. Friske, L.S. Buriol and E. Camponogara, A branch-and-price algorithm for a compressor scheduling problem. Comput. Ind. Eng. 116 (2018) 72–81. [CrossRef] [Google Scholar]
  • M. Gendreau, G. Ghiani and E. Guerriero, Time-dependent routing problems: a review. Comput. Oper. Res. 64 (2015) 189–197. [CrossRef] [MathSciNet] [Google Scholar]
  • A. Gharaei and F. Jolai, A branch and price approach to the two-agent integrated production and distribution scheduling. Comput. Ind. Eng. 136 (2019) 504–515. [CrossRef] [Google Scholar]
  • J. Hickman, D. Hassel, R. Joumard, Z. Samaras and S. Sorenson, Methodology for calculating transport emissions and energy consumption (1999). [Google Scholar]
  • O. Jabali, T. Van Woensel and A.G. De Kok, Analysis of travel times and CO2 emissions in time-dependent vehicle routing. Prod. Oper. Manage. 21 (2012) 1060–1074. [CrossRef] [Google Scholar]
  • J. Kirkinen, T. Palosuo, K. Holmgren and I. Savolainen, Greenhouse impact due to the use of combustible fuels: life cycle viewpoint and relative radiative forcing commitment. Environ. Manage. 42 (2008) 458. [CrossRef] [PubMed] [Google Scholar]
  • Y.-J. Kwon, Y.-J. Choi and D.-H. Lee, Heterogeneous fixed fleet vehicle routing considering carbon emission. Transp. Res. Part D: Transp. Environ. 23 (2013) 81–89. [CrossRef] [Google Scholar]
  • C. Lin, K.L. Choy, G.T.S. Ho, S.H. Chung and H.Y. Lam, Survey of green vehicle routing problem: past and future trends. Expert Syst. App. 41 (2014) 1118–1138. [Google Scholar]
  • R. Liu and Z. Jiang, A constraint relaxation-based algorithm for the load-dependent vehicle routing problem with time windows. Flexible Serv. Manuf. J. 31 (2019) 331–353. [CrossRef] [Google Scholar]
  • Z. Luo, H. Qin and A. Lim, Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints. Eur. J. Oper. Res. 234 (2014) 49–60. [CrossRef] [Google Scholar]
  • H. Luo, M. Dridi and O. Grunder, An ACO-based heuristic approach for a route and speed optimization problem in home health care with synchronized visits and carbon emissions. Soft Comput. 25 (2021) 14673–14696. [CrossRef] [Google Scholar]
  • M.A. Moktadir, S.M. Ali, R. Rajesh and S.K. Paul, Modeling the interrelationships among barriers to sustainable supply chain management in leather industry. J. Cleaner Prod. 181 (2018) 631–651. [CrossRef] [Google Scholar]
  • J. Qian and R. Eglese, Finding least fuel emission paths in a network with time-varying speeds. Networks 63 (2014) 96–106. [CrossRef] [MathSciNet] [Google Scholar]
  • J. Qian and R. Eglese, Fuel emissions optimization in vehicle routing problems with time-varying speeds. Eur. J. Oper. Res. 248 (2016) 840–848. [CrossRef] [Google Scholar]
  • M. Reihaneh and A. Ghoniem, A branch-and-price algorithm for a vehicle routing with demand allocation problem. Eur. J. Oper. Res. 272 (2) 2019 523–538. [CrossRef] [Google Scholar]
  • G. Righini and M. Salani, Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optim. 3 (2006) 255–273. [CrossRef] [MathSciNet] [Google Scholar]
  • Y. Shi, T. Boudouh and O. Grunder, A hybrid genetic algorithm for a home health care routing problem with time window and fuzzy demand. Expert Syst. App. 72 (2017) 160–176. [CrossRef] [Google Scholar]
  • Y. Shi, T. Boudouh and O. Grunder, A robust optimization for a home health care routing and scheduling problem with consideration of uncertain travel and service times. Transp. Res. Part E: Logistics Transp. Rev. 128 (2019) 52–95. [CrossRef] [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]
  • N. Tajik, R. Tavakkoli-Moghaddam, B. Vahdani and S.M. Mousavi, A robust optimization approach for pollution routing problem with pickup and delivery under uncertainty. J. Manuf. Syst. 33 (2014) 277–286. [CrossRef] [Google Scholar]
  • B.E. Teoh, S.G. Ponnambalam and N. Subramanian, Data driven safe vehicle routing analytics: a differential evolution algorithm to reduce CO2 emissions and hazardous risks. Ann. Oper. Res. 270 (2018) 515–538. [CrossRef] [MathSciNet] [Google Scholar]
  • M. Wang, L. Miao and C. Zhang, A branch-and-price algorithm for a green location routing problem with multi-type charging infrastructure. Transp. Res. Part E: Logistics Transp. Rev. 156 (2021) 102529. [CrossRef] [Google Scholar]
  • Y. Yu, S. Wang, J. Wang and M. Huang, A branch-and-price algorithm for the heterogeneous fleet green vehicle routing problem with time windows. Transp. Res. Part B: Methodol. 122 (2019) 511–527. [CrossRef] [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.