14,976 research outputs found

    Optimisation of Mobile Communication Networks - OMCO NET

    Get PDF
    The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

    Metaheuristic design of feedforward neural networks: a review of two decades of research

    Get PDF
    Over the past two decades, the feedforward neural network (FNN) optimization has been a key interest among the researchers and practitioners of multiple disciplines. The FNN optimization is often viewed from the various perspectives: the optimization of weights, network architecture, activation nodes, learning parameters, learning environment, etc. Researchers adopted such different viewpoints mainly to improve the FNN's generalization ability. The gradient-descent algorithm such as backpropagation has been widely applied to optimize the FNNs. Its success is evident from the FNN's application to numerous real-world problems. However, due to the limitations of the gradient-based optimization methods, the metaheuristic algorithms including the evolutionary algorithms, swarm intelligence, etc., are still being widely explored by the researchers aiming to obtain generalized FNN for a given problem. This article attempts to summarize a broad spectrum of FNN optimization methodologies including conventional and metaheuristic approaches. This article also tries to connect various research directions emerged out of the FNN optimization practices, such as evolving neural network (NN), cooperative coevolution NN, complex-valued NN, deep learning, extreme learning machine, quantum NN, etc. Additionally, it provides interesting research challenges for future research to cope-up with the present information processing era

    Multi-Objective Big Data Optimization with jMetal and Spark

    Get PDF
    Big Data Optimization is the term used to refer to optimization problems which have to manage very large amounts of data. In this paper, we focus on the parallelization of metaheuristics with the Apache Spark cluster computing system for solving multi-objective Big Data Optimization problems. Our purpose is to study the influence of accessing data stored in the Hadoop File System (HDFS) in each evaluation step of a metaheuristic and to provide a software tool to solve these kinds of problems. This tool combines the jMetal multi-objective optimization framework with Apache Spark. We have carried out experiments to measure the performance of the proposed parallel infrastructure in an environment based on virtual machines in a local cluster comprising up to 100 cores. We obtained interesting results for computational e ort and propose guidelines to face multi-objective Big Data Optimization problems.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech

    Digital Ecosystems: Ecosystem-Oriented Architectures

    Full text link
    We view Digital Ecosystems to be the digital counterparts of biological ecosystems. Here, we are concerned with the creation of these Digital Ecosystems, exploiting the self-organising properties of biological ecosystems to evolve high-level software applications. Therefore, we created the Digital Ecosystem, a novel optimisation technique inspired by biological ecosystems, where the optimisation works at two levels: a first optimisation, migration of agents which are distributed in a decentralised peer-to-peer network, operating continuously in time; this process feeds a second optimisation based on evolutionary computing that operates locally on single peers and is aimed at finding solutions to satisfy locally relevant constraints. The Digital Ecosystem was then measured experimentally through simulations, with measures originating from theoretical ecology, evaluating its likeness to biological ecosystems. This included its responsiveness to requests for applications from the user base, as a measure of the ecological succession (ecosystem maturity). Overall, we have advanced the understanding of Digital Ecosystems, creating Ecosystem-Oriented Architectures where the word ecosystem is more than just a metaphor.Comment: 39 pages, 26 figures, journa

    A Parallel Surrogate Model Assisted Evolutionary Algorithm for Electromagnetic Design Optimization

    Get PDF
    Optimization efficiency is a major challenge for electromagnetic (EM) device, circuit, and machine design. Although both surrogate model-assisted evolutionary algorithms (SAEAs) and parallel computing are playing important roles in addressing this challenge, there is little research that investigates their integration to benefit from both techniques. In this paper, a new method, called parallel SAEA for electromagnetic design (PSAED), is proposed. A state-of-the-art SAEA framework, surrogate model-aware evolutionary search, is used as the foundation of PSAED. Considering the landscape characteristics of EM design problems, three differential evolution mutation operators are selected and organized in a particular way. A new SAEA framework is then proposed to make use of the selected mutation operators in a parallel computing environment. PSAED is tested by a micromirror and a dielectric resonator antenna as well as four mathematical benchmark problems of various complexity. Comparisons with state-of-the-art methods verify the advantages of PSAED in terms of efficiency and optimization capacity

    Building and investigating generators' bidding strategies in an electricity market

    Get PDF
    In a deregulated electricity market environment, Generation Companies (GENCOs) compete with each other in the market through spot energy trading, bilateral contracts and other financial instruments. For a GENCO, risk management is among the most important tasks. At the same time, how to maximise its profit in the electricity market is the primary objective of its operations and strategic planning. Therefore, to achieve the best risk-return trade-off, a GENCO needs to determine how to allocate its assets. This problem is also called portfolio optimization. This dissertation presents advanced techniques for generator strategic bidding, portfolio optimization, risk assessment, and a framework for system adequacy optimisation and control in an electricity market environment. Most of the generator bidding related problems can be regarded as complex optimisation problems. In this dissertation, detailed discussions of optimisation methods are given and a number of approaches are proposed based on heuristic global optimisation algorithms for optimisation purposes. The increased level of uncertainty in an electricity market can result in higher risk for market participants, especially GENCOs, and contribute significantly to the drivers for appropriate bidding and risk management tasks for GENCOs in the market. Accordingly, how to build an optimal bidding strategy considering market uncertainty is a fundamental task for GENCOs. A framework of optimal bidding strategy is developed out of this research. To further enhance the effectiveness of the optimal bidding framework; a Support Vector Machine (SVM) based method is developed to handle the incomplete information of other generators in the market, and therefore form a reliable basis for a particular GENCO to build an optimal bidding strategy. A portfolio optimisation model is proposed to maximise the return and minimise the risk of a GENCO by optimally allocating the GENCO's assets among different markets, namely spot market and financial market. A new market pnce forecasting framework is given In this dissertation as an indispensable part of the overall research topic. It further enhances the bidding and portfolio selection methods by providing more reliable market price information and therefore concludes a rather comprehensive package for GENCO risk management in a market environment. A detailed risk assessment method is presented to further the price modelling work and cover the associated risk management practices in an electricity market. In addition to the issues stemmed from the individual GENCO, issues from an electricity market should also be considered in order to draw a whole picture of a GENCO's risk management. In summary, the contributions of this thesis include: 1) a framework of GENCO strategic bidding considering market uncertainty and incomplete information from rivals; 2) a portfolio optimisation model achieving best risk-return trade-off; 3) a FIA based MCP forecasting method; and 4) a risk assessment method and portfolio evaluation framework quantifying market risk exposure; through out the research, real market data and structure from the Australian NEM are used to validate the methods. This research has led to a number of publications in book chapters, journals and refereed conference proceedings

    Ensemble Differential Evolution with Simulation-Based Hybridization and Self-Adaptation for Inventory Management Under Uncertainty

    Full text link
    This study proposes an Ensemble Differential Evolution with Simula-tion-Based Hybridization and Self-Adaptation (EDESH-SA) approach for inven-tory management (IM) under uncertainty. In this study, DE with multiple runs is combined with a simulation-based hybridization method that includes a self-adaptive mechanism that dynamically alters mutation and crossover rates based on the success or failure of each iteration. Due to its adaptability, the algorithm is able to handle the complexity and uncertainty present in IM. Utilizing Monte Carlo Simulation (MCS), the continuous review (CR) inventory strategy is ex-amined while accounting for stochasticity and various demand scenarios. This simulation-based approach enables a realistic assessment of the proposed algo-rithm's applicability in resolving the challenges faced by IM in practical settings. The empirical findings demonstrate the potential of the proposed method to im-prove the financial performance of IM and optimize large search spaces. The study makes use of performance testing with the Ackley function and Sensitivity Analysis with Perturbations to investigate how changes in variables affect the objective value. This analysis provides valuable insights into the behavior and robustness of the algorithm.Comment: 15 pages, 6 figures, AsiaSIM 2023 (Springer

    Robust Energy Consumption Prediction with a Missing Value-Resilient Metaheuristic-based Neural Network in Mobile App Development

    Full text link
    Energy consumption is a fundamental concern in mobile application development, bearing substantial significance for both developers and end-users. Moreover, it is a critical determinant in the consumer's decision-making process when considering a smartphone purchase. From the sustainability perspective, it becomes imperative to explore approaches aimed at mitigating the energy consumption of mobile devices, given the significant global consequences arising from the extensive utilisation of billions of smartphones, which imparts a profound environmental impact. Despite the existence of various energy-efficient programming practices within the Android platform, the dominant mobile ecosystem, there remains a need for documented machine learning-based energy prediction algorithms tailored explicitly for mobile app development. Hence, the main objective of this research is to propose a novel neural network-based framework, enhanced by a metaheuristic approach, to achieve robust energy prediction in the context of mobile app development. The metaheuristic approach here plays a crucial role in not only identifying suitable learning algorithms and their corresponding parameters but also determining the optimal number of layers and neurons within each layer. To the best of our knowledge, prior studies have yet to employ any metaheuristic algorithm to address all these hyperparameters simultaneously. Moreover, due to limitations in accessing certain aspects of a mobile phone, there might be missing data in the data set, and the proposed framework can handle this. In addition, we conducted an optimal algorithm selection strategy, employing 13 metaheuristic algorithms, to identify the best algorithm based on accuracy and resistance to missing values. The comprehensive experiments demonstrate that our proposed approach yields significant outcomes for energy consumption prediction.Comment: The paper is submitted to a related journa

    Knowledge management overview of feature selection problem in high-dimensional financial data: Cooperative co-evolution and Map Reduce perspectives

    Get PDF
    The term big data characterizes the massive amounts of data generation by the advanced technologies in different domains using 4Vs volume, velocity, variety, and veracity-to indicate the amount of data that can only be processed via computationally intensive analysis, the speed of their creation, the different types of data, and their accuracy. High-dimensional financial data, such as time-series and space-Time data, contain a large number of features (variables) while having a small number of samples, which are used to measure various real-Time business situations for financial organizations. Such datasets are normally noisy, and complex correlations may exist between their features, and many domains, including financial, lack the al analytic tools to mine the data for knowledge discovery because of the high-dimensionality. Feature selection is an optimization problem to find a minimal subset of relevant features that maximizes the classification accuracy and reduces the computations. Traditional statistical-based feature selection approaches are not adequate to deal with the curse of dimensionality associated with big data. Cooperative co-evolution, a meta-heuristic algorithm and a divide-And-conquer approach, decomposes high-dimensional problems into smaller sub-problems. Further, MapReduce, a programming model, offers a ready-To-use distributed, scalable, and fault-Tolerant infrastructure for parallelizing the developed algorithm. This article presents a knowledge management overview of evolutionary feature selection approaches, state-of-The-Art cooperative co-evolution and MapReduce-based feature selection techniques, and future research directions
    corecore