Interval Type-2 Fuzzy Vendor Managed Inventory System and Its Solution with Particle Swarm Optimization

Author(s):  
Zubair Ashraf ◽  
Deepika Malhotra ◽  
Pranab K. Muhuri ◽  
Q. M. Danish Lohani
2020 ◽  
Vol 10 (9) ◽  
pp. 3041
Author(s):  
Cheng-Jian Lin ◽  
Shiou-Yun Jeng ◽  
Hsueh-Yi Lin ◽  
Cheng-Yi Yu

In this study, we proposed an interval type-2 fuzzy neural network (IT2FNN) based on an improved particle swarm optimization (PSO) method for prediction and control applications. The noise-suppressing ability of the proposed IT2FNN was superior to that of the traditional type-1 fuzzy neural network. We proposed dynamic group cooperative particle swarm optimization (DGCPSO) with superior local search ability to overcome the local optimum problem of traditional PSO. The proposed model and related algorithms were verified through the accuracy of prediction and wall-following control of a mobile robot. Supervised learning was used for prediction, and reinforcement learning was used to achieve wall-following control. The experimental results demonstrated that DGCPSO exhibited superior prediction and wall-following control.


Author(s):  
Hung Quoc Truong ◽  
◽  
Long Thanh Ngo ◽  
Long The Pham

The interval type-2 fuzzy possibilistic C-means clustering (IT2FPCM) algorithm improves the performance of the fuzzy possibilistic C-means clustering (FPCM) algorithm by addressing high degrees of noise and uncertainty. However, the IT2FPCM algorithm continues to face drawbacks including sensitivity to cluster centroid initialization, slow processing speed, and the possibility of being easily trapped in local optima. To overcome these drawbacks and better address noise and uncertainty, we propose an IT2FPCM method based on granular gravitational forces and particle swarm optimization (PSO). This method is based on the idea of gravitational forces grouping the data points into granules and then processing clusters on a granular space using a hybrid algorithm of the IT2FPCM and PSO algorithms. The proposed method also determines the initial centroids by merging granules until the number of granules is equal to the number of clusters. By reducing the elements in the granular space, the proposed algorithms also significantly improve performance when clustering large datasets. Experimental results are reported on different datasets compared with other approaches to demonstrate the advantages of the proposed method.


Sign in / Sign up

Export Citation Format

Share Document