In this paper, an innovative hybrid recursive particle swarm optimization (HRPSO) learning algorithm with normalized fuzzy cmean (NFCM) clustering, particle swarm optimization (PSO) and recursive least-squares (RLS) is proposed to generate radial basis function networks (RBFNs) modeling system with small numbers of descriptive radial basis functions (RBFs) for fast approximating two complex and...

the traveling salesman problem (tsp) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. the tsp is probably the most famous and extensively studied problem in the field of combinatorial optimization. because this problem is an np-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

the markowitz’s optimization problem is considered as a standard quadratic programming problem that has exact mathematical solutions. considering real world limits and conditions, the portfolio optimization problem is a mixed quadratic and integer programming problem for which efficient algorithms do not exist. therefore, the use of meta-heuristic methods such as neural networks and evolutionar...

  This article investigates integrated production-inventory models with backorder. A single supplier and a single buyer are considered and shortage as backorder is allowed for the buyer. The proposed models determine optimal order quantity, optimal backorder quantity and optimal number of deliveries on the joint total cost for both buyer and supplier. Two cases are discussed: single-setup-singl...

Many real-world phenomena can be modelled as dynamic optimization problems. In such cases, the environment problem changes dynamically and therefore, conventional methods are not capable of dealing with such problems. In this paper, a novel multi-swarm cellular particle swarm optimization algorithm is proposed by clustering and local search. In the proposed algorithm, the search space is partit...

In this paper, a novel text clustering technique is proposed to summarize text documents. The clustering method, so called ‘Ensemble Clustering Method’, combines both genetic algorithms (GA) and particle swarm optimization (PSO) efficiently and automatically to get the best clustering results. The summarization with this clustering method is to effectively avoid the redundancy in the summarized...

It has been proved by several researchers that particle swarm optimization has shown better results for clustering large datasets. In this paper we present a different approach to that of conventional particle swarm optimization technique. We have used aiNet algorithm of Artificial Immune System(AIS) to preprocess the data i.e. generating the antibodies with more affinity values among different...

in this study, the stochastic cell formation problem with developing model within queuing theory with stochastic demand, processing time and reliability has been presented. machine as server and part as customer are assumed where servers should service to customers. since, the cell formation problem is np-hard, therefore, deterministic methods need a long time to solve this model. in this study...

in this paper, simultaneous placement of distributed generation, capacitor bank and protective devices are utilized to improve the efficiency of the distribution network. the objectives of the problem are reduction of active and reactive power losses, improvement of voltage profile and reliability indices and increasing distribution companies’ profit. the combination of firefly algorithm, parti...

Recently, the scheduling problem in distributed data-intensive computing environments has been an active research topic. This Chapter models the scheduling problem for work-flow applications in distributed dataintensive computing environments (FDSP) and makes an attempt to formulate the problem. Several meta-heuristics inspired from particle swarm optimization algorithm are proposed to formulat...