Optimal segmentation and packaging process
Abstract
A process for improving packaging efficiency uses three dimensional, computer simulated models with various optimization algorithms to determine the optimal segmentation process and packaging configurations based on constraints including container limitations. The present invention is applied to a process for decontaminating, decommissioning (D and D), and remediating a nuclear facility involving the segmentation and packaging of contaminated items in waste containers in order to minimize the number of cuts, maximize packaging density, and reduce worker radiation exposure. A three-dimensional, computer simulated, facility model of the contaminated items are created. The contaminated items are differentiated. The optimal location, orientation and sequence of the segmentation and packaging of the contaminated items is determined using the simulated model, the algorithms, and various constraints including container limitations. The cut locations and orientations are transposed to the simulated model. The contaminated items are actually segmented and packaged. The segmentation and packaging may be simulated beforehand. In addition, the contaminated items may be cataloged and recorded. 3 figs.
- Inventors:
- Issue Date:
- Research Org.:
- Idaho National Laboratory (INL), Idaho Falls, ID (United States)
- Sponsoring Org.:
- USDOE, Washington, DC (United States)
- OSTI Identifier:
- 678604
- Patent Number(s):
- 5936863
- Application Number:
- PAN: 9-014,696; TRN: 99:009178
- Assignee:
- Lockheed Martin Idaho Technologies Co., Idaho Falls, ID (United States)
- DOE Contract Number:
- AC07-94ID13223
- Resource Type:
- Patent
- Resource Relation:
- Other Information: PBD: 10 Aug 1999
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 05 NUCLEAR FUELS; 22 NUCLEAR REACTOR TECHNOLOGY; THREE-DIMENSIONAL CALCULATIONS; PACKAGING; PERFORMANCE; ALGORITHMS; CONTAINERS; DECONTAMINATION; DECOMMISSIONING; NUCLEAR FACILITIES; REMEDIAL ACTION; OCCUPATIONAL EXPOSURE; MATHEMATICAL MODELS; RADIOACTIVE WASTES; DEMOLITION
Citation Formats
Kostelnik, K M, Meservey, R H, and Landon, M D. Optimal segmentation and packaging process. United States: N. p., 1999.
Web.
Kostelnik, K M, Meservey, R H, & Landon, M D. Optimal segmentation and packaging process. United States.
Kostelnik, K M, Meservey, R H, and Landon, M D. Tue .
"Optimal segmentation and packaging process". United States.
@article{osti_678604,
title = {Optimal segmentation and packaging process},
author = {Kostelnik, K M and Meservey, R H and Landon, M D},
abstractNote = {A process for improving packaging efficiency uses three dimensional, computer simulated models with various optimization algorithms to determine the optimal segmentation process and packaging configurations based on constraints including container limitations. The present invention is applied to a process for decontaminating, decommissioning (D and D), and remediating a nuclear facility involving the segmentation and packaging of contaminated items in waste containers in order to minimize the number of cuts, maximize packaging density, and reduce worker radiation exposure. A three-dimensional, computer simulated, facility model of the contaminated items are created. The contaminated items are differentiated. The optimal location, orientation and sequence of the segmentation and packaging of the contaminated items is determined using the simulated model, the algorithms, and various constraints including container limitations. The cut locations and orientations are transposed to the simulated model. The contaminated items are actually segmented and packaged. The segmentation and packaging may be simulated beforehand. In addition, the contaminated items may be cataloged and recorded. 3 figs.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {1999},
month = {8}
}