A Comparative study of Three Evolutionary Algorithms Incorporating Different Amounts of Domain Knowledge for Node Covering Problem  

Oleh:

He, Jun ; Yao, Xin ; Li, Jin

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: IEEE Transactions on Systems, Man, and Cybernetics: Part C Applications and Reviews vol. 35 no. 2 (May 2005), page 266-271.
Topik: Algorithm Design; Heuristic Knowledge; Optimization Methods; Performance Analysis.

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: II69.1 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

This paper compares three different evolutionary algorithms for solving the node covering problem: EA-I relies on the definition of the problem only without using any domain knowledge, while EA-II and EA-III employ extra heuristic knowledge. In theory, it is proven that all three algorithms can find an optimal solution in finite generations and find a feasible solution efficiently; but none of them can find the optimal solution efficiently for all instances of the problem. Through experiments, it is observed that all three algorithms can find a feasible solution efficiently, and the algorithms with extra heuristic knowledge can find better approximation solutions, but none of them can find the optimal solution to the first instance efficiently. This paper shows that heuristic knowledge is helpful for evolutionary algorithms to find good approximation solutions, but it contributes little to search for the optimal solution in some instances.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali