{"id":"https://openalex.org/W2996720641","doi":"https://doi.org/10.20956/jmsk.v16i2.7016","title":"Penerapan Algoritma Genetika Pada Penentuan Lintasan Terpendek Jalur Bus Rapid Transit Makassar","display_name":"Penerapan Algoritma Genetika Pada Penentuan Lintasan Terpendek Jalur Bus Rapid Transit Makassar","publication_year":2019,"publication_date":"2019-12-19","ids":{"openalex":"https://openalex.org/W2996720641","doi":"https://doi.org/10.20956/jmsk.v16i2.7016","mag":"2996720641"},"language":"en","primary_location":{"id":"doi:10.20956/jmsk.v16i2.7016","doi":"https://doi.org/10.20956/jmsk.v16i2.7016","is_oa":true,"landing_page_url":"https://doi.org/10.20956/jmsk.v16i2.7016","pdf_url":"https://journal.unhas.ac.id/index.php/jmsk/article/download/7016/4544","source":{"id":"https://openalex.org/S4210203012","display_name":"Jurnal Matematika Statistika dan Komputasi","issn_l":"1858-1382","issn":["1858-1382","2614-8811"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310315277","host_organization_name":"Hasanuddin University","host_organization_lineage":["https://openalex.org/P4310315277"],"host_organization_lineage_names":["Hasanuddin University"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Jurnal Matematika, Statistika dan Komputasi","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2996720641"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://journal.unhas.ac.id/index.php/jmsk/article/download/7016/4544","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085933952","display_name":"Jusmawati Massalesse","orcid":"https://orcid.org/0000-0001-6025-2494","observed_orcids":["https://orcid.org/0000-0001-6025-2494"]},"institutions":[{"id":"https://openalex.org/I98301867","display_name":"Hasanuddin University","ror":"https://ror.org/00da1gf19","country_code":"ID","type":"education","lineage":["https://openalex.org/I98301867"]}],"countries":["ID"],"is_corresponding":true,"raw_author_name":"Jusmawati Massalesse","raw_affiliation_strings":["Departemen Matematika, Universitas Hasanuddin, Makassar, Indonesia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departemen Matematika, Universitas Hasanuddin, Makassar, Indonesia","institution_ids":["https://openalex.org/I98301867"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5085933952"],"corresponding_institution_ids":["https://openalex.org/I98301867"],"apc_list":null,"apc_paid":null,"fwci":0.15,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.54601533,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":"16","issue":"2","first_page":"114","last_page":"114"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.6054999828338623,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.6054999828338623,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.3440000116825104,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.030500000342726707,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bus-rapid-transit","display_name":"bus rapid transit","score":0.800000011920929},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.5609999895095825},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.7379999756813049},{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.8709999918937683},{"id":"https://openalex.org/keywords/bus-route-optimization","display_name":"bus route optimization","score":0.7680000066757202},{"id":"https://openalex.org/keywords/bus-stops","display_name":"bus stops","score":0.7269999980926514},{"id":"https://openalex.org/keywords/graph-representation","display_name":"graph representation","score":0.6299999952316284},{"id":"https://openalex.org/keywords/roulette-wheel-selection","display_name":"roulette wheel selection","score":0.9129999876022339},{"id":"https://openalex.org/keywords/mutation-probability","display_name":"mutation probability","score":0.5770000219345093},{"id":"https://openalex.org/keywords/makassar","display_name":"Makassar","score":0.9039999842643738}],"concepts":[{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.74320387840271},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7377704381942749},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6290965676307678},{"id":"https://openalex.org/C2779697334","wikidata":"https://www.wikidata.org/wiki/Q2878855","display_name":"Bus rapid transit","level":3,"score":0.5305963754653931},{"id":"https://openalex.org/C99701942","wikidata":"https://www.wikidata.org/wiki/Q5455479","display_name":"Fitness proportionate selection","level":4,"score":0.5300198197364807},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4826222360134125},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4478588104248047},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.44573238492012024},{"id":"https://openalex.org/C195502155","wikidata":"https://www.wikidata.org/wiki/Q2810237","display_name":"Roulette","level":2,"score":0.4100058674812317},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3273351788520813},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23773905634880066},{"id":"https://openalex.org/C176066374","wikidata":"https://www.wikidata.org/wiki/Q629118","display_name":"Fitness function","level":3,"score":0.226004958152771},{"id":"https://openalex.org/C539828613","wikidata":"https://www.wikidata.org/wiki/Q178512","display_name":"Public transport","level":2,"score":0.19734764099121094},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.16366761922836304},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.160133957862854},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.14240741729736328},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.13036766648292542},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10811889171600342},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.20956/jmsk.v16i2.7016","doi":"https://doi.org/10.20956/jmsk.v16i2.7016","is_oa":true,"landing_page_url":"https://doi.org/10.20956/jmsk.v16i2.7016","pdf_url":"https://journal.unhas.ac.id/index.php/jmsk/article/download/7016/4544","source":{"id":"https://openalex.org/S4210203012","display_name":"Jurnal Matematika Statistika dan Komputasi","issn_l":"1858-1382","issn":["1858-1382","2614-8811"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310315277","host_organization_name":"Hasanuddin University","host_organization_lineage":["https://openalex.org/P4310315277"],"host_organization_lineage_names":["Hasanuddin University"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Jurnal Matematika, Statistika dan Komputasi","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.20956/jmsk.v16i2.7016","doi":"https://doi.org/10.20956/jmsk.v16i2.7016","is_oa":true,"landing_page_url":"https://doi.org/10.20956/jmsk.v16i2.7016","pdf_url":"https://journal.unhas.ac.id/index.php/jmsk/article/download/7016/4544","source":{"id":"https://openalex.org/S4210203012","display_name":"Jurnal Matematika Statistika dan Komputasi","issn_l":"1858-1382","issn":["1858-1382","2614-8811"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310315277","host_organization_name":"Hasanuddin University","host_organization_lineage":["https://openalex.org/P4310315277"],"host_organization_lineage_names":["Hasanuddin University"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Jurnal Matematika, Statistika dan Komputasi","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.651199996471405,"id":"https://metadata.un.org/sdg/9"},{"display_name":"Sustainable cities and communities","score":0.5142999887466431,"id":"https://metadata.un.org/sdg/11"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2996720641.pdf","grobid_xml":"https://content.openalex.org/works/W2996720641.grobid-xml"},"referenced_works_count":2,"referenced_works":["https://openalex.org/W415832010","https://openalex.org/W4301158343"],"related_works":["https://openalex.org/W7070198249","https://openalex.org/W7219444327","https://openalex.org/W2936543953","https://openalex.org/W1595459247","https://openalex.org/W4200222855","https://openalex.org/W4376507834","https://openalex.org/W147805362","https://openalex.org/W2954438037","https://openalex.org/W1517746430","https://openalex.org/W4390957950"],"abstract_inverted_index":{"Bus":[0],"Rapid":[1],"Transit":[2],"is":[3,8,29,45,54,93,146],"a":[4,21,27,37,124],"bus":[5,34,43,65,84,144],"system":[6],"that":[7,60],"fast,":[9],"convenient,":[10],"safe":[11],"and":[12,18,39,76,82,101,104,108,123,136],"on":[13],"time":[14],"from":[15,135],"infrastructure,":[16],"vehicles,":[17],"schedules.":[19],"As":[20],"graph":[22,28],"problem,":[23],"BRT":[24],"representation":[25],"in":[26,51],"done":[30],"by":[31],"assuming":[32],"the":[33,40,58,64,68,73,79,94,113,117,127,131,138],"stop":[35],"as":[36],"vertex":[38],"distance":[41,132],"between":[42],"stops":[44,66,85,145],"an":[46],"edge.":[47],"The":[48,90],"problem":[49],"examined":[50],"this":[52],"paper":[53],"to":[55,111,137],"find":[56,112],"out":[57],"path":[59],"passes":[61],"through":[62],"all":[63,83,143],"with":[67],"smallest":[69],"total":[70],"distance,":[71],"where":[72],"trip":[74],"starts":[75],"ends":[77],"at":[78],"same":[80],"point,":[81],"are":[86],"crossed":[87],"exactly":[88],"once.":[89],"method":[91,122],"used":[92],"Genetic":[95],"Algorithm,":[96],"which":[97],"works":[98],"using":[99],"objective":[100],"fitness":[102],"functions,":[103],"combines":[105],"selection,":[106],"crossover":[107,121],"mutation":[109],"operators":[110],"best":[114],"solution.":[115],"Using":[116],"roulette":[118],"wheel,":[119],"OX":[120],"0.07":[125],"of":[126,129,133],"probability":[128],"mutation,":[130],"traverse":[134],"departure":[139],"point":[140],"after":[141],"passing":[142],"19.66":[147],"km":[148],"or":[149],"12.22":[150],"miles.":[151]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2019-12-26T00:00:00"}