Pipe-routing for ship is formulated as searching for the near-optimal pipe paths while meeting certain objectives in an environment scattered with obstacles. Due to the complex construction in layout space, the great ...Pipe-routing for ship is formulated as searching for the near-optimal pipe paths while meeting certain objectives in an environment scattered with obstacles. Due to the complex construction in layout space, the great number of pipelines, numerous and diverse design constraints and large amount of obstacles, finding the optimum route of ship pipes is a complicated and time-consuming process. A modified NSGA-II algorithm based approach is proposed to find the near-optimal solution to solve the problem. By simplified equipment models, the layout space is firstly divided into three dimensional （3D） grids to build its mathematical model. In the modified NSGA-II algorithm, the concept of auxiliary point is introduced to improve the search range of maze algorithm （MA） as well as to guarantee the diversity of chromosomes in initial population. Then the fix-length coding mechanism is proposed, Fuzzy set theory is also adopted to select the optimal solution in Pareto solutions. Finally, the effectiveness and efficiency of the proposed approach is demonstrated by the contrast test and simulation. The merit of the proposed algorithm lies in that it can provide more appropriate solutions for the designers while subject certain constrains.展开更多
This paper introduces Twist-routing, a new routing algorithm for faulty on-chip networks, which improves Maze-routing, a face-routing based algorithm which uses deflections in routing, and archives full fault coverage...This paper introduces Twist-routing, a new routing algorithm for faulty on-chip networks, which improves Maze-routing, a face-routing based algorithm which uses deflections in routing, and archives full fault coverage and fast packet delivery. To build Twist-routing algorithm, we use bounding circles, which borrows the idea from GOAFR+ routing algorithm for ad-hoc wireless networks. Unlike Maze-routing, whose path length is unbounded even when the optimal path length is fixed, in Twist-routing, the path length is bounded by the cube of the optimal path length. Our evaluations show that Twist-routing algorithm delivers packets up to 35% faster than Maze-routing with a uniform traffic and Erdos-Rényi failure model, when the failure rate and the injection rate vary.展开更多
Based on a ripped-up and rerouted methodology,a multilayer area detailed router is presented by using simulated evolution technique.A modified maze algorithm is also performed for the single net.
基金Supported by National Nature Science Foundation of China(Grant No:51275340)
文摘Pipe-routing for ship is formulated as searching for the near-optimal pipe paths while meeting certain objectives in an environment scattered with obstacles. Due to the complex construction in layout space, the great number of pipelines, numerous and diverse design constraints and large amount of obstacles, finding the optimum route of ship pipes is a complicated and time-consuming process. A modified NSGA-II algorithm based approach is proposed to find the near-optimal solution to solve the problem. By simplified equipment models, the layout space is firstly divided into three dimensional （3D） grids to build its mathematical model. In the modified NSGA-II algorithm, the concept of auxiliary point is introduced to improve the search range of maze algorithm （MA） as well as to guarantee the diversity of chromosomes in initial population. Then the fix-length coding mechanism is proposed, Fuzzy set theory is also adopted to select the optimal solution in Pareto solutions. Finally, the effectiveness and efficiency of the proposed approach is demonstrated by the contrast test and simulation. The merit of the proposed algorithm lies in that it can provide more appropriate solutions for the designers while subject certain constrains.
文摘This paper introduces Twist-routing, a new routing algorithm for faulty on-chip networks, which improves Maze-routing, a face-routing based algorithm which uses deflections in routing, and archives full fault coverage and fast packet delivery. To build Twist-routing algorithm, we use bounding circles, which borrows the idea from GOAFR+ routing algorithm for ad-hoc wireless networks. Unlike Maze-routing, whose path length is unbounded even when the optimal path length is fixed, in Twist-routing, the path length is bounded by the cube of the optimal path length. Our evaluations show that Twist-routing algorithm delivers packets up to 35% faster than Maze-routing with a uniform traffic and Erdos-Rényi failure model, when the failure rate and the injection rate vary.
文摘Based on a ripped-up and rerouted methodology,a multilayer area detailed router is presented by using simulated evolution technique.A modified maze algorithm is also performed for the single net.
