APPROXIMATION ALGORITHM-BASED INITIAL POPULATION GENERATION FOR THE GENETIC ALGORITHM SOLUTION OF THE SET COVERING PROBLEM

MOHAMAD RAZIP, HAJAR (2019) APPROXIMATION ALGORITHM-BASED INITIAL POPULATION GENERATION FOR THE GENETIC ALGORITHM SOLUTION OF THE SET COVERING PROBLEM. Masters thesis, Universiti Teknologi PETRONAS.

PDF
HajarRazip_G03597.pdf
Restricted to Registered users only
Download (4MB)

Abstract

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.

Item Type:	Thesis (Masters)
Subjects:	T Technology > T Technology (General)
Departments / MOR / COE:	Sciences and Information Technology
Depositing User:	Mr Ahmad Suhairi Mohamed Lazim
Date Deposited:	19 Mar 2020 13:13
Last Modified:	19 Mar 2020 13:13
URI:	http://utpedia.utp.edu.my/id/eprint/20266

Actions (login required)

: View Item