{"id":"https://openalex.org/W2280942500","doi":null,"title":"TRANSIT ASSIGNMENT TO MINIMAL ROUTES: AN EFFICIENT NEW ALGORITHM","display_name":"TRANSIT ASSIGNMENT TO MINIMAL ROUTES: AN EFFICIENT NEW ALGORITHM","publication_year":1988,"publication_date":"1988-01-01","ids":{"openalex":"https://openalex.org/W2280942500","mag":"2280942500"},"language":"en","primary_location":{"id":"mag:2280942500","doi":null,"is_oa":false,"landing_page_url":"https://trid.trb.org/view/320479","pdf_url":null,"source":{"id":"https://openalex.org/S2764920755","display_name":"Traffic engineering & control","issn_l":"0041-0683","issn":["0041-0683"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core"],"host_organization":"https://openalex.org/P4324263006","host_organization_name":"Hemming Group","host_organization_lineage":["https://openalex.org/P4324263006"],"host_organization_lineage_names":["Hemming Group"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Traffic engineering & control","raw_type":null},"volume":null,"type":"article","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"John Andrews","orcid":"https://orcid.org/0000-0002-2316-3959","observed_orcids":["https://orcid.org/0000-0002-2316-3959"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"John Andrews","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-2316-3959","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5141813806","display_name":"J E Fernandez Larranaga","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J E Fernandez Larranaga","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":57,"citation_normalized_percentile":{"value":0.60429963,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":"30","issue":"10","first_page":"491","last_page":"494"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9961000084877014,"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.9961000084877014,"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.000699999975040555,"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.00039999998989515007,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/transit-assignment","display_name":"transit assignment","score":0.9900000095367432},{"id":"https://openalex.org/keywords/assignment-algorithm","display_name":"assignment algorithm","score":0.5649999976158142},{"id":"https://openalex.org/keywords/execution-time-reduction","display_name":"execution time reduction","score":0.6499999761581421}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6622000336647034},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6195535659790039},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5494385361671448},{"id":"https://openalex.org/C2778022998","wikidata":"https://www.wikidata.org/wiki/Q651136","display_name":"Transit (satellite)","level":3,"score":0.47380417585372925},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45643484592437744},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.41635510325431824},{"id":"https://openalex.org/C539828613","wikidata":"https://www.wikidata.org/wiki/Q178512","display_name":"Public transport","level":2,"score":0.29402589797973633},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.2535448670387268},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.22619536519050598},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20339012145996094}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:2280942500","doi":null,"is_oa":false,"landing_page_url":"https://trid.trb.org/view/320479","pdf_url":null,"source":{"id":"https://openalex.org/S2764920755","display_name":"Traffic engineering & control","issn_l":"0041-0683","issn":["0041-0683"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core"],"host_organization":"https://openalex.org/P4324263006","host_organization_name":"Hemming Group","host_organization_lineage":["https://openalex.org/P4324263006"],"host_organization_lineage_names":["Hemming Group"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Traffic engineering & control","raw_type":null},{"id":"mag:563820394","doi":null,"is_oa":false,"landing_page_url":"https://trid.trb.org/view/314298","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7646999955177307},{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.7207000255584717}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2210615372","https://openalex.org/W582856805","https://openalex.org/W1915531310","https://openalex.org/W579055739","https://openalex.org/W2373438235","https://openalex.org/W167678968","https://openalex.org/W2079437811","https://openalex.org/W2956708628","https://openalex.org/W2387990561","https://openalex.org/W45924893"],"abstract_inverted_index":{"The":[0],"mathematical":[1],"formulation":[2],"of":[3],"the":[4,23,29],"transit":[5],"assignment":[6],"problem":[7],"to":[8],"minimal":[9],"routes":[10],"is":[11,18],"presented.":[12],"Then,":[13],"an":[14],"efficient":[15],"solution":[16],"algorithm":[17,34],"derived":[19],"which":[20],"dramatically":[21],"reduces":[22],"execution":[24],"time":[25],"when":[26],"compared":[27],"with":[28],"traditional":[30],"Chriqui":[31],"and":[32,35],"Robillard's":[33],"its":[36],"heuristic":[37],"simplifications":[38]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2016-06-24T00:00:00"}