19647536
A memetic co-evolutionary differential evolution algorithm for constrained optimization
In this paper, a memetic co-evolutionary differential evolution algorithm (MCODE) for constrained optimization is proposed. Two cooperative populations are constructed and evolved by independent differential evolution (DE) algorithm. The purpose of the first population is to minimize the objective function regardless of constraints, and that of the second population is to minimize the violation of constraints regardless of the objective function. Interaction and migration happens between the two populations when separate evolutions go on for several iterations, by migrating feasible solutions into the first group, and infeasible ones into the second group. Then, a Gaussian mutation is applied to the individuals when the best solution keep unchanged for several generations. The algorithm is tested by five famous benchmark problems, and is compared with methods based on penalty functions, co-evolutionary genetic algorithm (COGA), and co-evolutionary differential evolution algorithm (CODE). The results proved the proposed cooperative MCODE is very effective and efficient.
33407170
Manufacturing Grid: Needs, Concept, and Architecture
As a new approach, grid technology is rapidly used in scientific computing, large-scale data management, and collaborative work. But in the field of manufacturing, the application of grid is just at the beginning. The paper proposes the concept of manufacturing. The needs, definition and architecture of manufacturing gird are discussed, which explains why needs manufacturing grid, what is manufacturing grid and how to construct a manufacturing grid system.
44715797
Constrained Nonlinear State Estimation - A Differential Evolution Based Moving Horizon Approach
A solution is proposed to estimate the states in the nonlinear discrete time system. Moving Horizon Estimation (MHE) is used to obtain the approximated states by minimizing a criterion that is the Euclidean form of the difference between the estimated outputs and the measured ones over a finite time horizon. The differential evolution (DE) algorithm is incorporated into the implementation of MHE in order to solve the optimization problem which is presented as a nonlinear programming problem due to the constraints. The effectiveness of the approach is illustrated in simulated systems that have appeared in the moving horizon estimation literature.
5989425
A New Performance Evaluation Model and AHP-Based Analysis Method in Service-Oriented Workflow
In service-oriented architecture, services and workflows are closely related so that the research on service-oriented workflow attracts the attention of academia. Because of the loosely-coupled, autonomic and dynamic nature of service, the operation and performance evaluation of workflow meet some challenges, such as how to judge the quality of service (QoS) and what is the relation between QoS and workflow performance. In this paper we are going to address these challenges. First the definition of service is proposed, and the characteristics and operation mechanism of service-oriented workflow are presented. Then a service-oriented workflow performance evaluation model is described which combines the performance of the business system and IT system. The key performance indicators (KPI) are also depicted with their formal representation. Finally the improved Analytic Hierarchy Process is brought forward to analyze the correlation between different KPIs and select services.
21860578
An Effective PSO-Based Memetic Algorithm for Flow Shop Scheduling
This paper proposes an effective particle swarm optimization (PSO)-based memetic algorithm (MA) for the permutation flow shop scheduling problem (PFSSP) with the objective to minimize the maximum completion time, which is a typical non-deterministic polynomial-time (NP) hard combinatorial optimization problem. In the proposed PSO-based MA (PSOMA), both PSO-based searching operators and some special local searching operators are designed to balance the exploration and exploitation abilities. In particular, the PSOMA applies the evolutionary searching mechanism of PSO, which is characterized by individual improvement, population cooperation, and competition to effectively perform exploration. On the other hand, the PSOMA utilizes several adaptive local searches to perform exploitation. First, to make PSO suitable for solving PFSSP, a ranked-order value rule based on random key representation is presented to convert the continuous position values of particles to job permutations. Second, to generate an initial swarm with certain quality and diversity, the famous Nawaz-Enscore-Ham (NEH) heuristic is incorporated into the initialization of population. Third, to balance the exploration and exploitation abilities, after the standard PSO-based searching operation, a new local search technique named NEH_1 insertion is probabilistically applied to some good particles selected by using a roulette wheel mechanism with a specified probability. Fourth, to enrich the searching behaviors and to avoid premature convergence, a simulated annealing (SA)-based local search with multiple different neighborhoods is designed and incorporated into the PSOMA. Meanwhile, an effective adaptive meta-Lamarckian learning strategy is employed to decide which neighborhood to be used in SA-based local search. Finally, to further enhance the exploitation ability, a pairwise-based local search is applied after the SA-based search. Simulation results based on benchmarks demonstrate the effectiveness of the PSOMA. Additionally, the effects of some parameters on optimization performances are also discussed
32506945
DE and NLP Based QPLS Algorithm
As a novel evolutionary computing technique, Differential Evolution (DE) has been considered to be an effective optimization method for complex optimization problems, and achieved many successful applications in engineering. In this paper, a new algorithm of Quadratic Partial Least Squares (QPLS) based on Nonlinear Programming (NLP) is presented. And DE is used to solve the NLP so as to calculate the optimal input weights and the parameters of inner relationship. The simulation results based on the soft measurement of diesel oil solidifying point on a real crude distillation unit demonstrate that the superiority of the proposed algorithm to linear PLS and QPLS which is based on Sequential Quadratic Programming (SQP) in terms of fitting accuracy and computational costs.
17844333
Hybrid Algorithm Combining Ant Colony Algorithm with Genetic Algorithm for Continuous Domain
Ant colony algorithm is a kind of new heuristic biological modeling method which has the ability of parallel processing and global searching. By use of the properties of ant colony algorithm and genetic algorithm, the hybrid algorithm which adopts genetic algorithm to distribute the original pheromone is proposed to solve the continuous optimization problem. Several solutions are obtained using the ant colony algorithm through pheromone accumulation and renewal. Finally, by using crossover and mutation operation of genetic algorithm, some effective solutions are obtained. The results of experiments show better performances of the new algorithm based on six continuous test functions compared with the methods available in literature.
44850710
Classification by Association Rule Analysis
An interface between a dual mode mobile station and a piece of data terminal equipment supports both a logical digital interface and a logical analog interface, with the analog interface passing through a modem. At set-up of either a mobile originated or mobile terminated data/fax call, a supporting dual mode communications network determines whether a digital traffic channel is available on an air interface. If so, the channel is allocated to the mobile station, and data/fax communication with the data terminal equipment occurs using the logical digital interface. Otherwise, an analog voice channel is allocated, and the data/fax communication with the data terminal equipment occurs using the logical analog interface and modem. Within the supporting network, data/fax communications via the digital traffic channel are routed through an interworking functionality that terminates a radio link protocol utilized for communicating over the digital air interface. Analog voice channel data/fax communications are instead routed through a modem pool that terminates a selected modem protocol utilized by the modem for communicating over the analog air interface.
29971030
Measuring the meaning in time series clustering of text search queries
We use a combination of proven methods from time series analysis and machine learning to explore the relationship between temporal and semantic similarity in web query logs; we discover that the combination of correlation and cycles is a good, but not perfect, sign of semantic relationship.
159216
A weight based compact genetic algorithm
In order to improve the performance of the compact Genetic Algorithm (cGA) to solve difficult optimization problems, an improved cGA which named as the weight based compact Genetic Algorithm (wcGA) is proposed. In the wcGA, S individuals are generated from the probability vector in each generation, when the winner competing with the other S-1 individuals to update the probability vector, different weights are multiplied to each solution according to the sequence of the solution ranked in the S-1 individuals. Experimental results on three kinds of Benchmark functions show that the proposed algorithm has higher optimal precision than that of the standard cGA and the cGA simulating higher selection pressures.
5516091
An New Global Dynamic Scheduling Algorithm with Multi-Hop Path Splitting and Multi-Pathing Using GridFTP