Integration of non-dispatchable renewable energy sources such as wind and solar into the grid is challenging due to the stochastic nature of energy sources. Hence, electrical hubs (EH) and virtual power plants that co...
详细信息
ISBN:
(纸本)9780791850220
Integration of non-dispatchable renewable energy sources such as wind and solar into the grid is challenging due to the stochastic nature of energy sources. Hence, electrical hubs (EH) and virtual power plants that combine non-dispatchable energy sources, energy storage and dispatchable energy sources such as internal combustion generators and micro gas turbines are getting popular. However, designing such energy systems considering the electricity demand of a neighborhood, curtailments for grid interactions and real time pricing (RTP) of the main utility grid (MUG) is a difficult exercise. Seasonal and hourly variation of electricity demand, potential for each non-dispatchable energy source and RTP of MUG needs to be considered when designing the energy system. Representation of dispatch strategy plays a major role in this process where simultaneous optimization of system design and dispatch strategy is required. This study presents a bi-level dispatch strategy based on reinforced learning for simultaneous optimization of system design and operation strategy of an EH. Artificial Neural Network (ANN) was combined with a finite state controller to obtain the operating state of the system. Pareto optimization is conducted considering, lifecycle cost and system autonomy to obtain optimum system design using evolutionary algorithm.
Energy management system (EMS) is crucial to a plug-in hybrid electric vehicle (PHEV) in reducing its fuel consumption and pollutant emissions. The EMS determines how energy flows in a hybrid powertrain should be mana...
详细信息
ISBN:
(纸本)9781450343237
Energy management system (EMS) is crucial to a plug-in hybrid electric vehicle (PHEV) in reducing its fuel consumption and pollutant emissions. The EMS determines how energy flows in a hybrid powertrain should be managed in response to a variety of driving conditions. In the development of an EMS, the battery state-of-charge (SOC) control strategy plays a critical role. This paper proposes a novel evolutionary algorithm (EA)-based EMS with a self-adaptive SOC control strategy for PHEVs, which can significantly improve the fuel efficiency without knowing the trip length (in time). Numerical studies show that this proposed system can save up to 13% fuel, compared to other on-line EMS with different SOC control strategies. Further analysis indicates that the proposed system is less sensitive to the errors in predicting propulsion power demand in real-time, which is favorable for online implementation. Original publication: X. Qi, G. Wu, K. Boriboonsomsin and M. J. Barth, evolutionary algorithm based online PHEV energy management system with self-adaptive SOC control, Intelligent Vehicles Symposium (IV), 2015 IEEE, Seoul, 2015, pp. 425-430.
In this paper we are continuing in our research to show mutual intersection of two different areas of research: complex network and evolutionary computation. This research parer is focused on possibility to convert ru...
详细信息
ISBN:
(纸本)9781509041237
In this paper we are continuing in our research to show mutual intersection of two different areas of research: complex network and evolutionary computation. This research parer is focused on possibility to convert run of evolution algorithm to a complex network inspired by ants. Such network can then be analyzed to get useful information about algorithm dynamics. In this paper we focused on one global network property, average network strength. This property is described and used for different types of cost functions and different representations of network conversion.
evolutionary Computing for Educational Data Mining is a research field which with the applications of evolutionary algorithms (EAs) to mine, analyze and modify educational data. This paper presents the most relevant s...
详细信息
ISBN:
(纸本)9781509006120
evolutionary Computing for Educational Data Mining is a research field which with the applications of evolutionary algorithms (EAs) to mine, analyze and modify educational data. This paper presents the most relevant studies conducted in this research area. The paper also describes different EAs used for implementing different data mining techniques. It goes on to list how these algorithms are utilized by different educational users to carry out different tasks. Finally, a new combination of EA, Educational User and data mining technique is suggested for implementation. As a part of that a personalized courseware construction technique is proposed and a sample courseware is constructed using the proposed technique. The details about the rule construction and the data mining process involved in the courseware construction techniques are also explained.
Most improvements for Naive Bayes (NB) have a common yet important flaw - these algorithms split the modeling of the classifier into two separate stages - the stage of preprocessing (e.g., feature selection and data e...
详细信息
ISBN:
(纸本)9781509006199
Most improvements for Naive Bayes (NB) have a common yet important flaw - these algorithms split the modeling of the classifier into two separate stages - the stage of preprocessing (e.g., feature selection and data expansion) and the stage of building the NB classifier. The first stage does not take the NB's objective function into consideration, so the performance of the classification cannot be guaranteed. Motivated by these facts and aiming to improve NB with accurate classification, we present a new learning algorithm called evolutionary Local Instance Weighted Naive Bayes or ELWNB, to extend NB for classification. ELWNB combines local NB, instance weighted dataset extension and evolutionary algorithms seamlessly. Experiments on 20 UCI benchmark datasets demonstrate that ELWNB significantly outperforms NB and several other improved NB algorithms.
Decision tree induction is inherently a multi-objective task. However, most of the conventional learning algorithms can only deal with a single-objective that may possibly aggregate multiple objectives. This paper pro...
详细信息
ISBN:
(纸本)9783319490014;9783319490007
Decision tree induction is inherently a multi-objective task. However, most of the conventional learning algorithms can only deal with a single-objective that may possibly aggregate multiple objectives. This paper proposes the multi-objective evolutionary approach to Pareto optimal model trees. We developed a set of non-dominated model trees for a Global Model Tree framework using efficient sort and specialized selection. Performed study covers variants with two and three objectives that relate to the tree error and the tree comprehensibility. Pareto front generated by the GMT system allows the decision maker to select desired output model according to his preferences on the conflicting objectives. Experimental evaluation of the proposed approach is performed on three real-life datasets and is confronted with competitive model tree inducers.
We describe the parallel implementation of an evolutionary programming algorithm for minimization of nonlinear, continuous, real-valued functions of n variables. The parallel implementation was carried using the GPGPU...
详细信息
ISBN:
(纸本)9783319322438;9783319322421
We describe the parallel implementation of an evolutionary programming algorithm for minimization of nonlinear, continuous, real-valued functions of n variables. The parallel implementation was carried using the GPGPU (General-Purpose Computing on Graphics Processing Units) technique. evolutionary programming (EP) was selected from the available evolutionary algorithm paradigms because it presents low dependency between its genetic operators. This feature provided a particular advantage to parallelize the mutation and evaluation stages in EP using a master-slave model. The obtained results report a linear speed up with respect to the number of cores in the test platform.
In this paper, we proposed a Competitive QUasi-Affine TRansformation evolutionary (C-QUATRE) algorithm. This algorithm is an advancement of a preciously proposed QUATRE algorithm. The QUATRE algorithm is arguably a ve...
详细信息
ISBN:
(纸本)9781509018970
In this paper, we proposed a Competitive QUasi-Affine TRansformation evolutionary (C-QUATRE) algorithm. This algorithm is an advancement of a preciously proposed QUATRE algorithm. The QUATRE algorithm is arguably a very powerful stochastic optimization algorithm, and it will appear in CEC2016 conference proceedings with the paper title "QUasi-Affine TRansformation evolutionary (QUATRE) Algorithm: A Parameter-reduced Differential Evolution Algorithm for Optimization Problem". It conquers some weaknesses of Differential Evolution (DE) algorithm and it has excellent performance even on multi-modal optimization problem. Here in the paper, we advance a C-QUATRE algorithm which uses a pairwise competition mechanism to enhance the performance of the former proposed QUATRE algorithm. The C-QUATRE algorithm is verified both on CEC2013 test suite for real-parameter optimization and BBOB2009 framework for black-box optimization, and experiment results show that the pairwise competition mechanism is very useful for the enhancement of the QUATRE performance over all these benchmarks.
evolutionary computation (EC) has gained increasing popularity in dealing with permutation-based combinatorial optimization problems (PCOPs). Traditionally, EC focuses on solving a single optimization task at a time. ...
详细信息
ISBN:
(纸本)9781509025978
evolutionary computation (EC) has gained increasing popularity in dealing with permutation-based combinatorial optimization problems (PCOPs). Traditionally, EC focuses on solving a single optimization task at a time. However, in complex multi-echelon supply chain networks (SCNs), there usually exist various kinds of PCOPs at the same time, e.g., travel salesman problem (TSP), job-shop scheduling problem (JSP), etc. So, it is desirable to solve several PCOPs at once with both effectiveness and efficiency. Very recently, a new paradigm in EC, namely, multifactorial optimization (MFO) has been introduced to explore the potential of evolutionary multitasking, which can serve the purpose of simultaneously optimizing multiple PCOPs in SCNs. In this paper, the evolutionary multitasking of PCOPs is studied. In particular, based on a recently proposed multitasking engine known as the multifactorial evolutionary algorithm (MFEA), two novel mechanisms, namely, a new unified representation and a new survivor selection procedure, are introduced to better adapt to PCOPs. Experimental results obtained on well-known benchmark problems not only show the benefits of the two new mechanisms but also verify the promise of evolutionary multitasking for PCOPs. In addition, the results on a test case involving four optimization tasks demonstrate the potential scalability of evolutionary multitasking to many-task environments.
In the Semantic Web, OWL ontologies play the key role of domain conceptualizations, while the corresponding assertional knowledge is given by the heterogeneousWeb resources referring to them. However, being strongly d...
详细信息
ISBN:
(纸本)9783319490045;9783319490038
In the Semantic Web, OWL ontologies play the key role of domain conceptualizations, while the corresponding assertional knowledge is given by the heterogeneousWeb resources referring to them. However, being strongly decoupled, ontologies and assertional knowledge can be out of sync. In particular, an ontology may be incomplete, noisy, and sometimes inconsistent with the actual usage of its conceptual vocabulary in the assertions. Despite of such problematic situations, we aim at discovering hidden knowledge patterns from ontological knowledge bases, in the form of multi-relational association rules, by exploiting the evidence coming from the (evolving) assertional data. The final goal is to make use of such patterns for (semi-) automatically enriching/completing existing ontologies. An evolutionary search method applied to populated ontological knowledge bases is proposed for the purpose. The method is able to mine intensional and assertional knowledge by exploiting problemaware genetic operators, echoing the refinement operators of inductive logic programming, and by taking intensional knowledge into account, which allows to restrict the search space and direct the evolutionary process. The discovered rules are represented in SWRL, so that they can be straightforwardly integrated within the ontology, thus enriching its expressive power and augmenting the assertional knowledge that can be derived from it. Discovered rules may also suggest new (schema) axioms to be added to the ontology. We performed experiments on publicly available ontologies, validating the performances of our approach and comparing them with the main state-of-the-art systems.
暂无评论