Binary artificial algae algorithm for multidimensional knapsack problems

A Memetic Algorithm Based on Probability Learning for Solving the Multidimensional Knapsack Problem

The multidimensional knapsack problem (MKP) is a well-known combinatorial optimization problem with many real-life applications. In this article, a memetic algorithm based on probability learning (MA/PL) is proposed to solve MKP. The main highlights of this article are two-fold: 1) problem-dependent heuristics for MKP and 2) a novel framework of MA/PL. For the problem-dependent heuristics, we first propose two kinds of logarithmic utility functions (LUFs) based on the special structure of MKP, in which the profit value and weight vector of each item are considered simultaneously. Then, LUFs are applied to effectively guide the repair operator for infeasible solutions and the local search operator. For the framework of MA/PL, we propose two problem-dependent probability distributions to extract the special knowledge of MKP, that is, the marginal probability distribution (MPD) of each item and the joint probability distribution (JPD) of two conjoint items. Next, learning rules for MPD and JPD, which borrow ideas from competitive learning and binary Markov chain, are proposed. Thereafter, we generate MA/PL's offspring by integrating MPD and JPD, such that the univariate probability information of each item as well as the dependency of conjoint items can be sufficiently used. Results of experiments on 179 benchmark instances and a real-life case study demonstrate the effectiveness and practical values of the proposed MKP.

IoT enabled environmental toxicology for air pollution monitoring using AI techniques

In past decades, the industrial and technological developments have increased exponentially and accompanied by non-judicial and un-sustainable utilization of non-renewable resources. At the same time, the environmental branch of toxicology has gained significant attention in understanding the effect of toxic chemicals on human health. Environmental toxic agents cause several diseases, particularly high risk among children, pregnant women, geriatrics and clinical patients. Since air pollution affects human health and results in increased morbidity and mortality increased the toxicological studies focusing on industrial air pollution absorbed by the common people. Therefore, it is needed to design an automated Environmental Toxicology based Air Pollution Monitoring System. To resolve the limitations of traditional monitoring system and to reduce the overall cost, this paper designs an IoT enabled Environmental Toxicology for Air Pollution Monitoring using Artificial Intelligence technique (ETAPM-AIT) to improve human health. The proposed ETAPM-AIT model includes a set of IoT based sensor array to sense eight pollutants namely NH₃, CO, NO₂, CH₄, CO₂, PM_2.5, temperature and humidity. The sensor array measures the pollutant level and transmits it to the cloud server via gateways for analytic process. The proposed model aims to report the status of air quality in real time by using cloud server and sends an alarm in the presence of hazardous pollutants level in the air. For the classification of air pollutants and determining air quality, Artificial Algae Algorithm (AAA) based Elman Neural Network (ENN) model is used as a classifier, which predicts the air quality in the forthcoming time stamps. The AAA is applied as a parameter tuning technique to optimally determine the parameter values of the ENN model. In-order to examine the air quality monitoring performance of the proposed ETAPM-AIT model, an extensive set of simulation analysis is performed and the results are inspected in 5, 15, 30 and 60 min of duration respectively. The experimental outcome highlights the optimal performance of the proposed ETAPM-AIT model over the recent techniques.

Hybrid evolutionary optimization for takeaway order selection and delivery path planning utilizing habit data

The last years have seen a rapid growth of the takeaway delivery market, which has provided a lot of jobs for deliverymen. However, increasing numbers of takeaway orders and the corresponding pickup and service points have made order selection and path planning a key challenging problem to deliverymen. In this paper, we present a problem integrating order selection and delivery path planning for deliverymen, the objective of which is to maximize the revenue per unit time subject to maximum delivery path length, overdue penalty, reward/penalty for large/small number of orders, and high customer scoring reward. Particularly, we consider uncertain order ready time and customer satisfaction level, which are estimated based on historical habit data of stores and customers using a machine-learning approach. To efficiently solve this problem, we propose a hybrid evolutionary algorithm, which adapts the water wave optimization (WWO) metaheuristic to evolve solutions to the main order selection problem and employs tabu search to route the delivery path for each order selection solution. Experimental results on test instances constructed based on real food delivery application data demonstrate the performance advantages of the proposed algorithm compared to a set of popular metaheuristic optimization algorithms.

A db-Scan Hybrid Algorithm: An Application to the Multidimensional Knapsack Problem

This article proposes a hybrid algorithm that makes use of the db-scan unsupervised learning technique to obtain binary versions of continuous swarm intelligence algorithms. These binary versions are then applied to large instances of the well-known multidimensional knapsack problem. The contribution of the db-scan operator to the binarization process is systematically studied. For this, two random operators are built that serve as a baseline for comparison. Once the contribution is established, the db-scan operator is compared with two other binarization methods that have satisfactorily solved the multidimensional knapsack problem. The first method uses the unsupervised learning technique k-means as a binarization method. The second makes use of transfer functions as a mechanism to generate binary versions. The results show that the hybrid algorithm using db-scan produces more consistent results compared to transfer function (TF) and random operators.