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&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.
- Inventors:
-
- Idaho Falls, ID
- Issue Date:
- Research Org.:
- Idaho National Laboratory (INL), Idaho Falls, ID (United States)
- OSTI Identifier:
- 872447
- Patent Number(s):
- 5936863
- Assignee:
- Lockheed Martin Idaho Technologies Company (Idaho Falls, ID)
- Patent Classifications (CPCs):
-
G - PHYSICS G06 - COMPUTING G06Q - DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES
Y - NEW / CROSS SECTIONAL TECHNOLOGIES Y10 - TECHNICAL SUBJECTS COVERED BY FORMER USPC Y10S - TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- DOE Contract Number:
- AC07-94ID13223
- Resource Type:
- Patent
- Country of Publication:
- United States
- Language:
- English
- Subject:
- optimal; segmentation; packaging; process; improving; efficiency; dimensional; computer; simulated; models; various; optimization; algorithms; determine; configurations; based; constraints; including; container; limitations; applied; decontaminating; decommissioning; remediating; nuclear; facility; involving; contaminated; items; waste; containers; minimize; cuts; maximize; density; reduce; worker; radiation; exposure; three-dimensional; model; created; differentiated; location; orientation; sequence; determined; cut; locations; orientations; transposed; segmented; packaged; beforehand; addition; cataloged; recorded; radiation exposure; packaging efficiency; waste container; optimal segmentation; nuclear facility; segmentation process; /700/83/376/703/
Citation Formats
Kostelnik, Kevin M, Meservey, Richard H, and Landon, Mark D. Optimal segmentation and packaging process. United States: N. p., 1999.
Web.
Kostelnik, Kevin M, Meservey, Richard H, & Landon, Mark D. Optimal segmentation and packaging process. United States.
Kostelnik, Kevin M, Meservey, Richard H, and Landon, Mark D. Fri .
"Optimal segmentation and packaging process". United States. https://www.osti.gov/servlets/purl/872447.
@article{osti_872447,
title = {Optimal segmentation and packaging process},
author = {Kostelnik, Kevin M and Meservey, Richard H and Landon, Mark 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&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.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Fri Jan 01 00:00:00 EST 1999},
month = {Fri Jan 01 00:00:00 EST 1999}
}