@article{oai:fit.repo.nii.ac.jp:00000440,
 author = {川添, 勇気 and 加藤, 友彦},
 issue = {1},
 journal = {福岡工業大学研究論集},
 month = {Sep},
 note = {application/pdf, 論文(Article), The optimum connection of networks under a certain conditions is investigated by using the genetic algorithm. The condition employed by Hiroyasu and Suzuki in an analysis of a complex network is to minimize the average distance of the shortest path between every two nodes, by fixing the number of all links. However this condition does not guarantee the minimum cost. Instead we propose alternative conditions to minimize the following two factors: (1) construction cost of links; (2) average distance of the shortest path between every two nodes. In obtaining the shortest path we use the method proposed by Dijkstra. Optimization is performed for the case of 50 nodes, which are randomly located in some closed area, by changing the weighting factor between the above two conditions. As a result, the relation of the average distance versus the construction cost is obtained. Such computations are performed within three hours by using a conventional personal computer.},
 pages = {7--10},
 title = {遺伝的アルゴリズムによるネットワーク接続の最適化},
 volume = {41},
 year = {2008}
}