\relax \citation{NRJbook} \citation{bioM} \citation{eol} \citation{heuristicHybride} \citation{hybrideProd} \citation{EDF1} \citation{CGbook} \@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{1}} \citation{CGsurvey} \citation{BrAdPr} \citation{ITCVRP} \citation{sujetOnline} \@writefile{toc}{\contentsline {section}{\numberline {2}Problem statement}{3}} \newlabel{sec:problemstatement}{{2}{3}} \@writefile{toc}{\contentsline {subsection}{\numberline {2.1}Global constraints linking different plants}{3}} \@writefile{toc}{\contentsline {subsection}{\numberline {2.2}Local constraints holding for each plant}{4}} \@writefile{toc}{\contentsline {section}{\numberline {3}The solving approach}{5}} \newlabel{sec:approach}{{3}{5}} \newlabel{objF}{{2}{6}} \newlabel{covF}{{3}{6}} \newlabel{1iF}{{4}{6}} \newlabel{limitTherF}{{5}{6}} \newlabel{cliquesF}{{6}{6}} \newlabel{binF}{{7}{6}} \newlabel{positF}{{8}{6}} \@writefile{toc}{\contentsline {section}{\numberline {4}Solving the Restricted Master Problem}{6}} \newlabel{sec:solving_the_master_problem}{{4}{6}} \newlabel{objLRMP}{{9}{6}} \newlabel{covLRMP}{{10}{6}} \newlabel{1iLRMP}{{11}{6}} \newlabel{limitLRMP}{{12}{6}} \newlabel{binLRMP}{{13}{6}} \newlabel{positLRMP}{{14}{6}} \citation{EcoLotSize} \citation{DynLotSize} \citation{IntProg} \newlabel{subp}{{15}{7}} \@writefile{toc}{\contentsline {subsection}{\numberline {4.1}MIP Solving for fixing outages and BO-periods}{7}} \newlabel{subsec:MIP}{{4.1}{7}} \@writefile{toc}{\contentsline {section}{\numberline {5}Solving the pricing subproblems of column generation}{7}} \newlabel{sec:pricing}{{5}{7}} \@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces Column generation process}}{8}} \newlabel{fig:column_process}{{1}{8}} \@writefile{toc}{\contentsline {subsection}{\numberline {5.1}Creation of a static graph}{8}} \newlabel{ssec:graph}{{5.1}{8}} \@writefile{toc}{\contentsline {paragraph}{Description of the graph}{8}} \@writefile{toc}{\contentsline {paragraph}{Building the graph.}{8}} \@writefile{loa}{\contentsline {algorithm}{\numberline {1}{\ignorespaces Creation of graph $G_i$}}{8}} \newlabel{algo:noeuds}{{1}{8}} \newlabel{algostep:noeuds}{{4}{8}} \@writefile{loa}{\contentsline {algorithm}{\numberline {2}{\ignorespaces Creation of new nodes in $G_i$ from $n=(\mathit {type}_n, x_n, h_n, k_n)$}}{9}} \newlabel{algo:beam}{{2}{9}} \newlabel{algostep:possibleStock}{{2}{9}} \newlabel{algostep:nouvelOutage}{{5}{9}} \newlabel{algostep:nouveauBO}{{8}{9}} \@writefile{toc}{\contentsline {subsection}{\numberline {5.2}Weighting the arcs of a graph}{9}} \@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces Creating new nodes from an \texttt {OUTAGE} node $n$ in graph $G_i$ inside the beam of possible stock intervals. Stars figure out \texttt {OUTAGE} nodes, circles are \texttt {BO} nodes. Note that no \texttt {BO} node is created at week $\mathtt {TA}_{k+1}$, because the paths that would go through such a node would break constraint \texttt {CT13bis}.}}{10}} \newlabel{fig:beam}{{2}{10}} \@writefile{toc}{\contentsline {paragraph}{Weighting a \texttt {BO} arc}{10}} \newlabel{eq:weightBOarc}{{16}{10}} \@writefile{toc}{\contentsline {paragraph}{Weighting a non final \texttt {OUTAGE} arc}{11}} \newlabel{eq:waobj}{{17}{11}} \newlabel{eq:wauno}{{18}{11}} \newlabel{eq:wadue}{{19}{11}} \newlabel{eq:watre}{{20}{11}} \newlabel{eq:waquattro}{{21}{11}} \newlabel{eq:wacinque}{{22}{11}} \@writefile{toc}{\contentsline {paragraph}{The exact solution}{11}} \@writefile{loa}{\contentsline {algorithm}{\numberline {3}{\ignorespaces Exact algorithm for minimizing arc weight}}{11}} \newlabel{algo:min_arc_weight_exact}{{3}{11}} \@writefile{toc}{\contentsline {paragraph}{We used a heuristic}{12}} \@writefile{toc}{\contentsline {subsection}{\numberline {5.3}Obtaining dual variables $\mu _h$ and $u_i$}{12}} \newlabel{subsec:getDual}{{5.3}{12}} \@writefile{toc}{\contentsline {section}{\numberline {6}Columns diversification}{12}} \newlabel{sec:diversification}{{6}{12}} \newlabel{eq:diversificationWeights}{{23}{12}} \newlabel{algo:diversification}{{6}{13}} \@writefile{loa}{\contentsline {algorithm}{\numberline {4}{\ignorespaces Alternate weight computation during a \emph {diversification} pass}}{13}} \@writefile{toc}{\contentsline {section}{\numberline {7}Reload and production}{13}} \newlabel{sec:ReloadProduction}{{7}{13}} \@writefile{toc}{\contentsline {subsection}{\numberline {7.1}LP-solving for fixing reload quantities}{13}} \citation{sujetOnline} \@writefile{toc}{\contentsline {subsection}{\numberline {7.2}Disaggregate LP-solving for every scenario and initial time steps}{14}} \newlabel{eq:z}{{24}{14}} \@writefile{toc}{\contentsline {section}{\numberline {8}Computational Results}{14}} \newlabel{sec:ComputationalResults}{{8}{14}} \bibstyle{plain} \bibdata{Paintshop} \@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces Results of the ROADEF challenge}}{15}} \newlabel{tableROADEF}{{1}{15}} \bibcite{ITCVRP}{1} \bibcite{BrAdPr}{2} \bibcite{bioM}{3} \bibcite{CGbook}{4} \bibcite{heuristicHybride}{5} \bibcite{NRJbook}{6} \bibcite{EDF1}{7} \bibcite{CGsurvey}{8} \bibcite{hybrideProd}{9} \@writefile{lot}{\contentsline {table}{\numberline {2}{\ignorespaces Performance of the overall method with $\rho = 0.9$ }}{16}} \newlabel{tableResults}{{2}{16}} \@writefile{lot}{\contentsline {table}{\numberline {3}{\ignorespaces Performance of the overall method with $\rho = 3$ }}{16}} \newlabel{table05}{{3}{16}} \bibcite{eol}{10} \bibcite{sujetOnline}{11} \bibcite{EcoLotSize}{12} \bibcite{DynLotSize}{13} \bibcite{IntProg}{14}