Package org.processmining.earthmoversstochasticconformancechecking.reallocationmatrix.epsa

Class AKPSolverArraySimpleImprov

  • public class AKPSolverArraySimpleImprov
extends java.lang.Object
    A class which performs the AKP algorithm on an array representation of the tree. Internally the tree (basic solution, not necessary feasible) is represented using several arrays. In each step a complete comparison between surplus sources and deficit targets is made.

    Papers:

    • Charalampos Papamanthou, Konstantinos Paparrizos, and Nikolaos Samaras. 2004. Computational experience with exterior point algorithms for the transportation problem. Appl. Math. Comput. 158, 2 (November 2004), 459-475. (AKP algorithm)
    • M.S. Bazaraa, J.J. Jarvis, and H.D. Sherali. Linear Programming and Network Flows. Wiley, 2010, 482-488. (Tree)
    Author:
    brockhoff

    • Field Detail

      • cSrc

        public int cSrc
        Count sources

      • cTar

        public int cTar
        Count targets;

    • Constructor Detail

      • AKPSolverArraySimpleImprov

        public AKPSolverArraySimpleImprov​(StructInitEPSA inst)

    • Method Detail

      • solve

        public double solve​(org.processmining.framework.plugin.ProMCanceller canceller)
        Runs the simplex type algorithm.

      • nextIteration

        public boolean nextIteration()

      • getNextEntering

        public int[] getNextEntering()
        Gets the next entering arc.
        Returns:

      • updateMove2Surplus

        public void updateMove2Surplus​(int root)

      • updateMove2Deficit

        public void updateMove2Deficit​(int root)

      • initInSurTreeArray

        public void initInSurTreeArray()

      • initMinRedCostMemory

        public void initMinRedCostMemory()
        Gets the next entering arc.

      • updateMinRedSrc

        public void updateMinRedSrc​(int tar)

      • isExact

        public boolean isExact()

      • printFinalFlow

        public void printFinalFlow()