?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=Evaluasi+Kinerja+Genetic+Algorithm+(GA)+dengan+Strategi+Perbaikan+Kromosom%3A+Studi+Kasus+Knapsack+Problem&rft.creator=Aryanti+Dwiastuti%2C+1117032013&rft.subject=QA+Mathematics&rft.subject=QA75+Electronic+computers.+Computer+science&rft.description=Abstrak%3A%0D%0ASering+ditemui+persoalan+packing%2C+pengoptimalan+jumlah+nilai+prioritas+dari+beberapa+barang+yang+akan+di-packing+dalam+suatu+sack+tampa+melebihi+kapasitasnya.+Persoalan+ini+dikenal+dengan+Knapsack+Problem.+Untuk+persoalan+yang+kecil%2C+persoalan+Knapsack+mudah+untuk+diselesaikan.+Namun+untuk+persoalan+dengan+jumlah+barang+yang+sangat+banyak+akan+sangat+sulit+untuk+diselesaikan.+Beberapa+penelitan+terdahulu+telah+dikembangkan.+Teori+pemrograman+dinamis+Bellman+digunakan+pertama+kali+untuk+menyelesaikan+pesoalan+0-1+KP+kemudian+Kolesar+(1967)+mencoba+menyelesaikan+0-1+KP+dengan+menggunakan+algoritma+Branch+and+Bound%2C+dan+Gupta+menggunakan+Genetic+Algorithm+(GA)+dengan+operasi+fchek+untuk+mengatasi+kendala+solusi+yang+tidak+memenuhi+fungsi+pembatas.+Salah+satu+metode+yang+digunakan+adalah+Genetic+Algorithm+(GA).%0D%0ANamun%2C+persoalan+Knapsack+memiliki+fungsi+kendala+yang+akan+membagi+ruang+solusi+menjadi+dua%2C+yaitu+solusi+layak+dan+tidak+layak.+Untuk+mengatasi+kendala+ini%2C+fungsi+fchek+ditambahkan+pada+salah+satu+tahap+GA.+Mengulang+penelitian+sebelumnya%2C+penelitian+ini+juga+akan+mengatasi+kendala+tersebut.+Namun%2C+penelitian+ini+menggunakan+strategi+perbaikan+kromosom+pada+tahap+evaluasi.+Penelitian+ini+bertujuan+untuk+mengimplementasikan+GA+dengan+strategi+perbaikan+kromosom.+Metode+yang+dikembangkan+diujicobakan+pada+beberapa+data+tes+uji+(test+problem).+Kinerja+metode+ini+akan+dievaluasi+dengan+membandingkan+dengan+kinerja+GA+dengan+strategi+penalty.%0D%0A%0D%0AKata+kunci%3A+Combinatorial+Optimization%2C+Genetic+Algorithm+(GA)%2C+Knapsack+Problem%2C+Repairing+Strategy%0D%0A---------------------------------------------------------%0D%0A%0D%0AAbstact%0D%0APacking%2C+frequently+encountered+problems%2C+optimizing+the+total+value+of+several+items+that+priority+will+be+packing+a+sack+without+exceeding+its+capacity.+This+issue+is+known+to+Knapsack+Problem.+For+small+problems%2C+Knapsack+problem+is+easier+to+solve.+However%2C+for+the+issue+of+the+number+of+goods+that+very+much+will+be+very+difficult+to+resolve.+Some+previous+research+has+been+developed.+Bellman+dynamic+programming+theory+was+first+used+to+settle+the+issue+of+0-1+KP+then+Kolesar+(1967)+tried+to+finish+0-1+KP+using+Branch+and+Bound+algorithm%2C+and+Gupta+using+a+Genetic+Algorithm+(GA)+with+fchek+operation+to+overcome+a+solution+that+does+not+meet+barrier+function.+One+method+used+is+the+Genetic+Algorithm+(GA).%0D%0AHowever%2C+the+issue+of+constraint+Knapsack+has+a+function+that+will+divide+the+space+into+two+solutions%3A+solutions+feasible+and+not+feasible.+To+overcome+this+obstacle%2C+the+function+fchek+added+at+one+stage+GA.%0D%0ARepeating+previous+studies%3B+this+research+will+overcome+these+obstacles.+However%2C+this+study+uses+chromosomal+repair+strategy+at+this+stage+of+the+evaluation.+This+research+aims+to+implement+GA+with+chromosomes+improvement+strategies.+The+method+developed+was+tested+in+several+test+test+data+(test+problem).+This+method+of+performance+will+be+evaluated+by+comparing+the+performance+of+GA+with+penalty+strategy.%0D%0A%0D%0AKeywords%3A+Combinatorial+Optimization%2C+Genetic+Algorithm+(GA)%2C+Knapsack+Problem%2C+Repairing+Strategy&rft.publisher=FAKULTAS+MATEMATIKA+DAN+ILMU+PENGETAHUAN+ALAM&rft.date=2015-08-06&rft.type=Skripsi&rft.type=NonPeerReviewed&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12892%2F1%2F2.%2520ABSTRAK.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12892%2F2%2F3.%2520ABSTRACT.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12892%2F3%2F4.%2520COVER%2520DALAM.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12892%2F4%2F5.%2520HALAMAN%2520PERSETUJUAN.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12892%2F5%2F6.%2520HALAMAN%2520PENGESAHAN.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12892%2F6%2F7.%2520PERNYATAAN.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12892%2F7%2F8.%2520RIWAYAT%2520HIDUP.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12892%2F8%2F9.%2520PERSEMBAHAN.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12892%2F9%2F10.%2520SANWACANA.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12892%2F10%2F11.%2520KATA%2520MUTIARA.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12892%2F11%2F12.%2520DAFTAR%2520ISI.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12892%2F12%2F13.%2520DAFTAR%2520GAMBAR.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12892%2F13%2F14.%2520DAFTAR%2520TABEL.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12892%2F14%2FBAB%2520I.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12892%2F15%2FBAB%2520II.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12892%2F16%2FBAB%2520III.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12892%2F17%2FBAB%2520IV.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12892%2F18%2FBAB%2520V.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12892%2F19%2FDAFTAR%2520PUSTAKA.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12892%2F20%2FLAMPIRAN-LAMPIRAN.pdf&rft.identifier=++Aryanti+Dwiastuti%2C+1117032013++(2015)+Evaluasi+Kinerja+Genetic+Algorithm+(GA)+dengan+Strategi+Perbaikan+Kromosom%3A+Studi+Kasus+Knapsack+Problem.++FAKULTAS+MATEMATIKA+DAN+ILMU+PENGETAHUAN+ALAM%2C+UNIVERSITAS+LAMPUNG.+++++&rft.relation=http%3A%2F%2Fdigilib.unila.ac.id%2F12892%2F