This paper proposes a new real-value mutation operator and a hybrid real-coded genetic algorithm with quasi-simplex technique using this new mutation operator (RCGAQS). Compared with the classical GA (CGA), RCGAQS has the following distinguish features: (1) A new real-value mutation mechanism was used to increase the capability of global search (exploration); (2) The modified simplex technique,...

Optimal distribution substation placement is one of the major components of optimal distribution system planning projects. In this paper optimal substation placement problem is solved using Imperialist Competitive Algorithm (ICA) as a new developed heuristic optimization algorithm. This procedure gives the optimal size, site and installation time of medium voltage substation, using their relate...

In this paper, with the aim of estimating internal dynamics matrix of a gimbaled Inertial Navigation system (as a discrete Linear system), the discretetime Hamilton-Jacobi-Bellman (HJB) equation for optimal control has been extracted. Heuristic Dynamic Programming algorithm (HDP) for solving equation has been presented and then a neural network approximation for cost function and control input ...

The superiority of the dynamic enumeration of all mixed cells suggested by T. Mizutani et al. for the mixed volume computation over the existing methods was reported in [15]. In this article, we embed the idea of dynamic enumeration into our original algorithm for the mixed volume computation presented in [7], and a new algorithm is developed by employing both primal and dual simplex algorithms...

pavement permanent deformations due to lack of shear strength in mixture are a major reason of rutting. any simple test to determine mixtures resistance to permanent deformation isn’t distinguished in the 1st level of superpave mix design method and prevalent methods for evaluating mixture rut resistance are expensive and time-consuming. two aggregate types, gradations, asphalt cements and fill...

imagine you have traveled to an unfamiliar city. before you start your daily tour around the city, you need to know a good route. in network theory (nt), this is the traveling salesman problem (tsp). a dynamic programming algorithm is often used for solving this problem. however, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...

State estimation is the foundation of any control and decision making in power networks. The first requirement for a secure network is a precise and safe state estimator in order to make decisions based on accurate knowledge of the network status. This paper introduces a new estimator which is able to detect bad data with few calculations without need for repetitions and estimation residual cal...

This paper presents a novel computational framework based on dynamic spherical volumetric simplex splines for simulation of genuszero real-world objects. In this framework, we first develop an accurate and efficient algorithm to reconstruct the high-fidelity digital model of a real-world object with spherical volumetric simplex splines which can represent with accuracy geometric, material, and ...