A GENETIC ALGORITHM FOR THE LINEAR TRANSPORTATION PROBLEM

被引：125

作者：

VIGNAUX, GA

MICHALEWICZ, Z

机构：

[1] UNIV N CAROLINA, DEPT COMP SCI, CHARLOTTE, NC 28223 USA

[2] VICTORIA UNIV WELLINGTON, DEPT MATH, WELLINGTON, NEW ZEALAND

来源：

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS | 1991年 / 21卷 / 02期

关键词：

D O I：

10.1109/21.87092

中图分类号：

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

学科分类号：

0812 ;

摘要：

Genetic algorithms are adaptive procedures that find solutions to problems by an evolutionary process based on natural selection. The use of alternative genetic algorithms for solving the linear transportation problem is discussed. Using it as an example the relationship between representation structures and genetic operators is investigated for constrained problems and demonstrate the value of structures richer than bitstrings.

引用

页码：445 / 452

页数：8

共 15 条

[1] ANTONISSE J, 1989, 3RD P INT C GEN ALG, P86
[2] Brooke A., 1988, GAMS USERS GUIDE
[3] Davis L, 1987, GENETIC ALGORITHMS S
[4] DEJONG KA, 1985, JUL P INT C GEN ALG, P169
[5] GOLD DL, 1985, JEWISH LANG REV, P154
[6] Goldberg DE, 1989, GENETIC ALGORITHMS S
[7] Grefenstette J. J., 1987, GENETIC ALGORITHMS S
[8] OPTIMIZATION OF CONTROL PARAMETERS FOR GENETIC ALGORITHMS
GREFENSTETTE, JJ
[J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1986, 16 (01): : 122 - 128
[9] Holland J.H., 1992, ADAPTATION NATURAL A, V2nd ed.
[10] MICHALEWICZ Z, UNPUB ORSA J COMPUT

← 1 2 →