{"id":"https://openalex.org/W7129339887","doi":"https://doi.org/10.1155/acis/4490913","title":"Optimizing the Shortest and Safety Pathways in Infectious Disease Context via the Novel Dhouib\u2010Matrix\u2010SPP Method","display_name":"Optimizing the Shortest and Safety Pathways in Infectious Disease Context via the Novel Dhouib\u2010Matrix\u2010SPP Method","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7129339887","doi":"https://doi.org/10.1155/acis/4490913"},"language":"en","primary_location":{"id":"doi:10.1155/acis/4490913","is_oa":true,"landing_page_url":"https://doi.org/10.1155/acis/4490913","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1155/acis/4490913","source":{"id":"https://openalex.org/S30680879","display_name":"Applied Computational Intelligence and Soft Computing","issn_l":"1687-9724","issn":["1687-9724","1687-9732"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Computational Intelligence and Soft Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1155/acis/4490913","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079424370","display_name":"Souhail Dhouib","orcid":"https://orcid.org/0000-0003-2487-0062"},"institutions":[{"id":"https://openalex.org/I142899784","display_name":"University of Sfax","ror":"https://ror.org/04d4sd432","country_code":"TN","type":"education","lineage":["https://openalex.org/I142899784"]},{"id":"https://openalex.org/I4210088638","display_name":"Higher Institute of Management","ror":"https://ror.org/003sxhp42","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210088638"]}],"countries":["RU","TN"],"is_corresponding":true,"raw_author_name":"Souhail Dhouib","raw_affiliation_strings":["Higher Institute of Industrial Management ,  Sfax University ,  Sfax ,  Tunisia ,  uss.rnu.tn"],"raw_orcid":"https://orcid.org/0000-0003-2487-0062","affiliations":[{"raw_affiliation_string":"Higher Institute of Industrial Management ,  Sfax University ,  Sfax ,  Tunisia ,  uss.rnu.tn","institution_ids":["https://openalex.org/I4210088638","https://openalex.org/I142899784"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045242549","display_name":"Habib Chabchoub","orcid":"https://orcid.org/0000-0002-1101-2360"},"institutions":[{"id":"https://openalex.org/I161913731","display_name":"Al Ain University","ror":"https://ror.org/023abrt21","country_code":"AE","type":"education","lineage":["https://openalex.org/I161913731"]}],"countries":["AE"],"is_corresponding":false,"raw_author_name":"Habib Chabchoub","raw_affiliation_strings":["College of Business ,  Al Ain University , Al Ain,  Abu Dhabi ,  UAE ,  aau.ac.ae"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Business ,  Al Ain University , Al Ain,  Abu Dhabi ,  UAE ,  aau.ac.ae","institution_ids":["https://openalex.org/I161913731"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079424370"],"corresponding_institution_ids":["https://openalex.org/I142899784","https://openalex.org/I4210088638"],"apc_list":{"value":900,"currency":"USD","value_usd":900},"apc_paid":{"value":900,"currency":"USD","value_usd":900},"fwci":62.4149,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.99785208,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":"2026","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.1923999935388565,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.1923999935388565,"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"}},{"id":"https://openalex.org/T11500","display_name":"Evacuation and Crowd Dynamics","score":0.17409999668598175,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/T11502","display_name":"Facility Location and Emergency Management","score":0.11410000175237656,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8324000239372253},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6197999715805054},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5895000100135803},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5361999869346619},{"id":"https://openalex.org/keywords/python","display_name":"Python (programming language)","score":0.5167999863624573},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4361000061035156},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.43309998512268066},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.3718000054359436},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.36489999294281006}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8324000239372253},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7560999989509583},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6197999715805054},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5895000100135803},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5361999869346619},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5217000246047974},{"id":"https://openalex.org/C519991488","wikidata":"https://www.wikidata.org/wiki/Q28865","display_name":"Python (programming language)","level":2,"score":0.5167999863624573},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4361000061035156},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.43309998512268066},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.3718000054359436},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.36489999294281006},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.3635999858379364},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.3589000105857849},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33090001344680786},{"id":"https://openalex.org/C91370436","wikidata":"https://www.wikidata.org/wiki/Q5608616","display_name":"Grid method multiplication","level":3,"score":0.3246999979019165},{"id":"https://openalex.org/C3008058167","wikidata":"https://www.wikidata.org/wiki/Q84263196","display_name":"Coronavirus disease 2019 (COVID-19)","level":4,"score":0.3240000009536743},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.3165999948978424},{"id":"https://openalex.org/C524204448","wikidata":"https://www.wikidata.org/wiki/Q788926","display_name":"Infectious disease (medical specialty)","level":3,"score":0.31360000371932983},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.3089999854564667},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.30709999799728394},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.2953000068664551},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.29280000925064087},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.2856000065803528},{"id":"https://openalex.org/C156172958","wikidata":"https://www.wikidata.org/wiki/Q3438407","display_name":"Grid reference","level":4,"score":0.28200000524520874},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2761000096797943},{"id":"https://openalex.org/C89623803","wikidata":"https://www.wikidata.org/wiki/Q12184","display_name":"Pandemic","level":5,"score":0.2529999911785126}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1155/acis/4490913","is_oa":true,"landing_page_url":"https://doi.org/10.1155/acis/4490913","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1155/acis/4490913","source":{"id":"https://openalex.org/S30680879","display_name":"Applied Computational Intelligence and Soft Computing","issn_l":"1687-9724","issn":["1687-9724","1687-9732"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Computational Intelligence and Soft Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1155/acis/4490913","is_oa":true,"landing_page_url":"https://doi.org/10.1155/acis/4490913","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1155/acis/4490913","source":{"id":"https://openalex.org/S30680879","display_name":"Applied Computational Intelligence and Soft Computing","issn_l":"1687-9724","issn":["1687-9724","1687-9732"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Computational Intelligence and Soft Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.8564503788948059,"display_name":"Good health and well-being","id":"https://metadata.un.org/sdg/3"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7129339887.pdf","grobid_xml":"https://content.openalex.org/works/W7129339887.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W3122791838","https://openalex.org/W3154013933","https://openalex.org/W3159680643","https://openalex.org/W3162398161","https://openalex.org/W3198981391","https://openalex.org/W3209488042","https://openalex.org/W4220686662","https://openalex.org/W4306760864","https://openalex.org/W4307547220","https://openalex.org/W4378469486","https://openalex.org/W4384563777","https://openalex.org/W4386054157","https://openalex.org/W4386573823","https://openalex.org/W4391251006","https://openalex.org/W4391915724","https://openalex.org/W4407719236"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"the":[3,13,18,25,29,35,40,54,66,88,94,105,111,117,158,168,175,178,184,190,196],"shortest":[4,19,41],"path":[5,20,27,30,43],"problem":[6,21],"is":[7,37,62,81],"considered":[8],"with":[9,44,83],"emphasis":[10],"on":[11,23],"reducing":[12],"COVID\u201019":[14,70,120],"contamination":[15],"risk.":[16],"Generally,":[17],"focuses":[22],"planning":[24],"minimal":[26],"considering":[28],"distance":[31],"criterion,":[32],"and":[33,48,77,139,162,195],"here":[34],"aim":[36],"to":[38,64,103,115,167],"generate":[39],"safe":[42],"obstacles":[45],"free":[46],"collision":[47],"virus":[49,121],"infection":[50],"saving.":[51],"For":[52],"that,":[53],"novel":[55],"Dhouib\u2010Matrix":[56],"Shortest":[57],"Path":[58],"Problem":[59],"(DM\u2010SPP)":[60],"method":[61],"enhanced":[63],"reduce":[65],"probability":[67],"of":[68,98,113,143,170],"catching":[69],"by":[71,152],"keeping":[72],"people":[73],"away":[74],"from":[75],"crowded":[76],"risked":[78],"space.":[79],"DM\u2010SPP":[80,114,153],"enriched":[82],"a":[84],"grid":[85,91,137,147],"map,":[86,92],"namely,":[87,177],"risk":[89,106],"pandemic":[90],"gathering":[93],"human":[95],"flow":[96],"density":[97],"each":[99],"area":[100],"in":[101,119,174],"order":[102],"mark":[104],"epidemic":[107],"zone.":[108],"To":[109],"prove":[110],"performance":[112],"optimize":[116],"trajectory":[118],"infection,":[122],"two":[123],"case":[124,130],"sites":[125],"are":[126,154,165],"used":[127],"(a":[128],"campus":[129],"study":[131],"represented":[132,156],"as":[133],"40":[134,136],"\u00d7":[135,145],"map":[138],"an":[140],"experimental":[141],"platform":[142],"50":[144,146],"map).":[148],"The":[149],"solutions":[150],"generated":[151],"graphically":[155],"using":[157],"Python":[159],"programing":[160],"language,":[161],"its":[163],"results":[164,169],"compared":[166],"recently":[171],"developed":[172],"metaheuristics":[173],"literature,":[176],"classical":[179,191],"ant":[180,186],"colony":[181,187],"optimization":[182,188],"metaheuristic,":[183,189],"improved":[185,197],"A":[192,198],"\u2217":[193,199],"algorithm,":[194],"algorithm.":[200]},"counts_by_year":[{"year":2026,"cited_by_count":2}],"updated_date":"2026-05-02T08:42:23.175194","created_date":"2026-02-18T00:00:00"}