Double Simulated Annealing Model for Mapping of Graphs to Single-Row Networks

• Main Authors: Loh, Ser Lee, Salleh, Shaharuddin, Sarmin, Nor Haniza
• Format: Book Section
• Language: English
• Published: Penerbit UTM Press 2008
• Subjects: Q Science (General)
• Online Access: http://eprints.utem.edu.my/id/eprint/12633/1/book_chapter.pdf; http://eprints.utem.edu.my/id/eprint/12633/

Connected graph is a graph where every pair of distinct vertices in the graph is connected either directly or indirectly. In our real life, many science and engineering applications can be reduced into the connected graph representations, such as telecommunication and wireless sensor problems. A connected graph can be transformed into single row-routing network as shown by Salleh et. al. in 2007. However, the earlier work does not produce optimal results in as the ordering in G is sequentially done. In this paper we will present a complete optimizing modeling for single row transformation of connected graphs. Thus, the effort to optimize the ordering of vertices in connected graph for transformation into a planar graph in the form of single-row network is carried out through the new interval formation and Double Simulated Annealing (DSA).