๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A new spanning tree-based genetic algorithm for

โœ Scribed by Ming-Jong Yao; Hsin-Wei Hsu

Publisher
Springer US
Year
2008
Tongue
English
Weight
463 KB
Volume
10
Category
Article
ISSN
1389-4420

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Spanning tree-based genetic algorithm fo
Spanning tree-based genetic algorithm for bicriteria transportation problem
โœ Mitsuo Gen; Yin-Zhen Li ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 371 KB

In this paper, we present a new approach which is spanning tree-based genetic algorithm for bicriteria transport,ation problem. The transportation problem have the special data structure in solution characterized as a spanning tree. In encoding transportation problem, we introduce one of node encodi

A note on genetic algorithms for degree-
A note on genetic algorithms for degree-constrained spanning tree problems
โœ Zhou, Gengui; Gen, Mitsuo ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 58 KB ๐Ÿ‘ 2 views

The degree-constrained spanning tree problem is of high practical importance. Up to now, there are few effective algorithms to solve this problem because of its NP-hard complexity. In this paper, we present a new approach to solve this problem by using genetic algorithms and computational results to