?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=EVALUASI+KINERJA+GENETIC+ALGORITHM+(GA)+DENGAN+STRATEGI%0D%0APENALTI+STUDI+KASUS+MULTI-CHOICE+MULTI-DIMENSIONAL%0D%0AKNAPSACK+PROBLEM+(MMKP)&rft.creator=DIAN+ANGGRAINI%2C++1217051020&rft.subject=QA75+Electronic+computers.+Computer+science&rft.subject=QA76+Computer+software&rft.description=Persoalan+optimasi+sering+ditemui+dalam+kehidupan+sehari-hari.+Salah+satu+contohnya%0D%0Aadalah+persoalan+knapsack.+Persoalan+Knapsack+memiliki+beberapa+jenis%2C+pada%0D%0Apenelitian+ini+akan+digunakan+Multi-Choice+Multi-Dimensional+Knapsack+Problem%0D%0A(mmKP).+Persoalan+mmKP+memiliki+fungsi+kendala+yang+akan+membagi+ruang+solusi%0D%0Alayak+dan+tidak+layak.+Untuk+mengatasi+ini+dibutuhkan+strategi+penanganan+kendala.%0D%0AStrategi+yang+akan+digunakan+adalah+strategi+penalti.+Pada+penelitian+ini+digunakan%0D%0AGenetic+Algorithm+(pGA)+dan+pGA+dengan+tambahan+Local+Search+(phGA)+untuk%0D%0Amenyelesaikan+mmKP.+Hasil+dari+penelitian+ini+menunjukkan+phGA+memiliki+hasil%0D%0Ayang+lebih+baik+dibandingkan+pGA%2C+namun+pGA+membutuhkan+running+time+yang%0D%0Alebih+sedikit+dibandingkan+phGA.%0D%0AKata+kunci%3A+Genetic+Algorithm+(GA)%2C+Knapsack+Problem%2C+Multi-Choice+Multi-%0D%0ADimensional+Knapsack+Problem%2C+Local+Search%2C+Penalty+Strategy%0D%0A%0D%0AABSTRACT%0D%0A%0D%0AOptimization+problem+frequently+encountered+in+daily+activity.+Knapsack+problem%0D%0A(KP)+is+one+of+the+examples.+KP+have+varian%2C+KP+used+in+this+research+was+Multi-%0D%0AChoice+Multi-Dimensional+Knapsack+Problem+(mmKP).+mmKP+problem+has%0D%0Aconstraints+function+that+will+divide+feasible+and+not+feasible+solution.+Handle%0D%0Aconstraints+strategy+is+needed+to+resolve+this+problem.+Strategy+will+be+used+is+penalty%0D%0Astrategy.+This+research+used+Genetic+Algorithm+(pGA)+and+pGA+with+addition+Local%0D%0ASearch+(phGA)+to+resolve+mmKP.+The+result+of+this+research+shows+that+phGA+has%0D%0Abetter+solution+value+than+pGA%2C+but+pGA+need+less+running+time+than+phGA.%0D%0AKey+word%3A+Genetic+Algorithm+(GA)%2C+Knapsack+Problem%2C+Multi-Choice+Multi-%0D%0ADimensional+Knapsack+Problem%2C+Local+Search%2C+Penalty+Strategy&rft.publisher=FAKULTAS+MATEMATIKA+DAN+ILMU+PENGETAHUAN+ALAM&rft.date=2016-12-27&rft.type=Skripsi&rft.type=NonPeerReviewed&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F25090%2F1%2FABSTRACT%2520%2528ABSTRAK%2529.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F25090%2F2%2FSKRIPSI%2520FULL.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F25090%2F3%2FSKRIPSI%2520TANPA%2520BAB%2520%2520PEMBAHASAN.pdf&rft.identifier=++DIAN+ANGGRAINI%2C+1217051020++(2016)+EVALUASI+KINERJA+GENETIC+ALGORITHM+(GA)+DENGAN+STRATEGI+PENALTI+STUDI+KASUS+MULTI-CHOICE+MULTI-DIMENSIONAL+KNAPSACK+PROBLEM+(MMKP).++FAKULTAS+MATEMATIKA+DAN+ILMU+PENGETAHUAN+ALAM%2C+UNIVERSITAS+LAMPUNG.+++++&rft.relation=http%3A%2F%2Fdigilib.unila.ac.id%2F25090%2F