Determining the optimum location of facilities is critical in many fields, particularly in healthcare. This study proposes the application of a suitable location model for field hospitals during the novel coronavirus 2019 (COVID-19) pandemic. The used model is the most appropriate among the threemost common locationmodels utilized to solve healthcare problems (the set covering model, the maximal covering model, and the P-median model). The proposed nonlinear binary constrained model is a slight modification of the maximal covering model with a set of nonlinear constraints. The model is used to

Many application problems are formulated as nonlinear binary programming models which are hard to be solved using exact algorithms especially in large dimensions. One of these practical applications is to optimally distribute protective materials for the newly emerged COVID-19. It is defined for a decision-maker who wants to choose a subset of candidate hospitals comprising the maximization of the distributed quantities of protective materials to a set of chosen hospitals within a specific time shift. A nonlinear binary mathematical programming model for the problem is introduced with a real

Epileptic seizures occur as a result of functional brain dysfunction and can affect the health of the patient. Prediction of epileptic seizures before the onset is beneficial for the prevention of seizures through medication. Electroencephalograms (EEG) signals are used to predict epileptic seizures using machine learning techniques and feature extractions. Nevertheless, the pre-processing of EEG signals for noise removal and extraction of features are two significant problems that have an adverse effect on both anticipation time and true positive prediction performance. Considering this, the

This work is dedicated to the economic scheduling of the required electric stations in the upcoming 10-year long-term plan. The calculation of the required electric stations is carried out by estimating the yearly consumption of electricity over a long-time plan and then determining the required number of stations. The aim is to minimize the total establishing and operating costs of the stations based on a mathematical programming model with nonlinear objective function and integer decision variables. The introduced model is applied for a real practical case study to conclude the number of

The gaining sharing knowledge based optimization algorithm (GSK) is recently developed metaheuristic algorithm, which is based on how humans acquire and share knowledge during their life-time. This paper investigates a modified version of the GSK algorithm to find the best feature subsets. Firstly, it represents a binary variant of GSK algorithm by employing a probability estimation operator (Bi-GSK) on the two main pillars of GSK algorithm. And then, the chaotic maps are used to enhance the performance of the proposed algorithm. Ten different types of chaotic maps are considered to adapt the

Current methods for building radio maps for wireless localization systems require a tedious, manual and error-prone calibration of the area of interest. Each time the layout of the environment is changed or different hardware is used, the whole process of location fingerprinting and constructing the radio map has to be repeated. The process gets more complicated in the case of localizing multiple entities in a device-free scenario, since the radio map needs to take all possible combinations of the location of the entities into account. In this demo, we present a novel system (AROMA) that is

In cognitive radio (CR) networks, determining the optimal transmission power for the secondary users (SU) is crucial to achieving the goal of maximizing the secondary throughput while protecting the primary users (PU) from service disruption and interference. In this paper, we propose an adaptive transmission power scheme for cognitive terminals opportunistically accessing a primary channel. The PU operates over the channel in an unslotted manner switching activity at random times. The secondary transmitter (STx) adapts its transmission power according to its belief regarding the PU's state of

It is feasible and safe to use unmanned aerial vehicle (UAV) as the data collection platform of the Internet of things (IoT). In order to save the energy loss of the platform and make the UAV perform the collection work effectively, it is necessary to optimize the deployment of UAV. The objective problem is to minimize the sum of the lost energy of UAV and the loss of data transmission of Internet of things devices. The key to solving the problem is to calculate the location of the docking points and the number of docking points when the UAV is working to collect data. This paper proposes a

This paper introduces a heuristic solver based on neural networks and deep learning for the knapsack problem. The solver is inspired by mechanisms and strategies used by both algorithmic solvers and humans. The neural model of the solver is based on introducing several biases in the architecture. We introduce a stored memory of vectors that holds up items representations and their relationship to the capacity of the knapsack and a module that allows the solver to access all the previous outputs it generated. The solver is trained and tested on synthetic datasets that represent a variety of

This article proposes a new problem which is called the Stochastic Travelling Advisor Problem (STAP) in network optimization, and it is defined for an advisory group who wants to choose a subset of candidate workplaces comprising the most profitable route within the time limit of day working hours. A nonlinear binary mathematical model is formulated and a real application case study in the occupational health and safety field is presented. The problem has a stochastic nature in travelling and advising times since the deterministic models are not appropriate for such real-life problems. The