{"id":"https://openalex.org/W1971732610","doi":"https://doi.org/10.1002/net.3230170302","title":"A quasi\u2010assignment algorithm for bus scheduling","display_name":"A quasi\u2010assignment algorithm for bus scheduling","publication_year":1987,"publication_date":"1987-01-01","ids":{"openalex":"https://openalex.org/W1971732610","doi":"https://doi.org/10.1002/net.3230170302","mag":"1971732610"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230170302","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230170302","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5073861556","display_name":"Jos\u00e9 M. P. Paix\u00e3o","orcid":"https://orcid.org/0000-0002-1399-0934"},"institutions":[{"id":"https://openalex.org/I141596103","display_name":"University of Lisbon","ror":"https://ror.org/01c27hj86","country_code":"PT","type":"education","lineage":["https://openalex.org/I141596103"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"J. Pinto Paix\u00e3o","raw_affiliation_strings":["DEIOC, Faculdade de Cie\u030cncias de Lisboa, Av. 24 de Julho, 134\u201350, 1300 Lisboa, Portugal","DEIOC, Faculdade de Ci\u011bncias de Lisboa, Av. 24 de Julho, 134\u201350, 1300 Lisboa, Portugal"],"affiliations":[{"raw_affiliation_string":"DEIOC, Faculdade de Cie\u030cncias de Lisboa, Av. 24 de Julho, 134\u201350, 1300 Lisboa, Portugal","institution_ids":["https://openalex.org/I141596103"]},{"raw_affiliation_string":"DEIOC, Faculdade de Ci\u011bncias de Lisboa, Av. 24 de Julho, 134\u201350, 1300 Lisboa, Portugal","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072513470","display_name":"Isabel Branco","orcid":null},"institutions":[{"id":"https://openalex.org/I141596103","display_name":"University of Lisbon","ror":"https://ror.org/01c27hj86","country_code":"PT","type":"education","lineage":["https://openalex.org/I141596103"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"I. M. Branco","raw_affiliation_strings":["DEIOC, Faculdade de Cie\u030cncias de Lisboa, Av. 24 de Julho, 134\u201350, 1300 Lisboa, Portugal","DEIOC, Faculdade de Ci\u011bncias de Lisboa, Av. 24 de Julho, 134\u201350, 1300 Lisboa, Portugal"],"affiliations":[{"raw_affiliation_string":"DEIOC, Faculdade de Cie\u030cncias de Lisboa, Av. 24 de Julho, 134\u201350, 1300 Lisboa, Portugal","institution_ids":["https://openalex.org/I141596103"]},{"raw_affiliation_string":"DEIOC, Faculdade de Ci\u011bncias de Lisboa, Av. 24 de Julho, 134\u201350, 1300 Lisboa, Portugal","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073861556"],"corresponding_institution_ids":["https://openalex.org/I141596103"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":3.4775,"has_fulltext":false,"cited_by_count":52,"citation_normalized_percentile":{"value":0.91147264,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"17","issue":"3","first_page":"249","last_page":"269"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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.9991999864578247,"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/computer-science","display_name":"Computer science","score":0.705362856388092},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6489633321762085},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5477409362792969},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.5141785144805908},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46038153767585754},{"id":"https://openalex.org/keywords/trips-architecture","display_name":"TRIPS architecture","score":0.41320890188217163},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.19650721549987793},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19325634837150574}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.705362856388092},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6489633321762085},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5477409362792969},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.5141785144805908},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46038153767585754},{"id":"https://openalex.org/C157085824","wikidata":"https://www.wikidata.org/wiki/Q2384809","display_name":"TRIPS architecture","level":2,"score":0.41320890188217163},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.19650721549987793},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19325634837150574}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230170302","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230170302","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8399999737739563,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W635283305","https://openalex.org/W1594308867","https://openalex.org/W1965959022","https://openalex.org/W1978576965","https://openalex.org/W2045690085","https://openalex.org/W2089845419","https://openalex.org/W4252068365"],"related_works":["https://openalex.org/W2807758032","https://openalex.org/W4224254130","https://openalex.org/W2152103536","https://openalex.org/W2107643127","https://openalex.org/W413879896","https://openalex.org/W3135827297","https://openalex.org/W3205006318","https://openalex.org/W3088340659","https://openalex.org/W2975379457","https://openalex.org/W1093811743"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"new":[2],"and":[3,33,40,53,71,113],"much":[4],"faster":[5],"algorithm":[6,107],"is":[7,43,103],"presented":[8],"for":[9,124,151],"the":[10,36,83,99,110,118,121,125,132,138,142],"problem":[11,62,70],"of":[12,19,48,117,120,141],"assigning":[13],"buses":[14],"to":[15,45,58,97],"a":[16,41,68],"large":[17],"number":[18],"short":[20],"trips":[21,27],"in":[22,88,137,146],"an":[23,75,106],"urban":[24],"area.":[25],"The":[26],"are":[28,57,135,149],"grouped":[29],"into":[30],"chains,":[31],"beginning":[32],"ending":[34],"at":[35],"same":[37],"bus":[38,126],"depot,":[39],"vehicle":[42],"assigned":[44],"each":[46],"one":[47],"them.":[49],"Fleet":[50],"size":[51],"costs":[52],"dead":[54],"heading":[55],"time":[56,148],"be":[59],"minimized.":[60],"This":[61,102],"has":[63],"been":[64],"already":[65],"formulated":[66],"as":[67,74,82],"transportation":[69],"more":[72],"recently,":[73],"assignment":[76,122],"model.":[77],"However,":[78],"some":[79],"difficulties,":[80],"such":[81],"zero":[84],"pivot":[85],"phenomenon,":[86],"rising":[87],"many":[89],"practical":[90],"cases":[91],"drastically":[92],"affected":[93],"computing":[94,147],"times":[95],"required":[96],"obtain":[98],"optimal":[100],"solution.":[101],"overcome":[104],"by":[105],"based":[108],"on":[109],"hungarian":[111],"method":[112],"making":[114],"full":[115],"use":[116],"sparsity":[119],"matrix":[123],"scheduling":[127],"problem.":[128],"Computational":[129],"results":[130],"comparing":[131],"different":[133],"methods":[134],"given":[136],"last":[139],"section":[140],"paper.":[143],"Significant":[144],"reductions":[145],"obtained":[150],"either":[152],"real":[153],"case":[154],"applications":[155],"or":[156],"random":[157],"generated":[158],"test":[159],"problems.":[160]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}