2012 | OriginalPaper | Buchkapitel
Dynamic Refuse Collection Strategy Based on Adjacency Relationship between Euler Cycles
verfasst von : Toyohide Watanabe, Kosuke Yamamoto
Erschienen in: Geographic Information Science
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.