Multi-Objective Big Data Optimization with jMetal and Spark

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

Addressing the 5G cell switch-off problem with a multi-objective cellular genetic algorithm

© 20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.The power consumption foreseen for 5G networks is expected to be substantially greater than that of 4G systems, mainly because of the ultra-dense deployments required to meet the upcoming traffic demands. This paper deals with a multi- objective formulation of the Cell Switch-Off (CSO) problem, a well-known and effective approach to save energy in such dense scenarios, which is addressed with an accurate, yet rather unknown multi-objective metaheuristic called MOCell (multi- objective cellular genetic algorithm). It has been evaluated over a different set of networks of increasing densification levels. The results have shown that MOCell is able to reach major energy savings when compared to a widely used multi-objective algorithm.TIN2016-75097-P Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech

Pareto optimality in multilayer network growth

We model the formation of multi-layer transportation networks as a multi-objective optimization process, where service providers compete for passengers, and the creation of routes is determined by a multi-objective cost function encoding a trade-off between efficiency and competition. The resulting model reproduces well real-world systems as diverse as airplane, train and bus networks, thus suggesting that such systems are indeed compatible with the proposed local optimization mechanisms. In the specific case of airline transportation systems, we show that the networks of routes operated by each company are placed very close to the theoretical Pareto front in the efficiency-competition plane, and that most of the largest carriers of a continent belong to the corresponding Pareto front. Our results shed light on the fundamental role played by multi-objective optimization principles in shaping the structure of large-scale multilayer transportation systems, and provide novel insights to service providers on the strategies for the smart selection of novel routes

Efficient Hill Climber for Multi-Objective Pseudo-Boolean Optimization

Chicano, F., Whitley D., & Tinós R. (2016). Efficient Hill Climber for Multi-Objective Pseudo-Boolean Optimization. 16th European Conference on Evolutionary Computation for Combinatorial Optimization (LNCS 9595), pp. 88-103Local search algorithms and iterated local search algorithms are a basic technique. Local search can be a stand-alone search method, but it can also be hybridized with evolutionary algorithms. Recently, it has been shown that it is possible to identify improving moves in Hamming neighborhoods for k-bounded pseudo-Boolean optimization problems in constant time. This means that local search does not need to enumerate neighborhoods to find improving moves. It also means that evolutionary algorithms do not need to use random mutation as a operator, except perhaps as a way to escape local optima. In this paper, we show how improving moves can be identified in constant time for multiobjective problems that are expressed as k-bounded pseudo-Boolean functions. In particular, multiobjective forms of NK Landscapes and Mk Landscapes are considered.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech. Fulbright program, Ministerio de Educación (CAS12/00274), Ministerio de Economía y Competitividad (TIN2014-57341-R), Air Force Office of Scientific Research, Air Force Materiel Command, USAF (FA9550-11-1-0088), FAPESP (2015/06462-1) and CNPq

Preliminary design and optimization of toroidally-wound limited angle servo motor based on a generalized magnetic circuit model

This paper proposes a new generalized equivalent magnetic circuit model for the preliminary design of a toroidally-wound limited angle servo motor (LASM). In the model, the magnetic networks are formulated as a function of the pole number and geometric dimensions. Nonlinear saturation effect of the ferromagnetic material is also taken into consideration. A multi-objective optimization function involving the torque requirement, the mass, the time constant, and magnetic saturations of ferromagnetic material is introduced. Based on the proposed model, six design cases with different objectives have been carried by the particle swarm optimization (PSO) method. The comparisons of different optimization cases demonstrate the effectiveness and computation efficiency of the proposed method, and hence its suitability in preliminary design. Moreover, the generalized model can be readily applied in the other electromagnetic modelling

A Multi-Objective Optimization for Supply Chain Network Using the Bees Algorithm

A supply chain is a complex network which involves the products, services and information flows between suppliers and customers. A typical supply chain is composed of different levels, hence, there is a need to optimize the supply chain by finding the optimum configuration of the network in order to get a good compromise between the multi-objectives such as cost minimization and lead-time minimization. There are several multi-objective optimization methods which have been applied to find the optimum solutions set based on the Pareto front line. In this study, a swarm-based optimization method, namely, the bees algorithm is proposed in dealing with the multi-objective supply chain model to find the optimum configuration of a given supply chain problem which minimizes the total cost and the total lead-time. The supply chain problem utilized in this study is taken from literature and several experiments have been conducted in order to show the performance of the proposed model; in addition, the results have been compared to those achieved by the ant colony optimization method. The results show that the proposed bees algorithm is able to achieve better Pareto solutions for the supply chain problem

Statistical and Electrical Features Evaluation for Electrical Appliances Energy Disaggregation

In this paper we evaluate several well-known and widely used machine learning algorithms for regression in the energy disaggregation task. Specifically, the Non-Intrusive Load Monitoring approach was considered and the K-Nearest-Neighbours, Support Vector Machines, Deep Neural Networks and Random Forest algorithms were evaluated across five datasets using seven different sets of statistical and electrical features. The experimental results demonstrated the importance of selecting both appropriate features and regression algorithms. Analysis on device level showed that linear devices can be disaggregated using statistical features, while for non-linear devices the use of electrical features significantly improves the disaggregation accuracy, as non-linear appliances have non-sinusoidal current draw and thus cannot be well parametrized only by their active power consumption. The best performance in terms of energy disaggregation accuracy was achieved by the Random Forest regression algorithm.Peer reviewedFinal Published versio

Hybrid Ventilation System and Soft-Sensors for Maintaining Indoor Air Quality and Thermal Comfort in Buildings

Maintaining both indoor air quality (IAQ) and thermal comfort in buildings along with optimized energy consumption is a challenging problem. This investigation presents a novel design for hybrid ventilation system enabled by predictive control and soft-sensors to achieve both IAQ and thermal comfort by combining predictive control with demand controlled ventilation (DCV). First, we show that the problem of maintaining IAQ, thermal comfort and optimal energy is a multi-objective optimization problem with competing objectives, and a predictive control approach is required to smartly control the system. This leads to many implementation challenges which are addressed by designing a hybrid ventilation scheme supported by predictive control and soft-sensors. The main idea of the hybrid ventilation system is to achieve thermal comfort by varying the ON/OFF times of the air conditioners to maintain the temperature within user-defined bands using a predictive control and IAQ is maintained using Healthbox 3.0, a DCV device. Furthermore, this study also designs soft-sensors by combining the Internet of Things (IoT)-based sensors with deep-learning tools. The hardware realization of the control and IoT prototype is also discussed. The proposed novel hybrid ventilation system and the soft-sensors are demonstrated in a real research laboratory, i.e., Center for Research in Automatic Control Engineering (C-RACE) located at Kalasalingam University, India. Our results show the perceived benefits of hybrid ventilation, predictive control, and soft-sensors

A multi-objective optimization scheduling method based on the ant colony algorithm in cloud computing

Abstract: For task-scheduling problems in cloud computing, a multi-objective optimization method is proposed here. First, with an aim toward the biodiversity of resources and tasks in cloud computing, we propose a resource cost model that defines the demand of tasks on resources with more details. This model reflects the relationship between the user's resource costs and the budget costs. A multi-objective optimization scheduling method has been proposed based on this resource cost model. This method considers the makespan and the user's budget costs as constraints of the optimization problem, achieving multi-objective optimization of both performance and cost. An improved ant colony algorithm has been proposed to solve this problem. Two constraint functions were used to evaluate and provide feedback regarding the performance and budget cost. These two constraint functions made the algorithm adjust the quality of the solution in a timely manner based on feedback in order to achieve the optimal solution. Some simulation experiments were designed to evaluate this method's performance using four metrics: 1) the makespan; 2) cost; 3) deadline violation rate; and 4) resource utilization. Experimental results show that based on these four metrics, a multi-objective optimization method is better than other similar methods, especially as it increased 56.6% in the best case scenario

Radial basis function network based on time variant multi-objective particle swarm optimization for medical diseases diagnosis

This paper proposes an adaptive evolutionary radial basis function (RBF) network algorithm to evolve accuracy and connections (centers and weights) of RBF networks simultaneously. The problem of hybrid learning of RBF network is discussed with the multi-objective optimization methods to improve classification accuracy for medical disease diagnosis. In this paper, we introduce a time variant multi-objective particle swarm optimization (TVMOPSO) of radial basis function (RBF) network for diagnosing the medical diseases. This study applied RBF network training to determine whether RBF networks can be developed using TVMOPSO, and the performance is validated based on accuracy and complexity. Our approach is tested on three standard data sets from UCI machine learning repository. The results show that our approach is a viable alternative and provides an effective means to solve multi-objective RBF network for medical disease diagnosis. It is better than RBF network based on MOPSO and NSGA-II, and also competitive with other methods in the literature