APPROXIMATION ALGORITHM-BASED INITIAL POPULATION GENERATION FOR THE GENETIC ALGORITHM SOLUTION OF THE SET COVERING PROBLEM
The Set Covering Problem (SCP) is a problem of finding the set of weighted subsets of a ground set of elements that minimizes the costs while covering all of the elements.
Saved in:
Main Author: | MOHAMAD RAZIP, HAJAR |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2019
|
Subjects: | |
Online Access: | http://utpedia.utp.edu.my/20266/1/HajarRazip_G03597.pdf http://utpedia.utp.edu.my/20266/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Combining approximation algorithm with genetic algorithm at the initial population for NP-complete problem
by: Razip, H., et al.
Published: (2018) -
Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems
by: Fayaz, Muhammad, et al.
Published: (2016) -
An optimal approximation algorithm for optimization of un-weighted minimum vertex cover problem
by: Fayaz, Muhammad, et al.
Published: (2016) -
Solving assembly line balancing problem using genetic algorithm with heuristics-treated initial population
by: Bakar, Nooh Abu, et al.
Published: (2008) -
Solving Assembly Line Balancing Problem Using Genetic Algorithm With Heuristics-Treated Initial Population
by: Chong, Kuan Eng, et al.
Published: (2008)