{"id":"https://openalex.org/W7225787540","doi":"https://doi.org/10.37373/tekno.v14i1.2062","title":"Optimization of Student Public Transportation Routes Using the Particle Swarm Optimization","display_name":"Optimization of Student Public Transportation Routes Using the Particle Swarm Optimization","publication_year":2026,"publication_date":"2026-11-12","ids":{"openalex":"https://openalex.org/W7225787540","doi":"https://doi.org/10.37373/tekno.v14i1.2062"},"language":"en","primary_location":{"id":"doi:10.37373/tekno.v14i1.2062","doi":"https://doi.org/10.37373/tekno.v14i1.2062","is_oa":true,"landing_page_url":"https://doi.org/10.37373/tekno.v14i1.2062","pdf_url":null,"source":{"id":"https://openalex.org/S4210181198","display_name":"TEKNOSAINS Jurnal Sains Teknologi dan Informatika","issn_l":"2087-3336","issn":["2087-3336","2721-4729"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"TEKNOSAINS : Jurnal Sains, Teknologi dan Informatika","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.37373/tekno.v14i1.2062","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5161481744","display_name":"Revalina Ayu Lestari","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Revalina Ayu Lestari","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038830568","display_name":"Sisca Octarina","orcid":"https://orcid.org/0000-0003-3220-3809","observed_orcids":["https://orcid.org/0000-0003-3220-3809"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sisca Octarina","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5006759550","display_name":"Fitri Maya Puspita","orcid":"https://orcid.org/0000-0003-2251-6991","observed_orcids":["https://orcid.org/0000-0003-2251-6991"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fitri Maya Puspita","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":"1","first_page":"121","last_page":"128"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.5776000022888184,"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.5776000022888184,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.38940000534057617,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.017000000923871994,"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"}}],"keywords":[],"concepts":[{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.6901000142097473},{"id":"https://openalex.org/C2778869765","wikidata":"https://www.wikidata.org/wiki/Q6028363","display_name":"Inefficiency","level":2,"score":0.6197999715805054},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6011000275611877},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5730999708175659},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5698000192642212},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5468000173568726},{"id":"https://openalex.org/C539828613","wikidata":"https://www.wikidata.org/wiki/Q178512","display_name":"Public transport","level":2,"score":0.5457000136375427},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.4269999861717224},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.3840000033378601},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.3395000100135803},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.33410000801086426},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.31299999356269836},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.2987000048160553},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.2955999970436096},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.29420000314712524},{"id":"https://openalex.org/C2780968500","wikidata":"https://www.wikidata.org/wiki/Q25304881","display_name":"Simulation-based optimization","level":2,"score":0.27880001068115234},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.25589999556541443},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.2556000053882599},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.2551000118255615}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37373/tekno.v14i1.2062","doi":"https://doi.org/10.37373/tekno.v14i1.2062","is_oa":true,"landing_page_url":"https://doi.org/10.37373/tekno.v14i1.2062","pdf_url":null,"source":{"id":"https://openalex.org/S4210181198","display_name":"TEKNOSAINS Jurnal Sains Teknologi dan Informatika","issn_l":"2087-3336","issn":["2087-3336","2721-4729"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"TEKNOSAINS : Jurnal Sains, Teknologi dan Informatika","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37373/tekno.v14i1.2062","doi":"https://doi.org/10.37373/tekno.v14i1.2062","is_oa":true,"landing_page_url":"https://doi.org/10.37373/tekno.v14i1.2062","pdf_url":null,"source":{"id":"https://openalex.org/S4210181198","display_name":"TEKNOSAINS Jurnal Sains Teknologi dan Informatika","issn_l":"2087-3336","issn":["2087-3336","2721-4729"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"TEKNOSAINS : Jurnal Sains, Teknologi dan Informatika","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Student":[0],"public":[1],"transportation":[2,20,80,106],"often":[3],"experiences":[4],"inefficiency":[5],"due":[6],"to":[7,15,35,88,134],"suboptimal":[8],"routes":[9,21,64],"and":[10,22,39,45,62,65,127,181],"schedules.":[11,67],"This":[12,31,68],"study":[13,69],"aims":[14],"determine":[16],"more":[17,60,104,136,171],"efficient":[18,63],"student":[19,79,178],"schedules":[23],"using":[24],"the":[25,111,144],"Particle":[26],"Swarm":[27],"Optimization":[28],"(PSO)":[29],"method.":[30],"method":[32],"is":[33,73,87,115,169],"applied":[34],"minimize":[36],"travel":[37],"time":[38],"distance":[40],"while":[41,154],"considering":[42],"fleet":[43,183],"capacity":[44],"operational":[46,119],"constraints.":[47],"Simulation":[48],"results":[49],"show":[50],"that":[51,71,94,147],"PSO":[52,72,142],"can":[53,95,150],"significantly":[54],"improve":[55],"objective":[56],"values,":[57],"resulting":[58],"in":[59,143,161],"organized":[61],"departure":[66,123,166],"concludes":[70],"an":[74,159],"effective":[75],"optimization":[76,92,112],"approach":[77],"for":[78,101],"planning.":[81],"The":[82,139,165],"contribution":[83],"of":[84,117,141],"this":[85,148],"research":[86],"provide":[89],"a":[90,99,103],"computational":[91],"model":[93,113],"be":[96],"used":[97],"as":[98,122],"basis":[100],"developing":[102],"adaptive":[105],"scheduling":[107],"system.":[108],"In":[109],"addition,":[110],"developed":[114],"capable":[116],"integrating":[118],"variables":[120],"such":[121],"sequence,":[124],"passenger":[125,128],"readiness,":[126],"distribution":[129],"patterns":[130],"on":[131],"each":[132],"bus":[133],"produce":[135],"realistic":[137],"solutions.":[138],"application":[140],"simulation":[145],"shows":[146],"algorithm":[149],"eliminate":[151],"hard":[152],"constraints":[153],"reducing":[155,177],"soft":[156],"constraints,":[157],"reflecting":[158],"increase":[160],"overall":[162],"system":[163],"efficiency.":[164],"schedule":[167],"obtained":[168],"also":[170],"stable":[172],"with":[173],"consistent":[174],"headways,":[175],"thereby":[176],"waiting":[179],"times":[180],"increasing":[182],"utilization.":[184]},"counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2026-11-12T00:00:00"}