{"id":"https://openalex.org/W4230916931","doi":"https://doi.org/10.1109/wsc.2013.6721580","title":"Simple and fast trip generation for large scale traffic simulation","display_name":"Simple and fast trip generation for large scale traffic simulation","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W4230916931","doi":"https://doi.org/10.1109/wsc.2013.6721580"},"language":"en","primary_location":{"id":"doi:10.1109/wsc.2013.6721580","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wsc.2013.6721580","pdf_url":null,"source":{"id":"https://openalex.org/S4363607809","display_name":"2013 Winter Simulations Conference (WSC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Winter Simulations Conference (WSC)","raw_type":"proceedings-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/A5024594245","display_name":"Takashi Imamichi","orcid":"https://orcid.org/0000-0002-4423-6897"},"institutions":[{"id":"https://openalex.org/I4210145865","display_name":"IBM Research - Tokyo","ror":"https://ror.org/04915qk43","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115","https://openalex.org/I4210145865"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Takashi Imamichi","raw_affiliation_strings":["NBF Toyosu Canal Front, IBM Research - Tokyo, Koto-ku, Tokyo, JAPAN"],"affiliations":[{"raw_affiliation_string":"NBF Toyosu Canal Front, IBM Research - Tokyo, Koto-ku, Tokyo, JAPAN","institution_ids":["https://openalex.org/I4210145865"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028489255","display_name":"Rudy Raymond","orcid":"https://orcid.org/0000-0003-1005-6705"},"institutions":[{"id":"https://openalex.org/I4210145865","display_name":"IBM Research - Tokyo","ror":"https://ror.org/04915qk43","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115","https://openalex.org/I4210145865"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Rudy Raymond","raw_affiliation_strings":["NBF Toyosu Canal Front, IBM Research - Tokyo, Koto-ku, Tokyo, JAPAN"],"affiliations":[{"raw_affiliation_string":"NBF Toyosu Canal Front, IBM Research - Tokyo, Koto-ku, Tokyo, JAPAN","institution_ids":["https://openalex.org/I4210145865"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5024594245"],"corresponding_institution_ids":["https://openalex.org/I4210145865"],"apc_list":null,"apc_paid":null,"fwci":1.461,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.80503145,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2020","last_page":"2031"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9976000189781189,"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"}},"topics":[{"id":"https://openalex.org/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9976000189781189,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7210001945495605},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.6638479232788086},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.6383646726608276},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.6296596527099609},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6132507920265198},{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.5809801816940308},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5562795400619507},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5006022453308105},{"id":"https://openalex.org/keywords/trips-architecture","display_name":"TRIPS architecture","score":0.4764692783355713},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.4755546748638153},{"id":"https://openalex.org/keywords/granularity","display_name":"Granularity","score":0.47151175141334534},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4645639955997467},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4524293839931488},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.42113423347473145},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3819275498390198},{"id":"https://openalex.org/keywords/simulation","display_name":"Simulation","score":0.32881057262420654},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.1969371736049652},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18364635109901428},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18356743454933167},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.170437753200531},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.12619972229003906},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10504597425460815},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.07671698927879333},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07545804977416992}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7210001945495605},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.6638479232788086},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.6383646726608276},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.6296596527099609},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6132507920265198},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.5809801816940308},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5562795400619507},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5006022453308105},{"id":"https://openalex.org/C157085824","wikidata":"https://www.wikidata.org/wiki/Q2384809","display_name":"TRIPS architecture","level":2,"score":0.4764692783355713},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.4755546748638153},{"id":"https://openalex.org/C177774035","wikidata":"https://www.wikidata.org/wiki/Q1246948","display_name":"Granularity","level":2,"score":0.47151175141334534},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4645639955997467},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4524293839931488},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.42113423347473145},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3819275498390198},{"id":"https://openalex.org/C44154836","wikidata":"https://www.wikidata.org/wiki/Q45045","display_name":"Simulation","level":1,"score":0.32881057262420654},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.1969371736049652},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18364635109901428},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18356743454933167},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.170437753200531},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.12619972229003906},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10504597425460815},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.07671698927879333},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07545804977416992},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wsc.2013.6721580","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wsc.2013.6721580","pdf_url":null,"source":{"id":"https://openalex.org/S4363607809","display_name":"2013 Winter Simulations Conference (WSC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Winter Simulations Conference (WSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W24067677","https://openalex.org/W103126581","https://openalex.org/W1737218284","https://openalex.org/W1969483458","https://openalex.org/W2005440600","https://openalex.org/W2014889099","https://openalex.org/W2031585137","https://openalex.org/W2031674781","https://openalex.org/W2072431653","https://openalex.org/W2083019227","https://openalex.org/W2084224084","https://openalex.org/W2112513979","https://openalex.org/W2148831787","https://openalex.org/W2169528473","https://openalex.org/W2172041433","https://openalex.org/W2172133238","https://openalex.org/W3142418532","https://openalex.org/W4246566791","https://openalex.org/W6600981286","https://openalex.org/W6604322208","https://openalex.org/W6637947321","https://openalex.org/W6654186649","https://openalex.org/W6685357131"],"related_works":["https://openalex.org/W2366394613","https://openalex.org/W2152421698","https://openalex.org/W3139820740","https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W143403600","https://openalex.org/W2761711678","https://openalex.org/W3180973535","https://openalex.org/W2170980056","https://openalex.org/W2886722595"],"abstract_inverted_index":{"A":[0],"large-scale":[1],"traffic":[2,141],"simulator":[3],"with":[4],"microscopic":[5],"model":[6],"requires":[7],"trip":[8,20],"generation":[9,21],"for":[10],"millions":[11],"of":[12,26,30,39,54,81,122,128],"vehicles.":[13],"To":[14],"achieve":[15],"a":[16,24,58],"realistic":[17],"result,":[18],"the":[19,37,52,82,94,102,109,120,123,126,145],"should":[22],"provide":[23],"variety":[25],"trips":[27,90,131],"between":[28],"pairs":[29],"locations":[31],"from":[32,51,74,140],"Origin-Destination":[33],"(OD)":[34],"table":[35,84],"reflecting":[36],"choices":[38,53],"drivers.":[40,55],"Shortest":[41],"paths":[42],"take":[43],"long":[44],"time":[45],"to":[46],"generate":[47],"and":[48,60,87],"often":[49],"differ":[50,138],"We":[56,112],"propose":[57],"simple":[59],"fast":[61],"tree-based":[62,103],"algorithm":[63,68,104,135],"in":[64,78,144],"this":[65],"paper.":[66],"Our":[67],"mixes":[69],"shortest":[70,96],"path":[71,97],"trees":[72],"starting":[73],"some":[75],"location":[76],"nodes":[77],"each":[79],"subarea":[80],"OD":[83,124],"as":[85],"preprocessing":[86],"then":[88],"generates":[89],"by":[91,133],"probabilistically":[92],"traversing":[93],"mixed":[95],"trees.":[98],"Experiments":[99],"reveal":[100],"that":[101],"runs":[105],"much":[106,139],"faster":[107],"than":[108],"naive":[110],"one.":[111],"also":[113],"confirm":[114],"that,":[115],"under":[116],"certain":[117],"conditions":[118,142],"on":[119],"granularity":[121],"table,":[125],"results":[127],"simulation":[129],"using":[130],"generated":[132],"our":[134],"do":[136],"not":[137],"observed":[143],"real":[146],"world.":[147]},"counts_by_year":[{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}