Patterson–LaForge IPPA

Patterson–LaForge IPPA

Class: ULSAlgorithms.Heuristics.PattersonLaForgeIncrementalPartPeriodSolver

Family: Part-period
Time: O(T)
Memory: O(T)
Applicability: Stationary setup, production and relevant holding costs

Description

Patterson–LaForge IPPA is a fast ULS heuristic in the Part-period family. It constructs a feasible replenishment plan without claiming an optimality proof. Use it only when the documented applicability conditions match the instance.

Minimal API

IUlsSolver solver = new PattersonLaForgeIncrementalPartPeriodSolver();
UlsSolveResult result = solver.Solve(problem);

Scientific source

Patterson & LaForge (1985), The Incremental Part-Period Algorithm: An Alternative to EOQ, Journal of Purchasing and Materials Management 21(2), 28-33

Full class reference

Use the Doxygen Classes index for constructors, members and source-level documentation.