Implementation of Eulerian Paths based on the model of the Chinese postman: Application to the problems of garbage collection in the streets of the City of Kananga

Marie-Alice Tshiela Nkuna
{"title":"Implementation of Eulerian Paths based on the model of the Chinese postman: Application to the problems of garbage collection in the streets of the City of Kananga","authors":"Marie-Alice Tshiela Nkuna","doi":"10.37745/bjes.2013/vol11n24666","DOIUrl":null,"url":null,"abstract":"Graph theory today plays a very important role in modeling and solving many problems. The complexity of this subject is considerable, especially since we must speak at the same time of the Chinese postman and the Eulerian journey. If it remains true that the concern is the search for the path which minimizes the cost, we understand that it will be imperative for us to glean from Fleury's algorithm, without failing to lead to the possible conditions for the realization of Euler's dreams. On the city of Kananga, whose road network is more than complex in the tangle of its arteries? In this article we seek to see how we can solve the problem of garbage collection by going through each intersection once and only once, thus minimizing cost and time.","PeriodicalId":191044,"journal":{"name":"British Journal of Environmental Sciences","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"British Journal of Environmental Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37745/bjes.2013/vol11n24666","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Graph theory today plays a very important role in modeling and solving many problems. The complexity of this subject is considerable, especially since we must speak at the same time of the Chinese postman and the Eulerian journey. If it remains true that the concern is the search for the path which minimizes the cost, we understand that it will be imperative for us to glean from Fleury's algorithm, without failing to lead to the possible conditions for the realization of Euler's dreams. On the city of Kananga, whose road network is more than complex in the tangle of its arteries? In this article we seek to see how we can solve the problem of garbage collection by going through each intersection once and only once, thus minimizing cost and time.
基于中国邮差模型的欧拉路径的实现:在卡南加市街道垃圾收集问题中的应用
图论今天在建模和解决许多问题方面起着非常重要的作用。这个问题的复杂性是相当大的,特别是因为我们必须同时谈到中国邮递员和欧拉的旅程。如果我们关注的仍然是寻找成本最小的路径,我们理解,我们必须从弗勒里的算法中收集信息,而不是导致实现欧拉梦想的可能条件。在卡南加市,其道路网络在其动脉的纠缠中更加复杂?在本文中,我们试图了解如何通过一次且仅一次地遍历每个交叉点来解决垃圾收集问题,从而最小化成本和时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书