Abstract
Karnik–Mendel(KM) algorithm and its enhancements are among the most popular type reduction algorithms in the literature. Enhanced KM (EKM) algorithm is computationally fast and can quickly locate left and right switch points in just a few iteration. This paper proposes a subtle yet very effective modification to EKM algorithm to further improve its computational requirement. The modification relates to how the initial right switch point is determined. Comprehensive simulation results for different cases and scenarios provide the statistical proof for the validity of conclusions drawn on the superiority of the proposed initialization compared to initialization used in the original EKM algorithm. The superiority is quantitatively measured in the number of saved iterations and convergence speed.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
