{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/14665"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/14665","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Application of shortest path algorithms to find paths of minimum radiation dose","abstract":"Presented here is the use of two path-optimization algorithms, Dijkstra's Algorithm, and the Bellman-Ford Algorithm, to find paths through radiologically contaminated environments such that the accumulated dose is minimal. Such paths will be very useful for personnel whose job requires them to navigate through contaminated areas such as nuclear facility workers and emergency response personnel who need to respond to events which occur in nuclear facilities. The modified algorithms are coded in Matlab. Preliminary calculations are carried out to test convergence as a function of number of grid points used. Impact of other parameters in the algorithm on results is also evaluated. Several models of contaminated areas are developed and minimum dose paths are determined. These models include both continuous as well as discrete radiation fields, and ranged in complexity from simple hypothetical models, to real models of contaminated areas in currently operational nuclear power plants such as the LaSalle Nuclear Power Station and the Clinton Power Station. Minimal dose path is also determined in a room where the radiation field is determined using MCNP transport code. In order to solve these real complex models, the capability to maneuver around obstacles was added to the algorithm. It was also proposed in this thesis to integrate the minimal dose paths into virtual reality models of the contaminated areas for personnel training purposes. A virtual 3D interactive model of a LaSalle Nuclear Power Plant room was developed and its minimal path solution was added to this VR model. An MCNP model of a contaminated room was also solved and its minimal dose path calculated.","abstract_html":"Presented here is the use of two path-optimization algorithms, Dijkstra's Algorithm, and the Bellman-Ford Algorithm, to find paths through radiologically contaminated environments such that the accumulated dose is minimal. Such paths will be very useful for personnel whose job requires them to navigate through contaminated areas such as nuclear facility workers and emergency response personnel who need to respond to events which occur in nuclear facilities. The modified algorithms are coded in Matlab. Preliminary calculations are carried out to test convergence as a function of number of grid points used. Impact of other parameters in the algorithm on results is also evaluated. Several models of contaminated areas are developed and minimum dose paths are determined. These models include both continuous as well as discrete radiation fields, and ranged in complexity from simple hypothetical models, to real models of contaminated areas in currently operational nuclear power plants such as the LaSalle Nuclear Power Station and the Clinton Power Station. Minimal dose path is also determined in a room where the radiation field is determined using MCNP transport code. In order to solve these real complex models, the capability to maneuver around obstacles was added to the algorithm. It was also proposed in this thesis to integrate the minimal dose paths into virtual reality models of the contaminated areas for personnel training purposes. A virtual 3D interactive model of a LaSalle Nuclear Power Plant room was developed and its minimal path solution was added to this VR model. An MCNP model of a contaminated room was also solved and its minimal dose path calculated.","abstract_has_math":false,"creators":["Alzalloum, Abdul-Qadim"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Nuclear Engineering","degree_department":null,"school":null,"contributors":["Uddin, Rizwan"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2010,"date_issued":"2010-01-06T16:20:48Z","date_published":"2010-01-06T16:20:48Z","updated_at":"2026-07-22T22:25:08Z","subjects":["Dijkstra","Bellman-Ford","Shortest Path Algorithms","Path of Minimum Radiation Dose","Path Minimization Algorithms","Minimize Radiation Dose"],"languages":["en"],"rights":["© 2009 by Abdul-Qadim Alzalloum. All rights reserved."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/14665","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Uddin, Rizwan"]},{"key":"dc:creator","label":"Author","values":["Alzalloum, Abdul-Qadim"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2010-01-06T16:20:48Z","2009-12"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Nuclear Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Dijkstra","Bellman-Ford","Shortest Path Algorithms","Path of Minimum Radiation Dose","Path Minimization Algorithms","Minimize Radiation Dose"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["© 2009 by Abdul-Qadim Alzalloum. All rights reserved."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/14665"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Presented here is the use of two path-optimization algorithms, Dijkstra's Algorithm, and the Bellman-Ford Algorithm, to find paths through radiologically contaminated environments such that the accumulated dose is minimal. Such paths will be very useful for personnel whose job requires them to navigate through contaminated areas such as nuclear facility workers and emergency response personnel who need to respond to events which occur in nuclear facilities. The modified algorithms are coded in Matlab. Preliminary calculations are carried out to test convergence as a function of number of grid points used. Impact of other parameters in the algorithm on results is also evaluated. Several models of contaminated areas are developed and minimum dose paths are determined. These models include both continuous as well as discrete radiation fields, and ranged in complexity from simple hypothetical models, to real models of contaminated areas in currently operational nuclear power plants such as the LaSalle Nuclear Power Station and the Clinton Power Station. Minimal dose path is also determined in a room where the radiation field is determined using MCNP transport code. In order to solve these real complex models, the capability to maneuver around obstacles was added to the algorithm. It was also proposed in this thesis to integrate the minimal dose paths into virtual reality models of the contaminated areas for personnel training purposes. A virtual 3D interactive model of a LaSalle Nuclear Power Plant room was developed and its minimal path solution was added to this VR model. An MCNP model of a contaminated room was also solved and its minimal dose path calculated.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2009-12-09T17:24:06Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Alzalloum_Abdul-Qadim.pdf: 2500740 bytes, checksum: 7fa26ccc5339f4c88c86278e74dd26d7 (MD5)","Made available in DSpace on 2010-01-06T16:20:48Z (GMT). No. of bitstreams: 4 license.txt: 4065 bytes, checksum: d6e9cb577dab7abe8f2e543fb174b81d (MD5) Alzalloum_Abdul-Qadim.pdf: 2493418 bytes, checksum: 8240a6d1940ec8a1eea0dc52b24ae496 (MD5) 1_Alzalloum_Abdul-Qadim.pdf: 2493418 bytes, checksum: 5477297b3fc556f66c21bcb069b88647 (MD5) 2_Alzalloum_Abdul-Qadim.pdf: 2500740 bytes, checksum: 7fa26ccc5339f4c88c86278e74dd26d7 (MD5)"]},{"key":"dc:title","label":"Title","values":["Application of shortest path algorithms to find paths of minimum radiation dose"]}]}],"canonical_facts":{"dc:contributor":["Uddin, Rizwan"],"dc:creator":["Alzalloum, Abdul-Qadim"],"dc:date":["2010-01-06T16:20:48Z","2009-12"],"dc:description":["Presented here is the use of two path-optimization algorithms, Dijkstra's Algorithm, and the Bellman-Ford Algorithm, to find paths through radiologically contaminated environments such that the accumulated dose is minimal. Such paths will be very useful for personnel whose job requires them to navigate through contaminated areas such as nuclear facility workers and emergency response personnel who need to respond to events which occur in nuclear facilities. The modified algorithms are coded in Matlab. Preliminary calculations are carried out to test convergence as a function of number of grid points used. Impact of other parameters in the algorithm on results is also evaluated. Several models of contaminated areas are developed and minimum dose paths are determined. These models include both continuous as well as discrete radiation fields, and ranged in complexity from simple hypothetical models, to real models of contaminated areas in currently operational nuclear power plants such as the LaSalle Nuclear Power Station and the Clinton Power Station. Minimal dose path is also determined in a room where the radiation field is determined using MCNP transport code. In order to solve these real complex models, the capability to maneuver around obstacles was added to the algorithm. It was also proposed in this thesis to integrate the minimal dose paths into virtual reality models of the contaminated areas for personnel training purposes. A virtual 3D interactive model of a LaSalle Nuclear Power Plant room was developed and its minimal path solution was added to this VR model. An MCNP model of a contaminated room was also solved and its minimal dose path calculated.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2009-12-09T17:24:06Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Alzalloum_Abdul-Qadim.pdf: 2500740 bytes, checksum: 7fa26ccc5339f4c88c86278e74dd26d7 (MD5)","Made available in DSpace on 2010-01-06T16:20:48Z (GMT). No. of bitstreams: 4 license.txt: 4065 bytes, checksum: d6e9cb577dab7abe8f2e543fb174b81d (MD5) Alzalloum_Abdul-Qadim.pdf: 2493418 bytes, checksum: 8240a6d1940ec8a1eea0dc52b24ae496 (MD5) 1_Alzalloum_Abdul-Qadim.pdf: 2493418 bytes, checksum: 5477297b3fc556f66c21bcb069b88647 (MD5) 2_Alzalloum_Abdul-Qadim.pdf: 2500740 bytes, checksum: 7fa26ccc5339f4c88c86278e74dd26d7 (MD5)"],"dc:identifier":["http://hdl.handle.net/2142/14665"],"dc:language":["en"],"dc:rights":["© 2009 by Abdul-Qadim Alzalloum. All rights reserved."],"dc:subject":["Dijkstra","Bellman-Ford","Shortest Path Algorithms","Path of Minimum Radiation Dose","Path Minimization Algorithms","Minimize Radiation Dose"],"dc:title":["Application of shortest path algorithms to find paths of minimum radiation dose"],"thesis:degree_discipline":["Nuclear Engineering"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:08Z"}