A modified micro genetic algorithm for undertaking multi-objective optimization problems

In this paper, a Modified micro Genetic Algorithm (MmGA) is proposed for undertaking Multi-objective Optimization Problems (MOPs). An NSGA-II inspired elitism strategy and a population initialization strategy are embedded into the traditional micro Genetic Algorithm (mGA) to form the proposed MmGA. The main aim of the MmGA is to improve its convergence rate towards the pareto optimal solutions. To evaluate the effectiveness of the MmGA, two experiments using the Kursawe test function in MOPs are conducted, and the results are compared with those from other approaches using a multi-objective evolutionary algorithm indicator, i.e. the Generational Distance (GD). The outcomes positively demonstrate that the MmGA is able to provide useful solutions with improved GD measures for tackling MOPs.

A multi-objective sensitivity approach to training providers' evaluation and quota allocation planning

The practice of solely relying on the human resources department in the selection process of external training providers has cast doubts and mistrust across other departments as to how trainers are sourced. There are no measurable criteria used by human resource personnel, since most decisions are based on intuitive experience and subjective market knowledge. The present problem focuses on outsourcing of private training programs that are partly government funded, which has been facing accountability challenges. Due to the unavailability of a scientific decision-making approach in this context, a 12-step algorithm is proposed and tested in a Japanese multinational company. The model allows the decision makers to revise their criteria expectations, in turn witnessing the change of the training providers' quota distribution. Finally, this multi-objective sensitivity analysis provides a forward-looking approach to training needs planning and aids decision makers in their sourcing strategy.

Multi-objective image segmentation with an interactive evolutionary computation approach

In this paper, a multi-objective image segmentation approach with an Interactive Evolutionary Computation (IEC)-based framework is presented. Two objectives, i.e., the overall deviation and the connectivity measure, are optimized simultaneously using a mu

A multi-objective ant colony optimization algorithm based on the physarum-inspired mathematical model

Multi-objective traveling salesman problem (MOTSP) is an important field in operations research, which has wide applications in the real world. Multi-objective ant colony optimization (MOACO) as one of the most effective algorithms has gained popularity for solving a MOTSP. However, there exists the problem of premature convergence in most of MOACO algorithms. With this observation in mind, an improved multiobjective network ant colony optimization, denoted as PMMONACO, is proposed, which employs the unique feature of critical tubes reserved in the network evolution process of the Physarum-inspired mathematical model (PMM). By considering both pheromones deposited by ants and flowing in the Physarum network, PM-MONACO uses an optimized pheromone matrix updating strategy. Experimental results in benchmark networks show that PM-MONACO can achieve a better compromise solution than the original MOACO algorithm for solving MOTSPs.

A novel fuzzy multi-objective framework to construct optimal prediction intervals for wind power forecast

The forecasting behavior of the high volatile and unpredictable wind power energy has always been a challenging issue in the power engineering area. In this regard, this paper proposes a new multi-objective framework based on fuzzy idea to construct optimal prediction intervals (Pis) to forecast wind power generation more sufficiently. The proposed method makes it possible to satisfy both the PI coverage probability (PICP) and PI normalized average width (PINAW), simultaneously. In order to model the stochastic and nonlinear behavior of the wind power samples, the idea of lower upper bound estimation (LUBE) method is used here. Regarding the optimization tool, an improved version of particle swam optimization (PSO) is proposed. In order to see the feasibility and satisfying performance of the proposed method, the practical data of a wind farm in Australia is used as the case study.

Portfolio selection under higher moments using fuzzy multi-objective linear programming

Since asset returns have been recognized as not normally distributed, the avenue of research regarding portfolio higher moments soon emerged. To account for uncertainty and vagueness of portfolio returns as well as of higher moment risks, we proposed a new portfolio selection model employing fuzzy sets in this paper. A fuzzy multi-objective linear programming (MOLP) for portfolio optimization is formulated using marginal impacts of assets on portfolio higher moments, which are modelled by trapezoidal fuzzy numbers. Through a consistent centroid-based ranking of fuzzy numbers, the fuzzy MOLP is transformed into an MOLP that is then solved by the maximin method. By taking portfolio higher moments into account, the approach enables investors to optimize not only the normal risk (variance) but also the asymmetric risk (skewness) and the risk of fat-tails (kurtosis). An illustrative example demonstrates the efficiency of the proposed methodology comparing to previous portfolio optimization models.

Construction of neural network-based prediction intervals using particle swarm optimization

Prediction intervals (PIs) are excellent tools for quantification of uncertainties associated with point forecasts and predictions. This paper adopts and develops the lower upper bound estimation (LUBE) method for construction of PIs using neural network (NN) models. This method is fast and simple and does not require calculation of heavy matrices, as required by traditional methods. Besides, it makes no assumption about the data distribution. A new width-based index is proposed to quantitatively check how much PIs are informative. Using this measure and the coverage probability of PIs, a multi-objective optimization problem is formulated to train NN models in the LUBE method. The optimization problem is then transformed into a training problem through definition of a PI-based cost function. Particle swarm optimization (PSO) with the mutation operator is used to minimize the cost function. Experiments with synthetic and real-world case studies indicate that the proposed PSO-based LUBE method can construct higher quality PIs in a simpler and faster manner.

Classification and optimization of product review information using soft computing models

A soft computing framework to classify and optimize text-based information extracted from customers' product reviews is proposed in this paper. The soft computing framework performs classification and optimization in two stages. Given a set of keywords extracted from unstructured text-based product reviews, a Support Vector Machine (SVM) is used to classify the reviews into two categories (positive and negative reviews) in the first stage. An ensemble of evolutionary algorithms is deployed to perform optimization in the second stage. Specifically, the Modified micro Genetic Algorithm (MmGA) optimizer is applied to maximize classification accuracy and minimize the number of keywords used in classification. Two Amazon product reviews databases are employed to evaluate the effectiveness of the SVM classifier and the ensemble of MmGA optimizers in classification and optimization of product related keywords. The results are analyzed and compared with those published in the literature. The outputs potentially serve as a list of impression words that contains useful information from the customers' viewpoints. These impression words can be further leveraged for product design and improvement activities in accordance with the Kansei engineering methodology.

A multi-objective evolutionary algorithm-based decision support system: a case study on job-shop scheduling in manufacturing

In this paper, an evolutionary algorithm is used for developing a decision support tool to undertake multi-objective job-shop scheduling problems. A modified micro genetic algorithm (MmGA) is adopted to provide optimal solutions according to the Pareto optimality principle in solving multi-objective optimisation problems. MmGA operates with a very small population size to explore a wide search space of function evaluations and to improve the convergence score towards the true Pareto optimal front. To evaluate the effectiveness of the MmGA-based decision support tool, a multi-objective job-shop scheduling problem with actual information from a manufacturing company is deployed. The statistical bootstrap method is used to evaluate the experimental results, and compared with those from the enumeration method. The outcome indicates that the decision support tool is able to achieve those optimal solutions as generated by the enumeration method. In addition, the proposed decision support tool has advantage of achieving the results within a fraction of the time.

Control layer resource management in SDN-IoT networks using multi-objective constraint

Software Defined Networking (SDN) and Internet of Things (IoT) integration has thrown many critical challenges. Specifically, in heterogeneous SDN-IoT ecosystem, optimized resources utilization and effective management at the control layer is very difficult. This mainly affects the application specific Quality of Service (QoS) and energy consumption of the IoT network. Motivated from this, we propose a new Resource Management (RM) method at the control layer, in distributed SDN-IoT networks. This paper starts with reasons that why at control layer RM is more complex in the SDN-IoT ecosystem. After-that, we highlight motivated examples that necessitate to investigate new RM methods in SDN-IoT context. Further, we propose a novel method to compute controller performance. Theoretical analysis is conducted to prove that the proposed method is better than the existing methods.

A GA-PSO layered encoding evolutionary approach to 0/1 knapsack optimization

This paper presents a layered encoding cascade evolutionary approach to solve a 0/1 knapsack optimization problem. A layered encoding structure is proposed and developed based on the schema theorem and the concepts of cascade correlation and multi-population evolutionary algorithms. Genetic algorithm (GA) and particle swarm optimization (PSO) are combined with the proposed layered encoding structure to form a generic optimization model denoted as LGAPSO. In order to enhance the finding of both local and global optimum in the evolutionary search, the model adopts hill climbing evaluation criteria, feature of strength Pareto evolutionary approach (SPEA) as well as nondominated spread lengthen criteria. Four different sizes benchmark knapsack problems are studied using the proposed LGAPSO model. The performance of LGAPSO is compared to that of the ordinary multi-objective optimizers such as VEGA, NSGA, NPGA and SPEA. The proposed LGAPSO model is shown to be efficient in improving the search of knapsack’s optimum, capable of gaining better Pareto trade-off front.