垃圾运输问题的模型及其求解（Model of garbage transport problem and its solution）.docVIP

下载本文档

6
0
约1.27万字
约 14页
2017-07-25 发布于河南
举报
版权申诉

垃圾运输问题的模型及其求解（Model of garbage transport problem and its solution）.doc

1、本文档共14页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

垃圾运输问题的模型及其求解（Model of garbage transport problem and its solution）

垃圾运输问题的模型及其求解（Model of garbage transport problem and its solution） Liu Yuxing, Zhong Jian (A. School of mathematics and computer science, GanNan Normal University, B. Network Center, Jiangxi, Ganzhou, 341000) Abstract: through the establishment and solution of the model of waste transportation, this paper summarizes the general solution to this problem, that is to say, to construct the appropriate problem according to the actual problem The directed or undirected weighted graph is used to transform the problem into mecqs TSP problem. By solving the TSP problem, the original problem is satisfactorily answered shut 1 relevant concepts Define l [I1 set G= ((E)) is connected undirected graph, (1) a path of Hamilton or diurnal path called G for each vertex of G; (2) after each vertex G is a circle, called a G, or Hamiltonian circle; (3) days circle graph is called Hamiltonian graph or chart. Definition 2 [I1 sets D = ((A)) is a connected directed graph, (1) a loop that passes exactly once at every vertex of D is called the generating ring of D; (2) with generation circle graph is called Hamiltonian graph or chart. Define 3. Let G be a complete (directed or undirected) weighted graph, and the problem of finding the minimum right closure in C is called the TSP problem (i.e., Traveling Salesman Problem). If this is the closed circle, then the best day for closed circle. It is easy to prove that the TSP problem can be translated into the problem of finding the best H ring when it satisfies the condition t } () +t}, which can be constructed by constructing one A complete graph is implemented 2 waste transportation problems Example l there are a number of garbage collection points in a city. Every day, from the garbage treatment plant (No. thirty-seventh node), the rubbish is carried back Fig. 1 road map of freight car The car line has been set down for lO (as shown in Figure 1) To save money, the van always goes away from each line The garbage collection point at the plant b