Abstract
A new fuzzy weighted average computation algorithm (NFWA) based on the α-cuts representation of fuzzy numbers is presented in this paper. For each α-cuts, the endpoints of the fuzzy weighted average (FWA) can be calculated from two particular switch points. In the proposed algorithm, these two switch points are computed with an opposite direction searching process, although recursive, which is remarkably efficient. The calculation complexity of the new algorithm is O(n). Experimental result demonstrates that compared with some commonly used FWA algorithms, the new algorithm approach requires the least CPU time, and then may be the fastest available FWA algorithm to date.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
