EDP Sciences logo
Web of Conferences logo
Search
Menu
All issues Volume 211 (2020) E3S Web Conf., 211 (2020) 03021 References
Open Access
Issue
E3S Web Conf.
Volume 211, 2020
The 1st JESSD Symposium: International Symposium of Earth, Energy, Environmental Science and Sustainable Development 2020
Article Number 03021
Number of page(s) 11
Section Resource Sustainability
DOI https://doi.org/10.1051/e3sconf/202021103021
Published online 25 November 2020
  1. B.L. Golden, R.T. Wong, Capacitated arc routing problems, Netw. 11, 3, 305-315 (1981) https://doi.org/10.1002/net.3230110308 [CrossRef] [Google Scholar]
  2. A. Hertz, M. Mittaz, A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem, Transp. Sci. 35, 4 (2001) https://doi.org/10.1287/trsc.35.4.425.10431 [CrossRef] [Google Scholar]
  3. G. Fleury, P. Lacomme, C. Prins, Evolutionary algorithms for stochastic arc routing problems, in Ap. of Evo. Comp, 501-512 (2004) [Google Scholar]
  4. G. Laporte, R. Musmanno, F. Vocaturo, An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands, Transp. Sci. 44, 1, 125-135 (2010) https://www.jstor.org/stable/25769483 [CrossRef] [Google Scholar]
  5. S.G. Martin, A.A. Juan, D. Riera, M.G. Elizondo, J.J. Ramos, A simheuristic algorithm for solving the arc routing problem with stochastic demands, J. of Sim. 12, 1, 53-66 (2018) https://doi.org/10.1057/jos.2016.11 [CrossRef] [Google Scholar]
  6. A Amberg, W Domschke, S Voß, Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees, in Euro. J. of Oper, 124, 2, 360-376 (2000), https://doi.org/10.1016/S0377-2217(99)00170-8 [CrossRef] [Google Scholar]
  7. G. Ghiani, G. Improta, G. Laporte, The capacitated arc routing problem with intermediate facilities, Net. 37, 3, 1134-143 (2001) https://doi.org/10.1002/net.3 [Google Scholar]
  8. A.D. Pia, C. Filippi, A variable neighborhood descent algorithm for a real waste collection problem with mobile depots, Inter. Trans. in Oper. Res. 13, 2, 125-141 (2006) https://doi.org/10.1111/j.1475-3995.2006.0053 [CrossRef] [Google Scholar]
  9. A. Amaya, A. Langevin, M. Trépanier, The capacitated arc routing problem with refill points, Oper. Res. Lett. 35, 1, 45-53 (2007) https://doi.org/10.1016/j.orl.2005.12.009 [CrossRef] [Google Scholar]
  10. F.L. Usberti, PM França, ALM França, The open capacitated arc routing problem, in Comp. &Oper. Res, 38, 11, 1543-1555 (2011) https://doi.org/10.1016/j.cor.2011.01.012 [CrossRef] [Google Scholar]
  11. P.A. Mullaseril, Capacitated rural postman problem with time windows and split delivery (1997) [Google Scholar]
  12. B. Kim, S. Kim, and S. Sahoo, Waste collection vehicle routing problem with time windows, Comp. Oper. Res, 33, 12, 3624-3642 (2006) https://doi.org/10.1016/j.cor.2005.02.045 [CrossRef] [Google Scholar]
  13. C. Ciancio, D. Laganá, F. Vocaturo, Branch-price-and-cut for the Mixed Capacitated General Routing Problem with Time Windows, Euro. J. of Oper. Res. 267, 1, 187-199 (2018) https://doi.org/10.1016/j.ejor.2017.11.039 [CrossRef] [Google Scholar]
  14. M. Tagmouti, M. Gendreau, J.Y. Potvin, Arc routing problems with time-dependent service costs, Euro. J. of Oper. Res, 181, 1, 30-3916 (2007) https://doi.org/10.1016/j.ejor.2006.06.02 [CrossRef] [Google Scholar]
  15. M. Tagmouti, Étude d’un problème de tournées de véhicules sur les arcs avec contraintes de capacité et coûts de service dépendants du temps (2008) http://hdl.handle.net/1866/6446 [Google Scholar]
  16. M. Tagmouti, M. Gendreau, J.Y. Potvin, A variable neighborhood descent heuristic for arc routing problems with time-dependent service costs, Comp. & Ind. Eng, 59, 4, 954-963 (2010) https://doi.org/10.1016/j.cie.2010.09.006 [CrossRef] [Google Scholar]
  17. M. Tagmouti, M. Gendreau, J.Y. Potvin, A dynamic capacitated arc routing problem with time-dependent service costs, Transp. Res. Part C: Emerg. Tech. 19, 1, 20-28 (2011) https://doi.org/10.1016/j.trc.2010.02.003 [CrossRef] [Google Scholar]
  18. P. Lacomme, C. Prins, W.R. Cherif, Evolutionary algorithms for multiperiod arc routing problems, 9 th Int. Conf. on Inf. Proc. and Manag. of Uncertainty in Knowledge-Based Systems (2002) [Google Scholar]
  19. Hirabayashi, Nishida, Saruwatari, Tour construction algorithm for the capacitated arc routing problem, (1992) [Google Scholar]
  20. R. Baldacci, V. Maniezzo, Exact methods based on node routing formulations for undirected arc routing problems, Netw. 47, 1, 52-60 (2006) https://doi.org/10.1002/net.20091 [CrossRef] [Google Scholar]
  21. H. Longo, M.P. Aragão, E. Uchoa, Solving capacitated arc routing problems using a transformation to the CVRP, Comp. & Oper. Res, 33, 6, 1823-1837 (2006) https://doi.org/10.1016/j.cor.2004.11.020 [CrossRef] [Google Scholar]
  22. E. Bartolini, J.F. Cordeau, G. Laporte, Improved lower bounds and exact algorithm for the capacitated arc routing problem, Math. Prog, 137, 1–2, 409–452 (2013) https://doi.org/10.1007/s10107-011-0497-4 [CrossRef] [Google Scholar]
  23. E. Bartolini, J.F. Cordeau, G. Laporte, An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand, Oper. Res. 61, 2, iii-529 (2013) https://doi.org/10.1287/opre.1120.1154 [CrossRef] [Google Scholar]
  24. R. Martinelli, M. Poggi, A. Subramanian, Improved bounds for large scale capacitated arc routing problem, Comp. & Oper. Res, 40, 8, 2145-2160 (2013) https://doi.org/10.1016/j.cor.2013.02.013 [CrossRef] [Google Scholar]
  25. Hertz, A., G. Laporte, M. Mittaz, A tabu search heuristic for the capacitated arc routing problem, Oper. Res, 48, 1, 1-188 (2000) https://doi.org/10.1287/opre.48.1.129.12455 [CrossRef] [MathSciNet] [Google Scholar]
  26. J. Brandão, R. Eglese, A deterministic tabu search algorithm for the capacitated arc routing problem, Comp. & Oper. Res, 35, 4, 1112-1126 (2008), https://doi.org/10.1016/j.cor.2006.07.007 [CrossRef] [Google Scholar]
  27. E.B. Tirkolaee, M. Alinaghian, M. Bakhshi Sasi, M.M. Seyyed Esfahani, Solving a robust capacitated arc routing problem using a hybrid simulated annealing algorithm: a waste collection application, J. of Ind. Eng. and Manag. St. 3, 1, 61-76 (2016) [Google Scholar]
  28. E.B. Tirkolaee, I. Mahdavi, M.M.S Esfahani, A Robust Periodic Capacitated Arc Routing Problem For Urban Waste Collection Considering Drivers And Crew’s Working Time, Wast. Man. 76, 138-146 (2018) https://doi.org/10.1016/j.wasman.2018.03.015 [CrossRef] [Google Scholar]
  29. E.B. Tirkolaee, P. Abbasian, M. Soltani, S.A Ghaffarian, Developing an applied algorithm for multi-trip vehicle routing problem with time windows, urban waste collection: A case study, J. Sust. Circ. Eco. 37, 14–13 (2019) https://doi.org/10.1177/0734242X18807001 [Google Scholar]
  30. P. Lacomme, C. Prins, W. Ramdane-Chérif, A Genetic Algorithm for the Capacitated Arc Routing Problem and Its Extensions, Boers E.J.W. (eds) Applications of Evolutionary Computing, EvoWork. 2037 (2001) https://doi.org/10.1007/3-540-45365-2_49 [Google Scholar]
  31. Wahiba Ramdane-Cherif, Problèmes d’optimisation en tournées sur arcs’’ (2002) [Google Scholar]
  32. R.K. Arakaki, F.L. Usberti, Hybrid genetic algorithm for the open capacitated arc routing problem, Comp. & Oper. Res, 90, 221-231 (2018) https://doi.org/10.1016/j.cor.2017.09.020 [CrossRef] [Google Scholar]
  33. P. Lacomme, C. Prins, A. Tanguy, Optimisation par colonies de fourmis pour les tournées sur arcs (2003). [Google Scholar]
  34. A. Kansou, A. Yassine, Ant Colony System for the Periodic Capacitated Arc Routing Problem, Inter.l Net. Opt. (2009) [Google Scholar]
  35. L. Santos, J.C. Rodrigues, J.R. Current, An improved ant colony optimization based algorithm for the capacitated arc routing problem, Transp. Res. P B: Meth. 44, 2, 246-266 (2010) https://doi.org/10.1016/j.trb.2009.07.004 [CrossRef] [Google Scholar]
  36. Y. Chen, P. Rohlfshagen, L. Xing and X. Yao, A Hybrid Ant Colony Optimization Algorithm for the Extended Capacitated Arc Routing Problem, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 41, 4, 1110-1123, (2011), https://doi:10.1109/TSMCB.2011.2107899 [CrossRef] [Google Scholar]
  37. J. Boukachour, B. Dkhissi, AEH Alaoui, T. Lamoudan, Un algorithme hybride pour la résolution du problème de collecte des déchets (2012) [Google Scholar]
  38. EB Tirkolaee, M Alinaghian, AAR Hosseinabadi, M B Sasi, A K Sangaiah, An improved ant colony optimization for the multi-trip Capacitated Arc Routing Problem, Comp. & Ele. Eng, 77, 457-470 (2019) https://doi.org/10.1016/j.compeleceng.2018.01.040 [CrossRef] [Google Scholar]
  39. P. Lacomme, C. Prins, W.R. Cherif, Evolutionary algorithms for periodic arc routing problems, Euro. J. of Oper. Res, 165, 2, 535-553 (2005) https://doi.org/10.1016/j.ejor.2004.04.021 [CrossRef] [Google Scholar]
  40. F. Chu, N. Labadi, C. Prins, Lower bounds for the Periodic Capacitated Arc Routing Problem (2003) [Google Scholar]
  41. F. Chu, N. Labadi, C. Prins, Heuristics for the periodic capacitated arc routing problem, J. Intell. Manuf, 16 2, 243–251 (2005). https://doi.org/10.1007/s10845-004-5892-8 [CrossRef] [Google Scholar]
  42. F. Chu, N. Labadi, C. Prins, A Scatter Search for the Periodic Capacitated Arc Routing Problem, Euro. J. of Oper. Res, 169, 2, 586-605 (2006). https://doi.org/10.1016/j.ejor.2004.08.017 [CrossRef] [Google Scholar]
  43. Y. Mei, K. Tang, X. Yao, A Memetic Algorithm for Periodic Capacitated Arc Routing Problem, IEEE Transactions on Syst. Man. Cyb. 41, 6, 1654-1667 (2011), https://doi:10.1109/TSMCB.2011.2158307. [CrossRef] [Google Scholar]
  44. Y. Zhang, Y. Mei, k. Tang, K. Jiang, Memetic algorithm with route decomposing for periodic capacitated arc routing problem, Ap. Soft Comp. 52, 1130-1142 (2017). https://doi.org/10.1016/j.asoc.2016.09.017 [CrossRef] [Google Scholar]
  45. Y. Chen, J.K. Hao, Two phased hybrid local search for the periodic capacitated arc routing problem, Euro. J. of Oper. Res, 264, 1, 55-65 (2018) https://doi.org/10.1016/j.ejor.2017.06.025 [CrossRef] [Google Scholar]
  46. E.B. Tirkolaee, A. Goli, M. Pahlevan, R.M. Kordestanizadeh, A robust bi-objective multi-trip periodic capacitated arc routing problem for urban waste, Wast. Manag. & Res, 37, 11, 1089-1101 (2019) https://doi.org/10.1177/0734242X19865340 [CrossRef] [Google Scholar]
  47. B. Kanso, Hybrid Ant Colony Algorithm for the Multi-depot Periodic Open Capacitated Arc Routing Problem, Inter. J. of Arti. Intel. & Ap, 11 DOI:10.5121/ijaia.2020.11105 [Google Scholar]
  48. T. Stutzel, H.H. Hoose, Gener Comput Syst, 16, 8, 889-914 (2000) [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.