AN APPROACH TO A PROBLEM IN NETWORK DESIGN USING GENETIC ALGORITHMS

被引：71

作者：

PALMER, CC ^{[1
]}

KERSHENBAUM, A ^{[1
]}

机构：

[1] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598

来源：

NETWORKS | 1995年 / 26卷 / 03期

关键词：

D O I：

10.1002/net.3230260305

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper describes a new approach to finding solutions to the optimal communication spanning tree problem (OCSTP) using a genetic algorithm. The difficulties posed by this problem are reviewed and a genetic algorithm that consistently finds very good, if not optimal, solutions to it is presented. Finally, a comparison of the genetic algorithm's solutions to those produced by a good heuristic is given that demonstrates the genetic algorithm's ability to find solutions at least equivalent to, if not superior to, those found by the heuristic. (C) 1995 John Wiley & Sons, Inc.

引用

页码：151 / 163

页数：13

共 50 条

[31] DISTRIBUTED GENETIC ALGORITHMS FOR THE FLOORPLAN DESIGN PROBLEM
COHOON, JP
HEGDE, SU
MARTIN, WN
RICHARDS, DS
[J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1991, 10 (04) : 483 - 492
[32] Solving the feeder bus network design problem by genetic algorithms and ant colony optimization
Kuan, SN
Ong, HL
Ng, KM
[J]. ADVANCES IN ENGINEERING SOFTWARE, 2006, 37 (06) : 351 - 359
[33] Reconnaissance problem using genetic algorithms
Abdelkhalik, O
Mortari, D
[J]. Spaceflight Mechanics 2005, Vol 120, Pts 1 and 2, 2005, 120 : 1347 - 1357
[34] Approximation Algorithms for a Capacitated Network Design Problem
Refael Hassin
R. Ravi
F. Sibel Salman
[J]. Algorithmica , 2004, 38 : 417 - 431
[35] Approximation algorithms for a capacitated network design problem
Hassin, R
Ravi, R
Salman, FS
[J]. ALGORITHMICA, 2004, 38 (03) : 417 - 431
[36] Efficient algorithms for a simple network design problem
Nakano, Shin-ichi
Uehara, Ryuhei
Uno, Takeaki
[J]. NETWORKS, 2013, 62 (02) : 95 - 104
[37] Approximation algorithms for a directed network design problem
Melkonian, V
Tardos, E
[J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1999, 1610 : 345 - 360
[38] APPROXIMATE ALGORITHMS FOR THE DISCRETE NETWORK DESIGN PROBLEM
POORZAHEDY, H
TURNQUIST, MA
[J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1982, 16 (01) : 45 - 55
[39] A new fuzzy systems design and optimization approach using genetic algorithms
Cuomo, Pietro
Di Lascio, Luigi
[J]. 2007 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS 1-4, 2007, : 1332 - 1337
[40] Reliability optimal design problem with interval coefficients using Hybrid Genetic Algorithms
Taguchi, T
Yokota, T
Gen, M
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 1998, 35 (1-2) : 373 - 376

← 1 2 3 4 5 →