Simulated annealing technique for routing in a rectangular MESH network
In the process of automatic design for printed circuit boards (PCBs), the phase following cell placement is routing. On the other hand, routing process is a notoriously difficult problem, and even the simplest routing problem which consists of a set of two-pin nets is known to be NP-complete. In thi...
Saved in:
Main Authors: | Salleh, Shaharuddin, Adzhar, Noraziah |
---|---|
Format: | Article |
Published: |
Hindawi Publishing Corporation
2014
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/62579/ http://dx.doi.org/10.1155/2014/127359 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Obstacle-aware routing problem in a rectangular mesh network
by: Adzhar, Noraziah, et al.
Published: (2015) -
An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network
by: Noraziah, Adzhar, et al.
Published: (2017) -
An enhanced simulated annealing approach for cylindrical, rectangular mesh, and semi-diagonal torus network topologies
by: Adzhar, Noraziah
Published: (2015) -
Routing problem in rectangular mesh network using shortest path based Greedy method
by: Noraziah, Adzhar, et al.
Published: (2019) -
Routing problem in rectangular mesh network using Dijkstra’s based Greedy method
by: Noraziah, Adzhar, et al.
Published: (2018)