On genetic algorithms for the packing of polygons

被引：363

作者：

Jakobs, S

机构：

[1] RWTH Aachen, Lehrstuhl C für Mathematik, D-52062 Aachen

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1996年 / 88卷 / 01期

关键词：

optimization; genetic algorithms; mathematical programming; adaptive processes; packing problems;

D O I：

10.1016/0377-2217(94)00166-9

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

A genetic algorithm for placing polygons on a rectangular board is proposed. The algorithm is improved by combination with deterministic methods.

引用

页码：165 / 181

页数：17

共 23 条

[1]

Adamowicz M., 1976, Computer Aided Design, V8, P27, DOI 10.1016/0010-4485(76)90006-3

[2] ORTHOGONAL PACKINGS IN 2 DIMENSIONS [J].

BAKER, BS ;

COFFMAN, EG ;

RIVEST, RL .

SIAM JOURNAL ON COMPUTING, 1980, 9 (04) :846-855

[3] AN IMPROVED BL LOWER BOUND [J].

BROWN, DJ .

INFORMATION PROCESSING LETTERS, 1980, 11 (01) :37-39

[4]

Coffman, 1984, ALGORITHM DESIGN COM, P49, DOI DOI 10.1007/978-3-7091-4338-4

[5]

De Jong KA., 1975, An analysis of the behavior of a class of genetic adaptive systems

[6]

Fogel D.B., 1991, SYSTEM IDENTIFICATIO

[7]

Fogel L. J., 1966, ARTIFICIAL INTELLIGE, DOI DOI 10.1109/9780470544600.CH7

[8] OPTIMAL PACKING AND COVERING IN THE PLANE ARE NP-COMPLETE [J].

FOWLER, RJ ;

PATERSON, MS ;

TANIMOTO, SL .

INFORMATION PROCESSING LETTERS, 1981, 12 (03) :133-137

[9]

Garey M. R., 1979, Computers and intractability. A guide to the theory of NP-completeness

[10]

Goldberg D. E., 2013, Genetic Algorithms

← 1 2 3 →