HGS-IRP/LotSizingSolver.h at main · vidalt/HGS-IRP · GitHub

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
62
63
64
65
66
67
//
// Created by pta on 16/08/2018.
//

#ifndef IRP_LOTSIZINGSOLVER_H
#define IRP_LOTSIZINGSOLVER_H

#include "memory"
#include "PLFunction.h"
#include "LinearPiece.h"
#include "Params.h"

using namespace std;

class LotSizingSolver {
private:
    Params * params;

public:
    vector<vector<Insertion>> insertions;
    vector<std::shared_ptr<PLFunction>> C;
    vector<std::shared_ptr<PLFunction>> F;
    vector<std::shared_ptr<PLFunction>> F1;
    vector<std::shared_ptr<PLFunction>> F2;
    vector<double > I;
    vector<double > quantities;
    vector<std::shared_ptr<Insertion>> breakpoints;
    vector<std::shared_ptr<LinearPiece>> exceptionalPieces;

    int client;
    int horizon;
    double objective;

    bool traces;

    LotSizingSolver(Params * params, vector<vector<Insertion>> insertions, int client);

    std::shared_ptr<PLFunction> copyPLFunction(std::shared_ptr<PLFunction> source);
    void extractBreakpoints(const std::shared_ptr<PLFunction>& f, vector<double>& breakpoints);
    void extractRepeat(const std::shared_ptr<PLFunction>& f, vector<double>& breakpoints);
    vector<double > getBreakpoints(std::shared_ptr<PLFunction> f1, std::shared_ptr<PLFunction> f2);
    vector<double > getBreakpoints_final(std::shared_ptr<PLFunction> f1, std::shared_ptr<PLFunction> f2);
    std::shared_ptr<PLFunction> min(std::shared_ptr<PLFunction> f1, std::shared_ptr<PLFunction> f2);
    std::shared_ptr<PLFunction> min_stockout(std::shared_ptr<PLFunction> f1, std::shared_ptr<PLFunction> f2);
    std::shared_ptr<PLFunction> min_final(std::shared_ptr<PLFunction> f1, std::shared_ptr<PLFunction> f2);
    std::shared_ptr<LinearPiece> createPieceFromLowerY(std::shared_ptr<LinearPiece> &chosenPiece,
         double x1, double y1, double x2, double y2);
    std::shared_ptr<PLFunction> supperpositionl(std::shared_ptr<LinearPiece> fromPieceC, std::shared_ptr<LinearPiece> fromPieceF);
    std::shared_ptr<PLFunction> supperposition(std::shared_ptr<PLFunction> fromC, std::shared_ptr<PLFunction> fromF);
    bool backtracking();
    bool backtracking_stockout();
    bool compareY(const Point& a, const Point& b) ;
    void  Firstday(vector<std::shared_ptr<PLFunction>> &C);
    void solveEquationSystem(std::shared_ptr<LinearPiece> C, std::shared_ptr<LinearPiece> fromC,
        std::shared_ptr<LinearPiece> fromF, double I, double demand, double &fromI, double &quantity);
    void solveEquationSystem_stockout(std::shared_ptr<LinearPiece> C, std::shared_ptr<LinearPiece> fromC,
        std::shared_ptr<LinearPiece> fromF, double I, double demand, double &fromI, double &quantity,std::shared_ptr<LinearPiece> Cpre,double stockout);
    void solveEquationSystem_holding(std::shared_ptr<LinearPiece> C, std::shared_ptr<LinearPiece> fromC,
        std::shared_ptr<LinearPiece> fromF, double I, double demand, double &fromI, double &quantity,std::shared_ptr<LinearPiece> Cpre,double inventory);

    bool solve();
    bool solve_stockout();
    ~LotSizingSolver();
};


#endif //IRP_LOTSIZINGSOLVER_H