{"id":"https://openalex.org/W4387608599","doi":"https://doi.org/10.15439/2023f3718","title":"List Of Pareto Optimal Solutions of a Biobjective Shortest Path Problem","display_name":"List Of Pareto Optimal Solutions of a Biobjective Shortest Path Problem","publication_year":2023,"publication_date":"2023-09-26","ids":{"openalex":"https://openalex.org/W4387608599","doi":"https://doi.org/10.15439/2023f3718"},"language":"en","primary_location":{"id":"doi:10.15439/2023f3718","is_oa":true,"landing_page_url":"http://dx.doi.org/10.15439/2023f3718","pdf_url":"https://annals-csis.org/proceedings/2023/drp/pdf/3718.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://annals-csis.org/proceedings/2023/drp/pdf/3718.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054967641","display_name":"\u041b\u0430\u0441\u043a\u043e \u041b\u0430\u0441\u043a\u043e\u0432","orcid":"https://orcid.org/0000-0003-1833-8184"},"institutions":[{"id":"https://openalex.org/I122492136","display_name":"New Bulgarian University","ror":"https://ror.org/002qhr126","country_code":"BG","type":"education","lineage":["https://openalex.org/I122492136"]}],"countries":["BG"],"is_corresponding":true,"raw_author_name":"Lasko Laskov","raw_affiliation_strings":["Informatics Department New Bulgarian University 21 Montevideo Str. , 1618 Sofia , Bulgaria","Informatics Department New Bulgarian University 21 Montevideo Str., 1618 Sofia, Bulgaria"],"affiliations":[{"raw_affiliation_string":"Informatics Department New Bulgarian University 21 Montevideo Str. , 1618 Sofia , Bulgaria","institution_ids":["https://openalex.org/I122492136"]},{"raw_affiliation_string":"Informatics Department New Bulgarian University 21 Montevideo Str., 1618 Sofia, Bulgaria","institution_ids":["https://openalex.org/I122492136"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039856906","display_name":"Marin Marinov","orcid":"https://orcid.org/0009-0003-9544-819X"},"institutions":[{"id":"https://openalex.org/I122492136","display_name":"New Bulgarian University","ror":"https://ror.org/002qhr126","country_code":"BG","type":"education","lineage":["https://openalex.org/I122492136"]}],"countries":["BG"],"is_corresponding":false,"raw_author_name":"Marin Marinov","raw_affiliation_strings":["Informatics Department New Bulgarian University 21 Montevideo Str. , 1618 Sofia , Bulgaria","Informatics Department New Bulgarian University 21 Montevideo Str., 1618 Sofia, Bulgaria"],"affiliations":[{"raw_affiliation_string":"Informatics Department New Bulgarian University 21 Montevideo Str. , 1618 Sofia , Bulgaria","institution_ids":["https://openalex.org/I122492136"]},{"raw_affiliation_string":"Informatics Department New Bulgarian University 21 Montevideo Str., 1618 Sofia, Bulgaria","institution_ids":["https://openalex.org/I122492136"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5054967641"],"corresponding_institution_ids":["https://openalex.org/I122492136"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22330097,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"35","issue":null,"first_page":"603","last_page":"613"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9254000186920166,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9254000186920166,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9039999842643738,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.6644591093063354},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6345223188400269},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5942624807357788},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5438888072967529},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.5343263745307922},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5190430283546448},{"id":"https://openalex.org/keywords/pareto-analysis","display_name":"Pareto analysis","score":0.48041796684265137},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.42450425028800964},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.4086374044418335},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.362704873085022},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3459882438182831},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11932599544525146},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.061260998249053955},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.046263158321380615}],"concepts":[{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.6644591093063354},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6345223188400269},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5942624807357788},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5438888072967529},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.5343263745307922},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5190430283546448},{"id":"https://openalex.org/C118127601","wikidata":"https://www.wikidata.org/wiki/Q3797610","display_name":"Pareto analysis","level":3,"score":0.48041796684265137},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.42450425028800964},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.4086374044418335},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.362704873085022},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3459882438182831},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11932599544525146},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.061260998249053955},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.046263158321380615}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.15439/2023f3718","is_oa":true,"landing_page_url":"http://dx.doi.org/10.15439/2023f3718","pdf_url":"https://annals-csis.org/proceedings/2023/drp/pdf/3718.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:doaj.org/article:5fb9868b6814441daddea95bfa3ebde2","is_oa":true,"landing_page_url":"https://doaj.org/article/5fb9868b6814441daddea95bfa3ebde2","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Annals of computer science and information systems, Vol 35, Pp 603-613 (2023)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.15439/2023f3718","is_oa":true,"landing_page_url":"http://dx.doi.org/10.15439/2023f3718","pdf_url":"https://annals-csis.org/proceedings/2023/drp/pdf/3718.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4387608599.pdf","grobid_xml":"https://content.openalex.org/works/W4387608599.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1527511816","https://openalex.org/W1799626923","https://openalex.org/W1968313721","https://openalex.org/W1996013403","https://openalex.org/W1998259641","https://openalex.org/W2051956023","https://openalex.org/W2055719641","https://openalex.org/W2062144253","https://openalex.org/W2068113337","https://openalex.org/W2069097579","https://openalex.org/W2071852134","https://openalex.org/W2084224084","https://openalex.org/W2099466544","https://openalex.org/W2169528473","https://openalex.org/W2909085420","https://openalex.org/W3203110969","https://openalex.org/W4245608944","https://openalex.org/W4297172865","https://openalex.org/W4298147699"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W2523719706","https://openalex.org/W2375775343","https://openalex.org/W1990043277","https://openalex.org/W2171039275","https://openalex.org/W2388654557","https://openalex.org/W2388051136","https://openalex.org/W2364137215","https://openalex.org/W2388410942"],"abstract_inverted_index":{"Many":[0],"applications":[1],"in":[2,11,43,84,95,98],"practice":[3],"involve":[4],"the":[5,44,54,60,91,96,100,109,115,127,134,137,142,145,149],"search":[6],"for":[7],"a":[8,12,77,85,105],"shortest":[9,129],"path":[10,130],"network":[13],"by":[14],"optimizing":[15],"two":[16,124],"conflicting":[17],"objective":[18,102,111],"functions.Such":[19],"problems":[20,139],"often":[21],"are":[22,37,40],"referred":[23],"to":[24,31,48,58,75],"as":[25,47,49],"biobjective":[26,92],"optimization":[27,93],"problems.Their":[28],"goal":[29],"is":[30,73,104,113,121],"find":[32,59],"special":[33],"optimal":[34,66,82],"paths":[35],"that":[36,72,132,157],"nondominated":[38],"and":[39,136,144],"also":[41],"known":[42],"specialized":[45],"literature":[46],"Pareto":[50,65,81],"optimal.While":[51],"most":[52],"of":[53,64,79,126,148],"existing":[55],"methods":[56],"aim":[57],"minimum":[61],"complete":[62],"set":[63],"paths,":[67],"we":[68,152],"propose":[69],"an":[70],"approach":[71,120],"able":[74],"generate":[76],"list":[78],"all":[80],"solutions":[83],"given":[86],"network.The":[87],"described":[88],"method":[89],"solves":[90],"problem":[94],"case":[97],"which":[99],"first":[101],"function":[103,112],"linear":[106],"(MINSUM),":[107],"while":[108],"second":[110],"from":[114],"\"bottleneck\"":[116],"type":[117],"(MAXMIN).The":[118],"presented":[119,150],"based":[122],"on":[123],"modifications":[125],"Dijkstra's":[128],"algorithm":[131],"solve":[133],"MINSUM":[135],"MAXMIN":[138],"respectively.We":[140],"prove":[141],"correctness":[143],"computational":[146],"complexity":[147],"algorithms.Also,":[151],"provide":[153],"detailed":[154],"numerical":[155],"examples":[156],"illustrate":[158],"their":[159],"execution.":[160]},"counts_by_year":[],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}