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

浙江工业大学硕士学位论文 浙江工业大学硕士学位论文 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 塑兰三兰查兰塑主兰堡垒墨 塑兰三兰查兰塑主兰堡垒墨