This paper presents an efficient method for updating the structural finite element model. Model updating is performed through minimizing the difference of recorded acceleration of real damaged structure and hypothetical damaged structure, by updating physical parameters in each phase using iterative process of Levenberg-Marquardt algorithm. This algorithm is based on sensitivity analysis and pr...

periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. this paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (pvrp). the related results of proposed algorithm are compared with the resu...

a new meta-heuristic method, based on neuronal communication (nc), is introduced in this article. the neuronal communication illustrates how data is exchanged between neurons in neural system. actually, this pattern works efficiently in the nature. the present paper shows it is the same to find the global minimum. in addition, since few numbers of neurons participate in each step of the method,...

the power supply of remote sites and applications at minimal cost and with low emissions is an important issue when discussing future energy concepts. this paper presents modeling and optimization of a photovoltaic (pv)/wind/diesel system with batteries storage for electrification to an off-grid remote area located in rafsanjan, iran. for this location, different hybrid systems are studied and ...

A new approach to character recognition problem, based on meta sets, is introduced and developed. For the given compound character pattern consisting of a number of character samples accompanied by their corresponding quality degrees, and for the given testing character sample, the main theorem of the paper gives means to evaluate the correlation between the testing sample and the compound patt...

Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...