{"id":"https://openalex.org/W2122397617","doi":null,"title":"A GENETIC ALGORITHM BASED BUS SCHEDULING MODEL FOR TRANSIT NETWORK","display_name":"A GENETIC ALGORITHM BASED BUS SCHEDULING MODEL FOR TRANSIT NETWORK","publication_year":2008,"publication_date":"2008-04-02","ids":{"openalex":"https://openalex.org/W2122397617","mag":"2122397617"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.97.4945","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.4945","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.easts.info/on-line/proceedings_05/477.pdf","raw_type":"text"},"volume":null,"type":"article","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/A5086683073","display_name":"Farhan Ahmad Kidwai","orcid":"https://orcid.org/0000-0002-9910-3151","observed_orcids":["https://orcid.org/0000-0002-9910-3151"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Farhan Ahmad Kidwai","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088394271","display_name":"Kalyanmoy Deb","orcid":"https://orcid.org/0000-0001-7402-9939","observed_orcids":["https://orcid.org/0000-0001-7402-9939"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kalyanmoy Deb","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015011122","display_name":"Baldev Raj Marwah","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Baldev Raj Marwah","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Mohamed Rehan Karim","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mohamed Rehan Karim","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":3.2313,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.92867084,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9887999892234802,"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"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9887999892234802,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.0044999998062849045,"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/T11568","display_name":"Railway Systems and Energy Efficiency","score":0.001500000013038516,"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-scheduling","display_name":"bus scheduling","score":0.9990000128746033},{"id":"https://openalex.org/keywords/transit-network-design","display_name":"transit network design","score":0.9100000262260437},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.7039999961853027},{"id":"https://openalex.org/keywords/origin-destination-matrix","display_name":"origin-destination matrix","score":0.6819999814033508},{"id":"https://openalex.org/keywords/bi-level-optimization","display_name":"bi-level optimization","score":0.6399999856948853}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7210096120834351},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.629012942314148},{"id":"https://openalex.org/C54609922","wikidata":"https://www.wikidata.org/wiki/Q748329","display_name":"Bus network","level":4,"score":0.5477806329727173},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48726072907447815},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.48045533895492554},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4284907579421997},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1886041760444641},{"id":"https://openalex.org/C136321198","wikidata":"https://www.wikidata.org/wiki/Q2377054","display_name":"System bus","level":2,"score":0.14862671494483948},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.1396043598651886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12842506170272827},{"id":"https://openalex.org/C203315745","wikidata":"https://www.wikidata.org/wiki/Q2235486","display_name":"Control bus","level":3,"score":0.08068925142288208},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","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}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.97.4945","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.4945","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.easts.info/on-line/proceedings_05/477.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.7250000238418579,"display_name":"Sustainable cities and communities"},{"id":"https://metadata.un.org/sdg/9","score":0.5378999710083008,"display_name":"Industry, innovation and infrastructure"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W144243368","https://openalex.org/W564016209","https://openalex.org/W590759196","https://openalex.org/W1053291086","https://openalex.org/W1487353904","https://openalex.org/W1549154326","https://openalex.org/W1571075676","https://openalex.org/W1905078637","https://openalex.org/W1968085361","https://openalex.org/W1973178321","https://openalex.org/W1994228752","https://openalex.org/W2010327686","https://openalex.org/W2011098608","https://openalex.org/W2017880525","https://openalex.org/W2018788809","https://openalex.org/W2029763098","https://openalex.org/W2030983191","https://openalex.org/W2048037900","https://openalex.org/W2061768693","https://openalex.org/W2083005814","https://openalex.org/W2578415499","https://openalex.org/W2582417771","https://openalex.org/W3023540311"],"related_works":["https://openalex.org/W7097300628","https://openalex.org/W1556507522","https://openalex.org/W2146193222","https://openalex.org/W2354621223","https://openalex.org/W2120579647","https://openalex.org/W836205767","https://openalex.org/W2122511247","https://openalex.org/W1968085361","https://openalex.org/W811556651","https://openalex.org/W2547266690"],"abstract_inverted_index":{"Abstract:":[0],"In":[1,83,108],"this":[2],"paper":[3],"we":[4],"present":[5],"an":[6],"optimization":[7],"model":[8,13,138],"for":[9,25,49,53],"bus":[10,51,58,75],"scheduling.":[11],"This":[12],"constitutes":[14],"one":[15],"of":[16,21,34,89,98,115],"the":[17,27,40,45,50,56,62,69,84,96,109,112],"three":[18],"major":[19],"components":[20],"a":[22,142],"solution":[23],"approach":[24],"solving":[26],"transit":[28],"network":[29,59],"design":[30,54],"problem.":[31],"The":[32,74,137],"problem":[33,77],"scheduling":[35,76],"can":[36],"be":[37],"defined":[38],"in":[39,80],"following":[41],"general":[42],"terms:":[43],"Given":[44],"origin":[46],"destination":[47],"matrix":[48],"trips":[52],"period,":[55],"underlying":[57],"characterized":[60],"by":[61,103,129],"overlapping":[63],"routes,":[64],"how":[65],"optimally":[66],"to":[67,141],"allocate":[68],"buses":[70,90],"among":[71],"these":[72],"routes?":[73],"is":[78,101,118,126,139],"solved":[79],"two":[81],"levels.":[82],"first":[85,116],"level,":[86,111],"minimum":[87],"frequency":[88],"required":[91],"on":[92],"each":[93,105],"route,":[94],"with":[95],"guarantee":[97],"load":[99],"feasibility,":[100],"determined":[102],"considering":[104,130],"route":[106],"individually.":[107],"second":[110],"fleet":[113,124],"size":[114,125],"level":[117],"taken":[119],"as":[120],"upper":[121],"bound":[122],"and":[123,134,145],"again":[127],"minimized":[128],"all":[131],"routes":[132],"together":[133],"using":[135],"GAs.":[136],"applied":[140],"real":[143],"network,":[144],"results":[146],"are":[147],"presented.":[148]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2025-10-27T00:00:00"}