{"id":"https://openalex.org/W2811001279","doi":null,"title":"PENDEKATAN ALGORITMA GENETIK PARALEL UNTUK UNCAPACITATED LOCATION PROBLEM","display_name":"PENDEKATAN ALGORITMA GENETIK PARALEL UNTUK UNCAPACITATED LOCATION PROBLEM","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2811001279","mag":"2811001279"},"language":"id","primary_location":{"id":"mag:2811001279","doi":null,"is_oa":false,"landing_page_url":"https://repository.unair.ac.id/25881/","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082152381","display_name":"Muhammad Aslam","orcid":"https://orcid.org/0000-0002-8225-4359","observed_orcids":["https://orcid.org/0000-0002-8225-4359"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Muhammad Aslam","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-8225-4359","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5082152381"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.5913000106811523,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.5913000106811523,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.3711000084877014,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.008100000210106373,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parallel-genetic-algorithm","display_name":"parallel genetic algorithm","score":0.902999997138977},{"id":"https://openalex.org/keywords/facility-location","display_name":"facility location","score":0.9440000057220459},{"id":"https://openalex.org/keywords/binary-encoding","display_name":"binary encoding","score":0.4869999885559082},{"id":"https://openalex.org/keywords/subpopulations","display_name":"subpopulations","score":0.7960000038146973},{"id":"https://openalex.org/keywords/crossover-operator","display_name":"crossover operator","score":0.6340000033378601},{"id":"https://openalex.org/keywords/mutation-operator","display_name":"mutation operator","score":0.8730000257492065},{"id":"https://openalex.org/keywords/roulette-wheel-selection","display_name":"roulette wheel selection","score":0.8320000171661377},{"id":"https://openalex.org/keywords/tournament-selection","display_name":"tournament selection","score":0.9980000257492065},{"id":"https://openalex.org/keywords/c-implementation","display_name":"C++ implementation","score":0.7059999704360962},{"id":"https://openalex.org/keywords/customer-service-costs","display_name":"customer service costs","score":0.5600000023841858}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5321221947669983}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2811001279","doi":null,"is_oa":false,"landing_page_url":"https://repository.unair.ac.id/25881/","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.5378999710083008}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7098157030","https://openalex.org/W2140553694","https://openalex.org/W7100799252","https://openalex.org/W2279703095","https://openalex.org/W2763528322","https://openalex.org/W2037398498","https://openalex.org/W2051596545","https://openalex.org/W7097456729","https://openalex.org/W328243831","https://openalex.org/W6987852198"],"abstract_inverted_index":{"Skripsi":[0],"ini":[1],"bertujuan":[2],"untuk":[3,46,67,110,236,253],"menyelesaikan":[4],"uncapacitated":[5,111],"location":[6,23,112],"problem":[7,24,113],"menggunakan":[8],"algoritma":[9,17,97,107,233],"genetik":[10,18,92,98,108,234],"paralel":[11,93,109,235],"dan":[12,73,77,135,144,166,180,192,205,220,245,262],"membuat":[13],"program":[14],"komputer":[15],"dari":[16,96,214,230],"yang":[19,29,83,99,157,160,171,185,196,212,228,264],"telah":[20],"dibuat.":[21],"Uncapacitated":[22],"digambarkan":[25],"dengan":[26,79,115,121,202,209,222,240,243,257,260],"sejumlah":[27,32],"fasilitas":[28,49,62,82],"akan":[30,42,58,148],"melayani":[31,68,90],"m":[33],"customer;":[34],"selain":[35],"itu":[36,130],"terdapat":[37,65],"sekumpulan":[38],"n":[39],"lokasi":[40,51,201,208,239,256],"dimana":[41],"dibangun":[43,84],"fasilitas,":[44],"sehingga":[45,146],"membangun":[47],"satu":[48,61],"pads":[50],"i":[52,76],"dibutuhkan":[53],"biaya":[54,66,248,267],"f;":[55],"setiap":[56],"customer":[57,69,204,211,242,259],"dilayani":[59],"oleh":[60,101,216],"sedemikian":[63],"hingga":[64],"j":[70,78],"yaitu":[71],"cy,":[72],"jarak":[74],"antara":[75],"asumsi":[80],"bahwa":[81],"tidak":[85],"memiliki":[86],"batasan":[87],"jumlah":[88],"dalam":[89,103],"customer.\r\n\r\nAlgoritma":[91],"merupakan":[94],"pengembangan":[95],"diirspirasi":[100],"proses-proses":[102],"teori":[104],"evolusi.":[105],"Proses":[106,152],"dimulai":[114],"membangkitkan":[116],"populasi":[117,126,131,150],"awal":[118],"secara":[119],"acak":[120],"kode":[122],"biner":[123],"sebanyak":[124],"ukuran":[125],"(pop":[127],"size),":[128],"setelah":[129],"dibagi":[132],"menjadi":[133],"subpopulasi":[134,138],"pada":[136],"tiap-tiap":[137],"dilakukan":[139],"proses":[140],"evaluasi,":[141],"seleksi,":[142],"crossover":[143,170,174,177],"mutasi":[145,184,188,190,193],"akhirnya":[147],"dibentuk":[149],"baru.":[151],"diulangi":[153],"sampai":[154],"N":[155],"generasi":[156],"diinginkan.Metode":[158],"seleksi":[159,163,167],"digunakan":[161,172,186,197],"adalah":[162,173,187,198,250,270],"roulette":[164],"wheel":[165],"turnamen,":[168],"metode":[169,183],"dua":[175],"titik,":[176],"tiga":[178],"titik":[179],"uniform":[181],"crossover,":[182],"inversi,":[189],"displacement":[191],"scramble":[194],"sublist.\r\n\r\nData":[195],"data":[199,206,237,254],"10":[200,238],"15":[203,241],"50":[207,210,255,258],"diambil":[213],"OR-library":[215],"J.":[217],"E.":[218],"Beasley":[219],"diselesaikan":[221],"bahasa":[223],"pemrogramam":[224],"C++.":[225],"Penyelesaian":[226],"terbaik":[227],"didapatkan":[229],"prgram":[231],"C++":[232],"pc0,6":[244],"pm0,01":[246],"diperoleh":[247,266],"minimal":[249,269],"149690,484375.":[251],"Sedangkan":[252],"pc":[261],"pm":[263],"sama":[265],"paling":[268],"793439,625.":[271]},"counts_by_year":[],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2018-07-10T00:00:00"}