caa a22 4500 467986738 CHVBK 20180323112534.0 cr unu---uuuuu 170328e19900901xx s 000 0 eng 10.1007/BF02575798 doi (NATIONALLICENCE)springer-10.1007/BF02575798 Rossi A. Dept. of Informations and Applications, University of Salerno, I-84081, Baronissi aut A simulated annealing channel routing algorithm [Elektronische Daten] [A. Rossi] In this paper an algorithm for the Channel Routing Problem (CRP) on the Manhattan Model is proposed. The algorithm employs a search method in the solution space, known as Simulated Annealing. The channel width is reduced by breaking up thelong runs of the vertical constraint graph, associated with the problem. The dogleg strategy adopted is similar to that employed in the channel routing algorithm proposed in [1]. The results obtained by extensive simulation runs are encouraging compared with the results of other heuristics for the same problem. Instituto di Elaborazione della Informazione del CNR, 1990 CALCOLO Springer-Verlag 27/3-4(1990-09-01), 279-290 0008-0624 27:3-4<279 1990 27 10092 https://doi.org/10.1007/BF02575798 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF02575798 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Rossi A. Dept. of Informations and Applications, University of Salerno, I-84081, Baronissi aut NATIONALLICENCE 773 0- CALCOLO Springer-Verlag 27/3-4(1990-09-01), 279-290 0008-0624 27:3-4<279 1990 27 10092 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer