反馈神经网络优化方法及其在作业车间调度和atm网络路由选择中的应用研究控制理论与控制工程专业论文.docxVIP

反馈神经网络优化方法及其在作业车间调度和atm网络路由选择中的应用研究控制理论与控制工程专业论文.docx

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

浙江工业大学硕士学住论文 浙江工业大学硕士学住论文 摘要 明该软件能有效求得实际JSP的优化解。 关键词:神经网络,作业车间调度,路由选择,神经计算机,混沌,模拟 退火 浙江工业大学硕士学位论文 浙江工业大学硕士学位论文 ABSTRACT THE FEEDBACK NEURAL NETWORK OPTIMIZATION Ⅳ匝THOD AND ITS APPLICATION IN JOB SHOP SCHEDULING AND ROUTING OF ATM NETWORK ABSTRACT The feedback neural network optimization algorithm iS a new and potential approach for combinatorial optimization problem.This dissertation studies the algorithm’S theory and application in job shop scheduling problem (JSP)and virtual path(VP)routing in ATM network.The main work is described as follows: 1)To the job—shop scheduling problem,all restrictions are considered, and a new computational energy function that consists of row inhibition, global inhibition,unsymmetrical inhibition and column inhibition is given. An improved Hopfield neural network(}环IN)method for JSP is presented, and it keeps the steady output of neural network as a feasible solution satisfied with resource and sequence restrictions for JS P. 21 In order to avoid HNN to be sunk into local minimum,the approach based on a stochastic neural network for JSP iS developed.It introduces the simulated annealing algorithm into the DHNN of JSR During the course of search.the change of the maximal finishing time for JSP iS considered.The algorithm for Oantt graph is proposed to find the maximal finishing time of JSP,which avoids the overlap in the graph directly drawn in terms of the cost trees.and assures that the solution is the half active scheduling.The simulation results show that the approach can keep the steady output of neural network as a global solution for JS P’but its convergence iS slow. 3、To improve the convergenee of the method based on the stochastic neural network。the discrete Hopfield neural network witIl transient chaos method(rDNN、for JSP is developed.The simulated annealing algorithm is replaced with the chaotic optimization search,and the chaos is produced by the self-inhibition in TDNN.In the chaotic search,the maximal finishing time IlI

您可能关注的文档

文档评论(0)

131****9843 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档