Dynamic Refuse Collection Strategy Based on Adjacency Relationship between Euler Cycles
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.
KeywordsEuler graph cycle graph refuse collection combinational optimum problem
Unable to display preview. Download preview PDF.
- 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
- 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.Moscato, P., Cotta, C.: A Gentle Introduction to Memetic Algorithms. In: Handbook of Metaheuristics, pp. 105–144 (2003)Google Scholar