Double-simulated annealing model for mapping of graphs to single-row networks

Abstract

Connected g raph is a graph where every pair of distinct vertices in the graph is connecte d either dire ctly or ind irectly. In our real life, m any science and engineerin g applications can be reduced into the connected graph representations, such as telecommunication and wireless s ensor problem s. A connected graph can be transform ed into single row-routing network as shown by Salleh et. al. in 2007. However, the earlier work does not produce optim al results in as the ordering in G is sequentially done. In this paper we will present a co mplete optim izing modeling for single row transform ation of conne cted graphs. Thus, the effort to optim ize the ordering of vertices in connected graph for transf orm ation into a planar graph in the form of single-row network is carried out through the new interval form ation and Double Simulated Annealing (DSA).