{"title":"A Stackelberg Game Approach to maximise electricity retailer's profit and minimse customers' bills for future smart grid","authors":"Fanlin Meng, Xiao-Jun Zeng","doi":"10.1109/UKCI.2012.6335772","DOIUrl":"https://doi.org/10.1109/UKCI.2012.6335772","url":null,"abstract":"This paper proposes a Stackelberg Game Approach to trade-off between maximising the profit of the retailer and minimising the payment bills of the customers. The electricity retailer determines the retail price and sends the price information to customers through an advanced metering infrastructure. According to the announced price, the customers obtain the optimal scheduling details of the appliances in each household through an optimal residential electricity consumption scheduling framework. Once the scheduling details of appliances in each household are obtained, the retailer can maximise its profit by solving the profit maximisation problem. We model the interactions between the retailer and electricity customers as a 1-leader, N-follower Stackelberg Game. At the leader's side, i.e., for the retailer, we use genetic algorithms to maximise the profit while at the followers side, i.e., for customers, we use linear programming techniques (Simplex Method) to optimise the payment bills. Simulation results show the feasibility of the proposed approach.","PeriodicalId":444902,"journal":{"name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128267988","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Hybridizing genetic algorithms and hill climbing for similarity aggregation in ontology matching","authors":"G. Acampora, U. Kaymak, V. Loia, A. Vitiello","doi":"10.1109/UKCI.2012.6335775","DOIUrl":"https://doi.org/10.1109/UKCI.2012.6335775","url":null,"abstract":"Ontology Matching aims at finding correspondences between two different ontologies with overlapping parts in order to bring them into a mutual agreement. The set of correspondences, called alignment, is obtained by computing an aggregated similarity value for all pairs of ontology entities through a weighted approach. Unfortunately, the similarity aggregation task is a very complex optimization process, above all, when no information is known about ontology characteristics. This work presents a hybrid approach which aims at efficiently optimizing the weights for the similarity aggregation task without knowing a priori the ontology features. The effectiveness of our approach is shown by aligning ontologies belonging to the well-known OAEI benchmark dataset and by executing a comparison based on the Wilcoxon's signed rank test which highlights that our proposal statistically outperforms both its genetic counterpart and a traditional no evolutionary approach.","PeriodicalId":444902,"journal":{"name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126402420","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Meta-Lamarckian learning in three stage optimal memetic exploration","authors":"Ferrante Neri, Matthieu Weber, Fabio Caraffini, Ilpo Poikolainen","doi":"10.1109/UKCI.2012.6335770","DOIUrl":"https://doi.org/10.1109/UKCI.2012.6335770","url":null,"abstract":"Three Stage Optimal Memetic Exploration (3SOME) is a single-solution optimization algorithm where the coordinated action of three distinct operators progressively perturb the solution in order to progress towards the problem's optimum. In the fashion of Memetic Computing, 3SOME is designed as an organized structure where the three operators interact by means of a success/failure logic. This simple sequential structure is an initial example of Memetic Computing approach generated by means of a bottom-up logic. This paper compares the 3SOME structure with a popular adaptive technique for Memetic Algorithms, namely Meta-Lamarckian learning. The resulting algorithm, Meta-Lamarckian Three Stage Optimal Memetic Exploration (ML3SOME) is thus composed of the same three 3SOME operators but makes use a different coordination logic. Numerical results show that the adaptive technique is overall efficient also in this Memetic Computing context. However, while ML3SOME appears to be clearly better than 3SOME for low dimensionality values, its performance appears to suffer from the curse of dimensionality more than that of the original 3SOME structure.","PeriodicalId":444902,"journal":{"name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122235009","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Fabio Caraffini, Giovanni Iacca, Ferrante Neri, E. Mininno
{"title":"Three variants of three Stage Optimal Memetic Exploration for handling non-separable fitness landscapes","authors":"Fabio Caraffini, Giovanni Iacca, Ferrante Neri, E. Mininno","doi":"10.1109/UKCI.2012.6335767","DOIUrl":"https://doi.org/10.1109/UKCI.2012.6335767","url":null,"abstract":"Three Stage Optimal Memetic Exploration (3SOME) is a recently proposed algorithmic framework which sequentially perturbs a single solution by means of three operators. Although 3SOME proved to be extremely successful at handling high-dimensional multi-modal landscapes, its application to non-separable fitness functions present some flaws. This paper proposes three possible variants of the original 3SOME algorithm aimed at improving its performance on non-separable problems. The first variant replaces one of the 3SOME operators, namely the middle distance exploration, with a rotation-invariant Differential Evolution (DE) mutation scheme, which is applied on three solutions sampled in a progressively shrinking search space. In the second proposed mechanism, a micro-population rotation-invariant DE is integrated within the algorithmic framework. The third approach employs the search logic (1+1)-Covariance Matrix Adaptation Evolution Strategy, aka (1+1)-CMA-ES. In the latter scheme, a Covariance Matrix adapts to the landscape during the optimization in order to determine the most promising search directions. Numerical results show that, at the cost of a higher complexity, the three approaches proposed are able to improve upon 3SOME performance for non-separable problems without an excessive performance deterioration in the other problems.","PeriodicalId":444902,"journal":{"name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125628397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A fast approximative approach for the Vehicle Routing Problem","authors":"Marta Vallejo, P. A. Vargas, D. Corne","doi":"10.1109/UKCI.2012.6335752","DOIUrl":"https://doi.org/10.1109/UKCI.2012.6335752","url":null,"abstract":"In this paper we introduce a three-step heuristic for a complex version of the Vehicle Routing Problem. The Vehicle Routing Problem is focused on the design of optimal delivery routes. A new memory-based approach is developed in order to gather highly valuable experience to predict the best routes in advance. A clustering representation is proposed to allow the system to achieve a simplified abstraction of the model and making use of the pre-existing knowledge to solve more efficiently real instances of the problem. With these elements a new approximative fast approach is developed. The process transforms the VRP in a set of more simple Travelling Salesman Problems which are remarkably easier to solve. A comparison between the results achieved and the application of a genetic algorithm technique is performed. The obtained results demonstrate a noteworthy improvement in terms of performance and time consumption in relation to previous approximative approaches.","PeriodicalId":444902,"journal":{"name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121106897","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Introducing DOWSN: Distributed optimization in wireless sensor networks","authors":"Giovanni Iacca","doi":"10.1109/UKCI.2012.6335776","DOIUrl":"https://doi.org/10.1109/UKCI.2012.6335776","url":null,"abstract":"Driven by a broad range of applications, the Computational Intelligence research community has recently put a growing interest on the emergent technology of Wireless Sensor Networks (WSNs). Due to their distributed structure, WSNs pose several technical challenges caused by local failures, network issues and severely constrained hardware resources. Nevertheless, the possibility to perform an online optimization within WSNs is appealing since it might lead the path to advanced network features like intelligent sensing, distributed modelling, self-optimizing protocols, anomaly detection, etc. just to name a few. In this paper we present DOWSN, a novel Distributed Optimization framework for WSNs. Based on an island model, DOWSN is characterized by a peer-to-peer infrastructure in which each node executes an optimization process and shares pieces of information, i.e. local achievements, with its neighbors. Preliminary experiments show that DOWSN is able to efficiently exploit the communication capabilities and the inherently parallel nature of WSNs, thus finding optimal solutions fast and reliably.","PeriodicalId":444902,"journal":{"name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123708458","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Towards developing 3rd Generation Intelligent Synthetic Composite Indicators","authors":"Ahmad Alshami, Ahmad Lotfi, Simeon Coleman","doi":"10.1109/UKCI.2012.6335759","DOIUrl":"https://doi.org/10.1109/UKCI.2012.6335759","url":null,"abstract":"Synthetic Composite Indicators (SCIs) are assessment tools, usually constructed to evaluate and contrast entities performance, by aggregating abstract issues in many areas such as economy, education, technology and innovation. Most SCIs are built using statistical measures, but the jury is still out regarding their accuracy and effectiveness. This paper is proposing an alternative approach to build a new breed or 3rd Generation Intelligent Synthetic Composite Indicators (3G iSCi) based on computational intelligent methods. The suggested approach utilizes Fuzzy Proximity Knowledge Mining to build the qualitative taxonomy, and Fuzzy C-Means will be used to form the 3G iSCi. It is suggested to cluster related dataset for every single country and detect a cluster centre to act as the aggregated index for that country, which would identify natural homogeneously grouped data, allowing for concise representation of the relationships embedded within the variables. To illustrate, this research uses real variables and data to build a new Unified Intelligent ICT Index (U3I) based on the suggested soft computing methods. The results obtained so far are compared against Principal Components/Factor Analysis (PC/FA), and the Geometric Aggregation (GME), which are widely used statistical methods to weight and aggregate SCIs. The robustness of both techniques are evaluated using Monte Carlo simulation. The results obtained from this case study suggest a novel and intelligent way to build future synthetic composite indicators to better serve international organizations, public officials, decision makers and business leaders.","PeriodicalId":444902,"journal":{"name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133365113","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Feature selection for detecting language levels in L2 English Learners","authors":"Stella Podgornik","doi":"10.1109/UKCI.2012.6335766","DOIUrl":"https://doi.org/10.1109/UKCI.2012.6335766","url":null,"abstract":"This study analyses different features that would enable classifiers to detect language levels in adult second language (L2) English Learners. 46 different speech samples from users speaking 15 different L1 native languages were selected from the Learning Prosody in a Foreign Language (LeaP) corpus [1]. Using different groupings of features from the spoken L2 secondary language (English), a Support Vector Machine (SVM), was trained and the speakers were classified into three different categories: c1, c2, and s1. These categories used correspond to beginner, intermediate, and advanced levels of the target secondary language, English. The categories in the automatic system correspond to the same category names given by the human annotators of the LeaP corpus. The features are grouped into four different sub-categories: sentence, syllable, duration, and pitch. Count features, such as sentence word count, sentence article count, etc. had the greatest influence on the system, while the sentence features had the second most influence. Surprisingly, most of the pitch features had no effect on the accuracy. A small common word list was also used, that proved to be very helpful. The edit distance measure of the sentences with the common words removed had a positive effect; measurable differences could be found with and without the common words included in the sentences. Due to the small size of the training and testing sets, it was found that the different groupings of the L1 languages of the speakers had a significant effect on the accuracy of the classification predictions. Certain combinations of L1 training and test sets had a higher accuracy rating depending on the L1 languages used in training or test. The classification predictions had a variance as much as 40%.","PeriodicalId":444902,"journal":{"name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117231254","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Integrating natural language generation and model-based reasoning for explanation generation","authors":"Donald Matheson, G. Coghill, Somayujulu Sripada","doi":"10.1109/UKCI.2012.6335748","DOIUrl":"https://doi.org/10.1109/UKCI.2012.6335748","url":null,"abstract":"Natural Language Generation (NLG) systems can utilise external reasoning to explain events within a given domain. Most often, these explanations are derived from compiled knowledge such as that found in expert systems, which can lead to gaps in the explanation system's ability to justify the outcome of the reasoner. We propose the use of a deeper knowledge source for explanation generation and show how to utilise a model-based approach that uses first-principles knowledge of the problem domain to generate and justify more in-depth explanations of events in the domain. Our integrated framework of NLG and model-based reasoning makes two contributions: the articulation of model-based reasoning and justification in natural language, and the natural language generation engine exploiting the deeper knowledge available in the underlying model.","PeriodicalId":444902,"journal":{"name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134572182","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Measuring change in fuzzy concept lattices","authors":"T. Martin, N. H. A. Rahim, A. Majidian","doi":"10.1109/UKCI.2012.6335758","DOIUrl":"https://doi.org/10.1109/UKCI.2012.6335758","url":null,"abstract":"The quantity of unstructured and semi-structured data available is growing rapidly. Adding structure to such data (by means of ontologies and tag-based taxonomic classifications) is potentially a very productive approach, which can lead to additional knowledge (e.g. by monitoring association and other relations between classes) as well as enabling more effective use and re-use of online knowledge. Formal concept analysis (and fuzzy formal concept analysis) enables us to identify hierarchical structure arising from similarities in attribute values, giving a starting point for an ontology. However, it is often difficult to determine the “best” attributes to use. Furthermore, in an environment where source data is updated, this data-driven approach may lead to concept lattices which vary in structure. In this paper, we describe a novel way of measuring the distance between concept lattices. The method can be applied to comparison of lattices derived from the same set of objects using different attributes or to different sets of objects categorised by the same attributes. Simple examples are used to illustrate the idea.","PeriodicalId":444902,"journal":{"name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128270622","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}