A Powerful New Encoding for Tree-Based Combinatorial Optimisation Problems

Soak, Sang-Moon; Corne, David; Ahn, Byung-Ha

doi:10.1007/978-3-540-30217-9_44

Cited by 12 publications

(13 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…That algorithm was tested on graphs up to 1000 vertices. Also in 2004, Soak, Corne, and Ahn [20] introduced a new encoding for trees and compared it to the edge-set encoding from [15]. The two algorithms produced the same results for graphs of 30 and 40 vertices, while the new encoding performed better on 50 vertex graphs [20].…”

Section: Preliminariesmentioning

confidence: 99%

“…Our solutions were compared to previously published results from each of the algorithms listed above, except those from before the year 2000, the first version of the edge-set encoded GA [13], and the 2004 encoding by Soak, Corne, and Ahn [20]. This final algorithm was not used because the specific graphs tested in that paper were not available for comparison.…”

Section: Preliminariesmentioning

confidence: 99%

See 1 more Smart Citation

An ant-based algorithm for finding degree-constrained minimum spanning tree

Bui

Zrncic

2006

Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation

View full text Add to dashboard Cite

A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spanning tree of minimum cost in an edge weighted graph is well known to be NP-hard. In this paper we give an Ant-Based algorithm for finding low cost degree-constrained spanning trees. Ants are used to identify a set of candidate edges from which a degree-constrained spanning tree can be constructed. Extensive experimental results show that the algorithm performs very well against other algorithms on a set of 572 problem instances.

show abstract

Section: Preliminariesmentioning

confidence: 99%

Section: Preliminariesmentioning

confidence: 99%

An ant-based algorithm for finding degree-constrained minimum spanning tree

Bui

Zrncic

2006

Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation

View full text Add to dashboard Cite

show abstract

“…Experimental results showed that RWTS provides a superior performance compared to the conventional TS in all test instances, except when using edge set encoding in tree-based optimization problems, with respect to the solution quality, standard deviation, and computational time. However, these studies did not provide any detailed mathematical analysis of RWTS [5][6][7], and Lee et al [8] gave only probability distribution of RWTS.…”

Section: Introductionmentioning

confidence: 99%

“…Recently, Soak et al [5][6][7] introduced a real world tournament selection (RWTS) scheme that can mimic an actual sporting tournament. Conventional TS selects only one pair of chromosomes from a population, and only the winner goes into the mating pool, while whole population is maintained in the competition pool.…”

Section: Introductionmentioning

confidence: 99%

“…1). In [5][6][7][8], RWTS was tested for various benchmark problems such as tree-based optimization, function optimization, multidimensional knapsack, and traveling salesman problems. Experimental results showed that RWTS provides a superior performance compared to the conventional TS in all test instances, except when using edge set encoding in tree-based optimization problems, with respect to the solution quality, standard deviation, and computational time.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Statistical properties analysis of real world tournament selection in genetic algorithms

et al. 2007

View full text Add to dashboard Cite

Genetic algorithms (GAs) are probabilistic optimization methods based on the biological principle of natural evolution. One of the important operators in GAs is the selection strategy for obtaining better solutions. Specifically, finding a balance between the selection pressure and diversity is a critical issue in designing an efficient selection strategy. To this extent, the recently proposed real world tournament selection (RWTS) method has showed good performance in various benchmark problems. In this paper, we focus on analyzing characteristics of RWTS from the viewpoint of both the selection probabilities and stochastic sampling properties in order to provide a rational explanation for why RWTS provides improved performance. Statistical experimental results show that RWTS has a higher selection pressure with a relatively small loss of diversity and higher sampling accuracy than conventional tournament selection. The performance tests in a traveling salesman problem further confirm that the comparatively higher pressure and sampling accuracy, which are inherent in RWTS, can enhance the performance in the selection strategy.

show abstract

A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems

Kehden

Neumann

2006

Evolutionary Computation in Combinatorial Optimization

View full text Add to dashboard Cite

A Powerful New Encoding for Tree-Based Combinatorial Optimisation Problems

Cited by 12 publications

References 14 publications

An ant-based algorithm for finding degree-constrained minimum spanning tree

An ant-based algorithm for finding degree-constrained minimum spanning tree

Statistical properties analysis of real world tournament selection in genetic algorithms

A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems

Contact Info

Product

Resources

About