LAUSR

Economic load dispatch solutions based on published methods, both conventional and artificial, have been very well-formulated through point-to-point movement methodologies to reach a convergence point. Iteration always starts from the starting point to obtain the following solution point, leading to the convergence point. This paper presents a new method to solve economic load dispatch problems by narrowing the minimum and maximum power limits between generator units. This idea approximates the solution point with a tiny space formed by the very narrow power limits of each generator. The methodology used is the distance between the minimum and maximum power limits of each generator divided into several segments. Then, the best segment is determined by the minimum total cost calculated based on the center point of the segment. Continue to the following iteration process until the best segment is the smallest. This iteration process is another artificial method that works without calculus calculations, so it does not depend on the objective function. This method has been validated using two generator units with differentiable objective functions, with calculation accuracy less than 0.00001 MW of the power distance of the generator limit, and the iteration stops at the $23^{\mathrm {rd}}$ step. Furthermore, this method has been successfully applied to the nondifferentiable objective function, piecewise and valve point effects.