{"id":"https://openalex.org/W2604217879","doi":"https://doi.org/10.1504/ijbic.2017.10004333","title":"Using the metaheuristic methods for real-time optimization of dynamic school bus routing problem and an application","display_name":"Using the metaheuristic methods for real-time optimization of dynamic school bus routing problem and an application","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2604217879","doi":"https://doi.org/10.1504/ijbic.2017.10004333","mag":"2604217879"},"language":"en","primary_location":{"id":"doi:10.1504/ijbic.2017.10004333","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijbic.2017.10004333","pdf_url":null,"source":{"id":"https://openalex.org/S121342672","display_name":"International Journal of Bio-Inspired Computation","issn_l":"1758-0366","issn":["1758-0366","1758-0374"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Bio-Inspired Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5090432015","display_name":"\u00d6zkan \u00dcNSAL","orcid":"https://orcid.org/0000-0002-6741-7826"},"institutions":[{"id":"https://openalex.org/I175124709","display_name":"S\u00fcleyman Demirel University","ror":"https://ror.org/04fjtte88","country_code":"TR","type":"education","lineage":["https://openalex.org/I175124709"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Ozkan Unsal","raw_affiliation_strings":["Department of Computer Engineering, Suleyman Demirel University, Isparta 32260, Turkey"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Suleyman Demirel University, Isparta 32260, Turkey","institution_ids":["https://openalex.org/I175124709"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063572421","display_name":"Tuncay Yi\u0307\u011fi\u0307t","orcid":"https://orcid.org/0000-0001-7397-7224"},"institutions":[{"id":"https://openalex.org/I175124709","display_name":"S\u00fcleyman Demirel University","ror":"https://ror.org/04fjtte88","country_code":"TR","type":"education","lineage":["https://openalex.org/I175124709"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Tuncay Yigit","raw_affiliation_strings":["Department of Computer Engineering, Suleyman Demirel University, Isparta 32260, Turkey"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Suleyman Demirel University, Isparta 32260, Turkey","institution_ids":["https://openalex.org/I175124709"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050042995","display_name":"\u00d6mer Deperlio\u011flu","orcid":"https://orcid.org/0000-0002-7241-5219"},"institutions":[{"id":"https://openalex.org/I52407163","display_name":"Afyon Kocatepe University","ror":"https://ror.org/03a1crh56","country_code":"TR","type":"education","lineage":["https://openalex.org/I52407163"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Omer Deperlioglu","raw_affiliation_strings":["Department of Computer Technologies, Afyon Kocatepe University, Afyonkarahisar 03200, Turkey"],"affiliations":[{"raw_affiliation_string":"Department of Computer Technologies, Afyon Kocatepe University, Afyonkarahisar 03200, Turkey","institution_ids":["https://openalex.org/I52407163"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5090432015"],"corresponding_institution_ids":["https://openalex.org/I175124709"],"apc_list":null,"apc_paid":null,"fwci":0.6022,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72594683,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"10","issue":"2","first_page":"1","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9868000149726868,"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.9868000149726868,"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.9758999943733215,"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/T12306","display_name":"Urban and Freight Transport Logistics","score":0.9549999833106995,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.8796334266662598},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7889097332954407},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.7438198328018188},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6447117328643799},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6134568452835083},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6132057905197144},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.6020464897155762},{"id":"https://openalex.org/keywords/school-bus","display_name":"School bus","score":0.5592432618141174},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5569987893104553},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5408312678337097},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.43299269676208496},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2812924385070801},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.19404128193855286},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.176317036151886},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.1507279872894287},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14582189917564392},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.1450153887271881},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1301306188106537},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.1152302622795105}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.8796334266662598},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7889097332954407},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.7438198328018188},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6447117328643799},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6134568452835083},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6132057905197144},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.6020464897155762},{"id":"https://openalex.org/C3018142482","wikidata":"https://www.wikidata.org/wiki/Q58678","display_name":"School bus","level":2,"score":0.5592432618141174},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5569987893104553},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5408312678337097},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.43299269676208496},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2812924385070801},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.19404128193855286},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.176317036151886},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.1507279872894287},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14582189917564392},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1450153887271881},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1301306188106537},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.1152302622795105}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1504/ijbic.2017.10004333","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijbic.2017.10004333","pdf_url":null,"source":{"id":"https://openalex.org/S121342672","display_name":"International Journal of Bio-Inspired Computation","issn_l":"1758-0366","issn":["1758-0366","1758-0374"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Bio-Inspired Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2070079705","https://openalex.org/W2900531744","https://openalex.org/W2162125251","https://openalex.org/W1588949866","https://openalex.org/W2394153495","https://openalex.org/W2388217074","https://openalex.org/W4252214543","https://openalex.org/W4299796063","https://openalex.org/W2358084676","https://openalex.org/W2161129389"],"abstract_inverted_index":{"The":[0,22,107],"vehicle":[1],"routing":[2,98],"problem":[3,99],"(VRP)":[4],"is":[5],"an":[6],"optimisation":[7,23,81],"issue":[8],"that":[9,55,144],"has":[10],"been":[11],"studied":[12],"for":[13,45,93,117],"more":[14,61],"than":[15],"50":[16],"years":[17],"with":[18],"its":[19],"numerous":[20],"subfields.":[21],"of":[24,48,102,105,120,127,132,149,152],"VRP":[25],"over":[26],"distribution":[27],"and":[28,37,51,83,109,129,146],"transportation":[29],"systems":[30],"leads":[31],"to":[32,59,65],"significant":[33],"gains":[34],"in":[35,124],"cost":[36],"time.":[38],"There":[39],"are":[40,88],"many":[41],"metaheuristic":[42,56,91],"methods":[43,57,92,111,134],"developed":[44,77],"the":[46,49,90,94,103,115,125,130,138,150],"solution":[47],"problem;":[50],"it":[52],"was":[53,76,142],"observed":[54,143],"prove":[58],"produce":[60],"successful":[62],"results":[63],"compared":[64,136],"common":[66],"heuristic":[67],"methods.":[68,163],"In":[69],"this":[70],"study,":[71],"a":[72,121],"mobile-supported":[73],"visual":[74],"application":[75,116],"using":[78],"ant":[79],"colony":[80],"(ACO)":[82],"genetic":[84],"algorithm":[85],"(GA),":[86],"which":[87],"among":[89],"dynamic":[95],"school":[96,122,154],"bus":[97,118,155],"(DSBRP),":[100],"one":[101],"sub-problems":[104],"VRP.":[106],"ACO":[108],"GA":[110],"were":[112,135],"utilised":[113],"via":[114],"routes":[119,151,156],"located":[123],"province":[126],"Ankara":[128],"performance":[131],"these":[133,161],"through":[137],"obtained":[139],"results.":[140],"It":[141],"time":[145],"distance":[147],"values":[148],"current":[153],"may":[157],"be":[158],"improved":[159],"by":[160],"two":[162]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
