{"id":"https://openalex.org/W2981847904","doi":"https://doi.org/10.1109/icite.2019.8880254","title":"Stochastic On-time Arrival Problem with Levy Stable Distributions","display_name":"Stochastic On-time Arrival Problem with Levy Stable Distributions","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2981847904","doi":"https://doi.org/10.1109/icite.2019.8880254","mag":"2981847904"},"language":"en","primary_location":{"id":"doi:10.1109/icite.2019.8880254","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icite.2019.8880254","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 4th International Conference on Intelligent Transportation Engineering (ICITE)","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/A5073537004","display_name":"Anton Agafonov","orcid":"https://orcid.org/0000-0001-7483-7936"},"institutions":[{"id":"https://openalex.org/I3124489027","display_name":"Samara National Research University","ror":"https://ror.org/05ggagb37","country_code":"RU","type":"education","lineage":["https://openalex.org/I3124489027"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Anton Agafonov","raw_affiliation_strings":["Samara National Research University, Samara, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Samara National Research University, Samara, Russia","institution_ids":["https://openalex.org/I3124489027"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056429209","display_name":"Vladislav Myasnikov","orcid":"https://orcid.org/0000-0002-6915-8119"},"institutions":[{"id":"https://openalex.org/I3124489027","display_name":"Samara National Research University","ror":"https://ror.org/05ggagb37","country_code":"RU","type":"education","lineage":["https://openalex.org/I3124489027"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Vladislav Myasnikov","raw_affiliation_strings":["Branch of the FSRC \"Crystallography and Photonics\", Samara National Research University, Samara, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Branch of the FSRC \"Crystallography and Photonics\", Samara National Research University, Samara, Russia","institution_ids":["https://openalex.org/I3124489027"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I3124489027"],"apc_list":null,"apc_paid":null,"fwci":0.7255,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.81532103,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"227","last_page":"231"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9994000196456909,"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.9994000196456909,"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/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9993000030517578,"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/T10524","display_name":"Traffic control and management","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/l\u00e9vy-flight","display_name":"L\u00e9vy flight","score":0.7104101777076721},{"id":"https://openalex.org/keywords/samara","display_name":"Samara","score":0.6817406415939331},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6389263868331909},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5964205265045166},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5211572647094727},{"id":"https://openalex.org/keywords/probability-distribution","display_name":"Probability distribution","score":0.5138314366340637},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4969828426837921},{"id":"https://openalex.org/keywords/travel-time","display_name":"Travel time","score":0.4760468006134033},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.46723467111587524},{"id":"https://openalex.org/keywords/l\u00e9vy-distribution","display_name":"L\u00e9vy distribution","score":0.45296573638916016},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.4428221583366394},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4394156336784363},{"id":"https://openalex.org/keywords/arrival-time","display_name":"Arrival time","score":0.4282997250556946},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.42582184076309204},{"id":"https://openalex.org/keywords/stochastic-process","display_name":"Stochastic process","score":0.412430077791214},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36655277013778687},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27914732694625854},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.21826183795928955},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.15500515699386597},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11280161142349243},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09499824047088623},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08431196212768555}],"concepts":[{"id":"https://openalex.org/C118918019","wikidata":"https://www.wikidata.org/wiki/Q4114998","display_name":"L\u00e9vy flight","level":3,"score":0.7104101777076721},{"id":"https://openalex.org/C22723013","wikidata":"https://www.wikidata.org/wiki/Q475697","display_name":"Samara","level":2,"score":0.6817406415939331},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6389263868331909},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5964205265045166},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5211572647094727},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.5138314366340637},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4969828426837921},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.4760468006134033},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.46723467111587524},{"id":"https://openalex.org/C179709323","wikidata":"https://www.wikidata.org/wiki/Q1042429","display_name":"L\u00e9vy distribution","level":3,"score":0.45296573638916016},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.4428221583366394},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4394156336784363},{"id":"https://openalex.org/C3017552255","wikidata":"https://www.wikidata.org/wiki/Q4135208","display_name":"Arrival time","level":2,"score":0.4282997250556946},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.42582184076309204},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.412430077791214},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36655277013778687},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27914732694625854},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.21826183795928955},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.15500515699386597},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11280161142349243},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09499824047088623},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08431196212768555},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icite.2019.8880254","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icite.2019.8880254","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 4th International Conference on Intelligent Transportation Engineering (ICITE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1553800774","https://openalex.org/W1750087600","https://openalex.org/W1974399255","https://openalex.org/W2034204928","https://openalex.org/W2041942953","https://openalex.org/W2042022756","https://openalex.org/W2044715541","https://openalex.org/W2046236705","https://openalex.org/W2057983864","https://openalex.org/W2061159612","https://openalex.org/W2066145367","https://openalex.org/W2091253199","https://openalex.org/W2111065254","https://openalex.org/W2206463622","https://openalex.org/W2341264174","https://openalex.org/W2511448261","https://openalex.org/W2604842041","https://openalex.org/W2803638397","https://openalex.org/W2905702505","https://openalex.org/W2963283205","https://openalex.org/W3100538605","https://openalex.org/W6676846651","https://openalex.org/W6736155649"],"related_works":["https://openalex.org/W1970871823","https://openalex.org/W2391412785","https://openalex.org/W1985732996","https://openalex.org/W2469944050","https://openalex.org/W2066371783","https://openalex.org/W2169910125","https://openalex.org/W2034204928","https://openalex.org/W1968569776","https://openalex.org/W1989859352","https://openalex.org/W2981847904"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,9,14,48,55,62,66,72,88,94,102],"reliable":[4],"shortest":[5],"path":[6,103],"problem":[7],"with":[8,53,97],"following":[10],"optimality":[11],"criterion:":[12],"maximizing":[13],"probability":[15],"of":[16,43,65,71],"arriving":[17],"on":[18,75],"time":[19,26,32,64,96],"at":[20],"a":[21,24,29,76,98],"destination":[22],"within":[23],"given":[25],"budget.":[27],"As":[28],"link":[30],"travel":[31,104],"distribution,":[33],"we":[34],"propose":[35],"to":[36,85],"use":[37,42],"stable":[38,44],"Levy":[39,56],"distributions.":[40],"The":[41],"distributions":[45],"allows":[46],"replacing":[47],"computationally":[49],"complex":[50],"convolutions":[51],"calculations":[52],"recalculating":[54],"distribution":[57],"parameters,":[58],"which":[59],"significantly":[60,92],"reduces":[61],"running":[63],"algorithm.":[67],"An":[68],"experimental":[69],"analysis":[70],"algorithm":[73,90],"conducted":[74],"large-scale":[77],"road":[78],"network":[79],"in":[80,101],"Samara,":[81],"Russia":[82],"allow":[83],"us":[84],"conclude":[86],"that":[87],"proposed":[89],"can":[91],"reduce":[93],"computation":[95],"slight":[99],"increase":[100],"time.":[105]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}