groff_heuristic.py

import numpy as np


class GroffHeuristic:
    def __init__(self):
        pass

    def run(self, dict_in, demand):
        # Füllen der Variablen aus Start_Dictionary
        dem = demand
        kf = dict_in["fixedCost"]
        kv = dict_in["varCost"]
        pp = len(dem)
        orders = [0 for i in range(pp)]
        cost_v = 0
        j = 0
        p = 0
        criterion = (2 * kf) / kv

        # testen ob "Null-Perioden am Anfang vorliegen
        while dem[p] == 0:
            orders[p] = 0
            p = p + 1
            if p == pp:
                p = p - 1
                break
        i = p

        while p < pp:
            for i in range(p, pp):
                crit_met = False
                if dem[i] * j * ((i - p) + 1) <= criterion:
                    orders[p] += dem[i]
                    crit_met = True
                    cost = dem[i] * kv * (i - p)
                    j = j + 1
                    cost_v = cost + cost_v
                else:
                    break
            if (p == (pp - 1)) or (crit_met and i == (pp - 1)):
                break
            j = 0
            p += i - p
        x = orders.count(0)
        fix = (pp - x) * kf
        print(fix)
        total_c = cost_v + fix
        print("total cost: " + str(total_c))
        print(sum(orders))
        return np.array(orders)


if __name__ == "__main__":
    # statisches Test dictionary
    dict_in = {
        "planningPeriod": 8,  # Anzahl der Perioden
        "fixedCost": 40,  # Bestellkosten
        "varCost": 1,  # Lagerhaltungssatz
        "roll": 4,
    }

    demand = [40, 50, 10, 20, 30, 40, 20, 25]
    # demand = [0, 0, 0, 10, 0, 1]
    # demand = [0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0]
    # demand = [20, 50, 10, 50, 50, 10, 20, 40, 20, 30]
    # demand = [854, 1021, 984, 1030, 1240, 1178, 905, 1005, 958, 905, 966, 965, 1030, 1111, 1285, 1089, 959, 920]
    # demand = [300, 5001, 6022, 6103, 3533, 4046, 3044, 3023, 4064, 9552, 3960, 5077, 4000, 4000, 3430, 300, 3400, 3440,
    #          200, 3400, 9400, 4340, 3400, 300, 3040, 4000, 5000, 6500, 45454, 4443, 3244, 2334, 344, 3223, 2999, 4000, 4000,
    #          4000, 3400, 0, 0, 0, 4500, 400, 4500, 3400, 5400, 3000, 600, 0, 4500, 0, 0, 555, 4540, 500, 800,
    #          4555, 3000, 4555, 455, 3444, 4333, 2344, 4454, 4555, 3444]
    # demand = [0, 0, 6022, 6103, 3533, 4046, 3044, 3023, 4064, 9552, 3960,
    # 5077, 4000, 4000, 3430, 300, 3400, 3440, 200,
    #         3400, 9400, 4340, 3400, 300, 3040, 4000, 5000, 6500, 45454,
    #         4443, 3244, 2334, 344, 3223, 2999, 4000, 4000,
    #         4000, 3400, 3400, 3444, 5006, 4500, 400, 4500, 3400, 5400, 0,
    #         0, 0, 4500, 4500, 4400, 555, 4540, 0, 0,
    #         4555, 3000, 4555, 455, 3444, 4333, 2344, 4454, 4555, 3444]

    groff = GroffHeuristic()
    output = groff.run(dict_in, demand)
    print(output)