Abstract
The expansion of a nuclear economy entails the development of fuel process and reprocessing plant programmes. The model proposed makes it possible to select the size, the site and the start-up schedule of the plants in such a way as to minimize the total freight and reprocessing costs. As an illustration, we have approached the problem of burnt natural uranium processing plants related to natural uranium-graphite as nuclear power stations. The sites and annual output of the reactors, the possible plant sites and cost functions (freight and reprocessing) are supposed to be known. The method consists in first approaching the process plant problem as a Dynamic Programming problem, increasing programme slices (total reactor output) being explored sequentially. When the quantities of burnt natural uranium to be reprocessed are fixed, the minimization of the transport cost is then also carried out as a dynamic programming problem. The neighbourhood of the optimum process cost is explored in order to find the minimum summation of a suboptimal processing cost and corresponding optimal transport cost. As the reprocessing problem can be represented on a sequential graph, in order to compute the sub-optima, we developed and used a 'reflexion algorithm'. The method can be interpreted
More>>
Thiriet, L;
Deledicq, A
[1]
- Commissariat a l'Energie Atomique, Siege (France). Centre d'Etudes Nucleaires
Citation Formats
Thiriet, L, and Deledicq, A.
Optimal sizes and siting of nuclear fuel reprocessing plants; Tailles et localisations optimales des usines de retraitement des combustibles nucleaires.
France: N. p.,
1967.
Web.
Thiriet, L, & Deledicq, A.
Optimal sizes and siting of nuclear fuel reprocessing plants; Tailles et localisations optimales des usines de retraitement des combustibles nucleaires.
France.
Thiriet, L, and Deledicq, A.
1967.
"Optimal sizes and siting of nuclear fuel reprocessing plants; Tailles et localisations optimales des usines de retraitement des combustibles nucleaires."
France.
@misc{etde_20729349,
title = {Optimal sizes and siting of nuclear fuel reprocessing plants; Tailles et localisations optimales des usines de retraitement des combustibles nucleaires}
author = {Thiriet, L, and Deledicq, A}
abstractNote = {The expansion of a nuclear economy entails the development of fuel process and reprocessing plant programmes. The model proposed makes it possible to select the size, the site and the start-up schedule of the plants in such a way as to minimize the total freight and reprocessing costs. As an illustration, we have approached the problem of burnt natural uranium processing plants related to natural uranium-graphite as nuclear power stations. The sites and annual output of the reactors, the possible plant sites and cost functions (freight and reprocessing) are supposed to be known. The method consists in first approaching the process plant problem as a Dynamic Programming problem, increasing programme slices (total reactor output) being explored sequentially. When the quantities of burnt natural uranium to be reprocessed are fixed, the minimization of the transport cost is then also carried out as a dynamic programming problem. The neighbourhood of the optimum process cost is explored in order to find the minimum summation of a suboptimal processing cost and corresponding optimal transport cost. As the reprocessing problem can be represented on a sequential graph, in order to compute the sub-optima, we developed and used a 'reflexion algorithm'. The method can be interpreted as a general mechanism for determining the optimum when to a sequential dynamic problem (for example an equipment programme) is added a complementary problem (transport, for instance). It also makes it possible to estimate the economic losses which result from the choice of a non optimal policy for other than economic reasons. (author) [French] L'expansion de l'economie nucleaire se traduit par un developpement des programmes d'usines d'elaboration et de retraitement des combustibles. Le modele propose permet de choisir la taille, la localisation et la cadence de mise en service des usines de maniere a minimiser le total des frais de transport et de retraitement. A titre d'exemple nous avons traite le probleme des usines de traitement de l'uranium naturel irradie associees a des centrales nucleaires a uranium naturel-graphite CO{sub 2}. La localisation et la production annuelle des reacteurs, les sites possibles d'usines et les fonctions de cout (transport et retraitement) sont supposes connus. La methode consiste a traiter d'abord le probleme des usines de traitement comme un probleme de programmation dynamique, des tranches croissantes de programmes (production totale des reacteurs) etant explorees sequentiellement. Lorsque les quantites d'uranium naturel irradie a retraiter sont fixees, la minimisation du cout de transport est alors effectuee, elle aussi comme un probleme de programmation dynamique. On explore le voisinage de l'optimum du cout de traitement pour trouver le minimum de la somme d'un cout de traitement sous-optimal et du cout de transport optimal correspondant. Le probleme de retraitement etant representable sur un graphe sequentiel, l'algorithme utilise pour calculer les sous-optima est 'l'algorithme a reflexion' que nous avons elabore. La methode s'interprete comme un mecanisme general de determination de l'optimum lorsque, a un probleme dynamique sequentiel (par exemple un programme d'equipement), se superpose un probleme complementaire (par exemple de transport). Elle permet en outre d'evaluer les pertes resultant du choix, pour des raisons autres qu'economiques, d'une politique non optimale. (auteur)}
place = {France}
year = {1967}
month = {Jul}
}
title = {Optimal sizes and siting of nuclear fuel reprocessing plants; Tailles et localisations optimales des usines de retraitement des combustibles nucleaires}
author = {Thiriet, L, and Deledicq, A}
abstractNote = {The expansion of a nuclear economy entails the development of fuel process and reprocessing plant programmes. The model proposed makes it possible to select the size, the site and the start-up schedule of the plants in such a way as to minimize the total freight and reprocessing costs. As an illustration, we have approached the problem of burnt natural uranium processing plants related to natural uranium-graphite as nuclear power stations. The sites and annual output of the reactors, the possible plant sites and cost functions (freight and reprocessing) are supposed to be known. The method consists in first approaching the process plant problem as a Dynamic Programming problem, increasing programme slices (total reactor output) being explored sequentially. When the quantities of burnt natural uranium to be reprocessed are fixed, the minimization of the transport cost is then also carried out as a dynamic programming problem. The neighbourhood of the optimum process cost is explored in order to find the minimum summation of a suboptimal processing cost and corresponding optimal transport cost. As the reprocessing problem can be represented on a sequential graph, in order to compute the sub-optima, we developed and used a 'reflexion algorithm'. The method can be interpreted as a general mechanism for determining the optimum when to a sequential dynamic problem (for example an equipment programme) is added a complementary problem (transport, for instance). It also makes it possible to estimate the economic losses which result from the choice of a non optimal policy for other than economic reasons. (author) [French] L'expansion de l'economie nucleaire se traduit par un developpement des programmes d'usines d'elaboration et de retraitement des combustibles. Le modele propose permet de choisir la taille, la localisation et la cadence de mise en service des usines de maniere a minimiser le total des frais de transport et de retraitement. A titre d'exemple nous avons traite le probleme des usines de traitement de l'uranium naturel irradie associees a des centrales nucleaires a uranium naturel-graphite CO{sub 2}. La localisation et la production annuelle des reacteurs, les sites possibles d'usines et les fonctions de cout (transport et retraitement) sont supposes connus. La methode consiste a traiter d'abord le probleme des usines de traitement comme un probleme de programmation dynamique, des tranches croissantes de programmes (production totale des reacteurs) etant explorees sequentiellement. Lorsque les quantites d'uranium naturel irradie a retraiter sont fixees, la minimisation du cout de transport est alors effectuee, elle aussi comme un probleme de programmation dynamique. On explore le voisinage de l'optimum du cout de traitement pour trouver le minimum de la somme d'un cout de traitement sous-optimal et du cout de transport optimal correspondant. Le probleme de retraitement etant representable sur un graphe sequentiel, l'algorithme utilise pour calculer les sous-optima est 'l'algorithme a reflexion' que nous avons elabore. La methode s'interprete comme un mecanisme general de determination de l'optimum lorsque, a un probleme dynamique sequentiel (par exemple un programme d'equipement), se superpose un probleme complementaire (par exemple de transport). Elle permet en outre d'evaluer les pertes resultant du choix, pour des raisons autres qu'economiques, d'une politique non optimale. (auteur)}
place = {France}
year = {1967}
month = {Jul}
}