{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T18:14:18Z","timestamp":1777486458766,"version":"3.51.4"},"reference-count":16,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T00:00:00Z","timestamp":1771286400000},"content-version":"vor","delay-in-days":47,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Applied Computational Intelligence and Soft Computing"],"published-print":{"date-parts":[[2026,1]]},"abstract":"<jats:p>\n                    In this paper, the shortest path problem is considered with emphasis on reducing the COVID\u201019 contamination risk. Generally, the shortest path problem focuses on planning the minimal path considering the path distance criterion, and here the aim is to generate the shortest safe path with obstacles free collision and virus infection saving. For that, the novel Dhouib\u2010Matrix Shortest Path Problem (DM\u2010SPP) method is enhanced to reduce the probability of catching COVID\u201019 by keeping people away from crowded and risked space. DM\u2010SPP is enriched with a grid map, namely, the risk pandemic grid map, gathering the human flow density of each area in order to mark the risk epidemic zone. To prove the performance of DM\u2010SPP to optimize the trajectory in COVID\u201019 virus infection, two case sites are used (a campus case study represented as 40\u2009\u00d7\u200940 grid map and an experimental platform of 50\u2009\u00d7\u200950 grid map). The solutions generated by DM\u2010SPP are graphically represented using the Python programing language, and its results are compared to the results of recently developed metaheuristics in the literature, namely, the classical ant colony optimization metaheuristic, the improved ant colony optimization metaheuristic, the classical A\n                    <jats:sup>\u2217<\/jats:sup>\n                    algorithm, and the improved A\n                    <jats:sup>\u2217<\/jats:sup>\n                    algorithm.\n                  <\/jats:p>","DOI":"10.1155\/acis\/4490913","type":"journal-article","created":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T08:56:02Z","timestamp":1771318562000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimizing the Shortest and Safety Pathways in Infectious Disease Context via the Novel Dhouib\u2010Matrix\u2010SPP Method"],"prefix":"10.1155","volume":"2026","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2487-0062","authenticated-orcid":false,"given":"Souhail","family":"Dhouib","sequence":"first","affiliation":[]},{"given":"Habib","family":"Chabchoub","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2026,2,17]]},"reference":[{"key":"e_1_2_10_1_2","doi-asserted-by":"publisher","DOI":"10.1155\/2023\/8984451"},{"key":"e_1_2_10_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2021.103920"},{"key":"e_1_2_10_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108125"},{"key":"e_1_2_10_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2020.3045069"},{"key":"e_1_2_10_5_2","doi-asserted-by":"publisher","DOI":"10.3390\/robotics11060117"},{"key":"e_1_2_10_6_2","doi-asserted-by":"publisher","DOI":"10.3390\/su131810426"},{"key":"e_1_2_10_7_2","doi-asserted-by":"publisher","DOI":"10.3390\/su142013364"},{"key":"e_1_2_10_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2021.3073109"},{"key":"e_1_2_10_9_2","doi-asserted-by":"publisher","DOI":"10.3390\/technologies10020048"},{"key":"e_1_2_10_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3280220"},{"key":"e_1_2_10_11_2","doi-asserted-by":"publisher","DOI":"10.3390\/su13105492"},{"key":"e_1_2_10_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.rico.2023.100269"},{"key":"e_1_2_10_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.rico.2023.100299"},{"key":"e_1_2_10_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cogr.2024.02.001"},{"key":"e_1_2_10_15_2","doi-asserted-by":"publisher","DOI":"10.3233\/ATDE231116"},{"key":"e_1_2_10_16_2","doi-asserted-by":"publisher","DOI":"10.1177\/00368504251321714"}],"container-title":["Applied Computational Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/acis\/4490913","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1155\/acis\/4490913","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/acis\/4490913","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T08:56:03Z","timestamp":1771318563000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/acis\/4490913"}},"subtitle":[],"editor":[{"given":"Jayesh","family":"Soni","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["10.1155\/acis\/4490913"],"URL":"https:\/\/doi.org\/10.1155\/acis\/4490913","archive":["Portico"],"relation":{},"ISSN":["1687-9724","1687-9732"],"issn-type":[{"value":"1687-9724","type":"print"},{"value":"1687-9732","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"2025-06-09","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-03","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"4490913"}}