Simulated annealing: theory and applications
Simulated annealing: theory and applications
Neuro-fuzzy and soft computing: a computational approach to learning and machine intelligence
Neuro-fuzzy and soft computing: a computational approach to learning and machine intelligence
Genetic Algorithms and Simulated Annealing
Genetic Algorithms and Simulated Annealing
Interconnection Networks for Multiprocessors and Multicomputers: Theory and Practice
Interconnection Networks for Multiprocessors and Multicomputers: Theory and Practice
Graph Coloring with Adaptive Evolutionary Algorithms
Journal of Heuristics
Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Optical multistage interconnection networks: new challenges and approaches
IEEE Communications Magazine
Routing and scheduling for a novel optical multistage interconnection network
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
Multistage Interconnection Networks (MIN) is popular in switching and communication applications. A major problem called Cross talk is introduced by optical MIN, which is caused by coupling two signals within a switching element. In this paper, we focus on an efficient solution to avoid cross talk, which is routing traffic through an N 脳 N optical network to avoid coupling two signals within each switching element. Under the constraint of avoiding cross talk, what we are interested is how to realize a permutation that will use the minimum number of passes. This routing problem is an NP-hard problem. Many heuristic algorithms are designed by many researchers to perform this routing such as sequential algorithm, degree-descending algorithm, etc. The Simulated Annealing algorithm is used in this research to improve the performance of solving the problem and optimizing the result. Many cases are tested and the results are compared to the results of other algorithms to show the advantages of good quality solution and short execution time of Simulated Annealing algorithm.