?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=IMPLEMENTASI+GENETIC+ALGORITHM+(GA)+BERBASIS+STRATEGI+PENALTI+PADA+KNAPSACK+PROBLEM+&rft.creator=Riska+Malinda+%2C+1117032052&rft.subject=QA76+Computer+software&rft.description=Permasalahan+optimasi+sering+kali+ditemukan+pada+kehidupan+sehari-hari%2C+seperti+permasalahan+investasi%2C+penentuan+rute+pendistribusian+barang+dan+penentuan+jadwal+piket+di+rumah+sakit%2C+dll.+Permasalahan+investasi+termasuk+kedalam+Knapsack+Problem+(KP).+KP+merupakan+permasalahan+optimasi+kombinatorik+dan+permasalahan+NP-Hard.+Berbagai+penelitian+telah+dilakukan+dan+melaporkan+beberapa+metode+konvensional+yang+dianggap+mampu+untuk+menyelesaikan+permasalahan+KP.+Meskipun+demikian%2C+beberapa+metode+konvensional+masih+sangat+sulit+untuk+mendapatkan+solusi+optimal+dengan+waktu+yang+relatif+cepat+karena+KP+merupakan+permasalahan+NP-Hard.+Maka%2C+pada+penelitian+ini+dikembangkan+suatu+model+GA+sebagai+salah+satu+metode+heuristik+untuk+menyelesaikanKP.%0D%0AGA+merupakan+algoritma+yang+dikembangkan+meniru+proses+evolusi+alamiah+pada+makhluk+hidup.+Tahap-tahap+pencarian+solusi+optimal+pada+GA+yaitu+inisialisasi%2C+evaluasi%2C+pindah+silang%2C+mutasi+dan+seleksi.+Proses+inisialisasi+dilakukan+dengan+dua+tipe+pembangkitan+kandidat+solusi.+Pertama%2C+kandidat+solusi+dibangkitkan+langsung+pada+ruang+solusi+yang+layak+(directedGA).Kedua%2C+kandidat+solusi+dibangkitkan+secara+acak+(randomly+GA).+Strategi+penalti+sebagai+metode+untuk+mengevaluasi+kandidat+solusi+dan+menangani+kendala+menjadi+fokus+pada+penelitian+ini.+Uji+coba+dilakukan+pada+test+problem+yang+ada+pada+literatur.+Hasil+penelitian+mencatat+strategi+penalti+dengan+directed+GA+lebih+cocokdibandingkandenganrandomlyGA.%0D%0A%0D%0AKataKunci%3AGeneticAlgorithm(GA)%2CKnapsackProblem(KP)%2CStrategi+Penalti.%0D%0A%0D%0A%0D%0AABSTRACT%0D%0AOptimization+problems+have+many+function+in+a+real+life%2C+such+as+for+select+investments%2C+for+determine+the+distribution+of+goods+and+for+determine+the+picket+schedules+in+the+hospitals%2C+etc.+Investment+issues+are+included+into+the+knapsack+problem.+Knapsack+problem+is+a+combinatorial+optimization+problem+that+belongs+to+the+NP-Hard+problem.+Some+of+conventional+methods+have+been+reportedtosolveit.However+several+methodsare+still+veryhard+toget+an+optimal+solution+with+a+relatively+quick+time%2C+because+the+knapsack+problem+belongs+to+the+NP-hard+problem.+Therefore%2C+in+this+paper+we+developed+a+model+of+GA+as+heuristicsmethodtosolveknapsack.%0D%0AGAis+an+algorithm+developed+similar+to+the+natural+evolutionary+process.+Stages+at+the+GAinclude+initialitation%2Cevaluation%2C+crossover%2Cmutationand+selection.The+initialization+process+was+done+by+two+types+of+generate+candidate+solutions.+The+first%2Cgenerating+ofcandicatesolution+directlyonthefeasible+space+(directedGA).+The+second%2C+generating+of+candidate+solution+randomly+(randomly+GA).+Penalty+strategy+asa+method+forevaluating+the+candidate+solutionand+handling+constraint+will+be+focus+onthis+research.+Experiment+was+done+by+usingtest+problems+given+in+the+literature.+Based+on+the+experiments%2C+penalty+strategy+with+the+directed+GA+isbettersuitedthantherandomlyGA.%0D%0A%0D%0AKeywords%3AGeneticAlgorithm(GA)%2CKnapsackProblem(KP)%2CPenaltyStrategy.&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%2F12925%2F1%2FABSTRACT.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12925%2F2%2FABSTRAK.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12925%2F4%2FCOVER%2520LUAR.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12925%2F3%2FCOVER%2520DALAM.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12925%2F6%2FDAFTAR%2520ISI.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12925%2F7%2FDAFTAR%2520TABEL.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12925%2F5%2FDAFTAR%2520GAMBAR.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12925%2F8%2FHALAMAN%2520PENGESAHAN.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12925%2F9%2FHALAMAN%2520PERSETUJUAN.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12925%2F10%2FMOTO.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12925%2F11%2FPERNYATAAN.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12925%2F12%2FPERSEMBAHAN.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12925%2F13%2FRIWAYAT%2520HIDUP.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12925%2F14%2FSANWACANA.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12925%2F130%2FDAFTAR%2520ISI.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12925%2F15%2FBAB%2520I.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12925%2F129%2FBAB%2520II.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12925%2F18%2FBAB%2520III.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12925%2F17%2FBAB%2520IV.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12925%2F123%2FBAB%2520V.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F12925%2F19%2FDAFTAR%2520PUSTAKA.pdf&rft.identifier=++Riska+Malinda+%2C+1117032052++(2015)+IMPLEMENTASI+GENETIC+ALGORITHM+(GA)+BERBASIS+STRATEGI+PENALTI+PADA+KNAPSACK+PROBLEM.++FAKULTAS+MATEMATIKA+DAN+ILMU+PENGETAHUAN+ALAM%2C+UNIVERSITAS+LAMPUNG.+++++&rft.relation=http%3A%2F%2Fdigilib.unila.ac.id%2F12925%2F