Dynamic Refuse Collection Strategy Based on Adjacency Relationship between Euler Cycles

  • Toyohide Watanabe
  • Kosuke Yamamoto
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7478)


Our objective is to reduce the risk of overwork in the refuse collection procedure while keeping efficient routes. On optimum routes in refuse collection, vehicles pass through each road segment only once. When we look upon our road network as a graph, the optimum route is Euler graph. Euler graph consists of several Euler cycles. When Euler cycles are exchanged in Euler graph, these cycles are yet Euler cycles if the exchanged cycles are adjacent. Our idea is to construct the cycle graph, which represents cycles as nodes and connective relationships between adjacent cycles as links, from Euler graph. It is guaranteed that the cycle based on links in the cycle graph does not generate the redundancy. In the computer simulation, we conclude that our method is effectively applicable to many kinds of road networks.


Euler graph cycle graph refuse collection combinational optimum problem 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Golden, B.L., Wong, R.T.: Capaciated Arc Routing Problems. Networks 11, 305–315 (1981)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Golden, B.L., Dearmon, J.S., Baker, E.K.: Computational Experiments with Algorithms for a Class of Routing Problems. Computers and Operations Research 10(1), 47–59 (1983)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Ulusoy, G.: The Fleet Size and Mix Problem for Capacitated Arc Routing. European Journal of Operational Research 22(3), 329–337 (1985)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Lacomme, P., Prins, C., Ramdane-Chérif, W.: A Genetic Algorithm for the Capacitated Arc Routing Problem and Its Extensions. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol. 2037, pp. 473–478. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Hertz, A., Laporte, G., Mittaz, M.: A Tabu Search Heuristic for the Capacitated Arc Routing Problem. Operations Research 48(1), 129–135 (2000)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Ralphs, T., Kopman, L., Pulleyblank, W., Trotter, L.: On the Capacitated Vehicle Routing Problem. Mathematical Programming 94(2/3), 343–359 (2003)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Longo, H., de Aragao, M.P., Uchoac, E.: Solving Capacitated Arc Routing Problems Using a Transformation to the CVRP. Computers and Operations Research 33, 1823–1837 (2006)zbMATHCrossRefGoogle Scholar
  8. 8.
    Fleury, G., Lacomme, P., Prins, C.: Evolutionary Algorithms for Stochastic Arc Routing Problems. In: Raidl, G.R., Cagnoni, S., Branke, J., Corne, D.W., Drechsler, R., Jin, Y., Johnson, C.G., Machado, P., Marchiori, E., Rothlauf, F., Smith, G.D., Squillero, G. (eds.) EvoWorkshops 2004. LNCS, vol. 3005, pp. 501–512. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  9. 9.
    Moscato, P., Cotta, C.: A Gentle Introduction to Memetic Algorithms. In: Handbook of Metaheuristics, pp. 105–144 (2003)Google Scholar
  10. 10.
    Fleury, G., Lacomme, P., Prins, C., Ramdane Cherif, W.: Improving Robustness of Solutions to Arc Routing Problem. Journal of the Operational Research Society 56, 526–538 (2006)CrossRefGoogle Scholar
  11. 11.
    Mourao, M.C., Amado, L.: Heuristic Method for a Mixed Capacitated Arc Routing. European Journal of Operational Research 160(1), 139–153 (2005)zbMATHCrossRefGoogle Scholar
  12. 12.
    Mourao, M.C., Almeida, M.T.: Lower-bounding and Heuristic Methods for a Refuse Collection Vehicle Routing Problem. European Journal of Operational Research 121(2), 420–434 (2000)zbMATHCrossRefGoogle Scholar
  13. 13.
    Graham, R.L., Hell, P.: On the History of the Minimum Spanning Tree Problem. IEEE Ann. Hist. Comput. 7(1), 43–57 (1985)MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Toyohide Watanabe
    • 1
  • Kosuke Yamamoto
    • 1
  1. 1.Department of Systems and Social Informatics, Graduate School of Information ScienceNagoya UniversityChikusa-kuJapan

Personalised recommendations