1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
|
// Copyright (C) 2019 EDF
// All Rights Reserved
// This code is published under the GNU Lesser General Public License (GNU LGPL)
#ifndef SIMULATESTEPTREECUTDIST_H
#define SIMULATESTEPTREECUTDIST_H
#include <boost/mpi.hpp>
#include <boost/mpi/collectives.hpp>
#include <boost/lexical_cast.hpp>
#include "geners/BinaryFileArchive.hh"
#include "StOpt/dp/SimulateStepTreeBase.h"
#include "StOpt/core/grids/FullGrid.h"
#include "StOpt/tree/StateTreeStocks.h"
#include "StOpt/tree/ContinuationCutsTree.h"
#include "StOpt/core/parallelism/ParallelComputeGridSplitting.h"
#include "StOpt/dp/OptimizerDPCutTreeBase.h"
/** SimulateStepTreeCutDist.h
* In simulation part, permits to use continuation cuts values stored in in optimization step and
* calculate optimal controls using a LP programm to calculate transition problems. Tree version with MPI
* \author Xavier Warin
*/
namespace StOpt
{
/// \class SimulateStepTreeCutDist SimulateStepTreeCutDist.h
/// One step in forward simulation using mpi
class SimulateStepTreeCutDist : public SimulateStepTreeBase
{
private :
std::shared_ptr<FullGrid> m_pGridFollowing ; ///< global grid at following time step
std::shared_ptr<OptimizerDPCutTreeBase > m_pOptimize ; ///< optimizer solving the problem for one point and one step
std::vector< ContinuationCutsTree> m_continuationObj ; ///< to store continuation value per regime on the grid at following step
std::vector< Eigen::ArrayXXd > m_contValue ; ///< to store continuation cuts values split in memory if multiple files used
bool m_bOneFile ; /// do we use one file for continuation values
std::shared_ptr<ParallelComputeGridSplitting> m_parall ; ///< parallel object for splitting and reconstruction
boost::mpi::communicator m_world; ///< Mpi communicator
public :
/// \brief Constructor
/// \param p_ar Archive where continuation values are stored
/// \param p_iStep Step number identifier
/// \param p_nameCont Name use to store continuation valuation
/// \param p_pGridFollowing grid at following time step
/// \param p_pOptimize Optimize object defining the transition step
/// \param p_bOneFile Do we store continuation values in only one file
/// \param p_world MPI communicator
SimulateStepTreeCutDist(gs::BinaryFileArchive &p_ar, const int &p_iStep, const std::string &p_nameCont,
const std::shared_ptr<FullGrid> &p_pGridFollowing,
const std::shared_ptr<OptimizerDPCutTreeBase > &p_pOptimize,
const bool &p_bOneFile, const boost::mpi::communicator &p_world);
/// \brief Define one step arbitraging between possible commands
/// \param p_statevector Vector of states (regime, stock descriptor, uncertainty node number)
/// \param p_phiInOut actual contract value modified at current time step by applying an optimal command (size number of functions by number of simulations)
void oneStep(std::vector<StateTreeStocks > &p_statevector, Eigen::ArrayXXd &p_phiInOut) const;
};
}
#endif /* SIMULATESTEPTREECUTDIST_H */
|
