Combining approximation algorithm with genetic algorithm at the initial population for NP-complete problem
In Genetic Algorithm (GA), the prevalent approach to population initialization are heuristics and randomization. Unlike approximation algorithms (AA), these methods do not provide a guarantee to the generated individual's quality in terms of optimality. Surprisingly, no literature to this date...
Saved in:
Main Authors: | Razip, H., Zakaria, M.N. |
---|---|
Format: | Article |
Published: |
Institute of Electrical and Electronics Engineers Inc.
2018
|
Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85048884804&doi=10.1109%2fSCORED.2017.8305413&partnerID=40&md5=4d4e3b165eef53b17132adeb1850848e http://eprints.utp.edu.my/21753/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
APPROXIMATION ALGORITHM-BASED INITIAL POPULATION GENERATION
FOR THE GENETIC ALGORITHM SOLUTION OF THE SET COVERING PROBLEM
by: MOHAMAD RAZIP, HAJAR
Published: (2019) -
DNA Computing and Its Application on NP Completeness
Problem
by: Hasudungan, Rofilde, et al.
Published: (2013) -
Multi-Population Genetic Algorithm for Rich Vehicle Routing Problems
by: Agany Manyiel, J.M., et al.
Published: (2021) -
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)