Diabetes is a chronic disease that affects millions of people in the world. This work has two objectives: (a) elaboration of a state of the art on the different dynamic systems with economic function proposed in the literature controlling diabetes in order to alleviate the socio-economic damage caused by it; (b) implementation of the best performing local search artificial intelligence methods (metaheuristics) to solve the kernel model dealing with the common compartments between all these models. The idea behind the use of metaheuristics is that these intelligent methods are able to provide an excellent approximation of a very economical control marked by its continuity and which does not completely exhaust the human and material resources programmed for the control of the studied phenomenon. Our work is marked by a richness of experiments allowing to analyze several interesting aspects of the phenomenon: quality of the control, cost of the control, and behavior of the different compartments in the presence of the control. In comparison with bees algorithm (BA), firefly algorithm (FA), particle swarm algorithm (PSO), genetic algorithm (GA), moth swarm algorithm (MSA), stochastic fractal search (SFS), wind driven optimization (WDO), and probabilistic bees algorithm (PBA). The stochastic fractal search (SFS) method has shown an unprecedented ability to produce continuous, economical controls capable of alleviating socio-economic damage against a reasonable budget.

To limit the adverse effects of diabetes, a personalized and long-term management strategy that includes appropriate medication, exercise and diet has become of paramount importance and necessity. Compartment-based mathematical control models for diabetes usually result in objective functions whose terms are conflicting, preventing the use of single-objective-based models for obtaining appropriate personalized strategies. Taking into account the conflicting aspects when controlling the diabetic population dynamics, this paper introduces a multi-objective approach consisting of four steps: (a) modeling the problem of controlling the diabetic population dynamics using a multi-objective mathematical model, (b) discretizing the model using the trapezoidal rule and the Euler–Cauchy method, (c) using swarm-intelligence-based optimizers to solve the model and (d) structuring the set of controls using soft clustering methods, known for their flexibility. In contrast to single-objective approaches, experimental results show that the multi-objective approach obtains appropriate personalized controls, where the control associated with the compartment of diabetics without complications is totally different from that associated with the compartment of diabetics with complications. Moreover, these controls enable a significant reduction in the number of diabetics with and without complications, and the multi-objective strategy saves up to 4% of the resources needed for the control of diabetes without complications and up to 18% of resources for the control of diabetes with complications.

When implementing SVMs, two major problems are encountered: (a) the number of local minima of dual-SVM increases exponentially with the number of samples and (b) the computer storage memory required for a regular quadratic programming solver increases exponentially as the problem size expands. The Kernel-Adatron family of algorithms, gaining attention recently, has allowed us to handle very large classification and regression problems. However, these methods treat different types of samples (i.e., noise, border, and core) in the same manner, which makes these algorithms search in unpromising areas and increases the number of iterations as well. This paper introduces a hybrid method to overcome such shortcomings, called the Optimal Recurrent Neural Network and Density-Based Support Vector Machine (Opt-RNN-DBSVM). This method consists of four steps: (a) the characterization of different samples, (b) the elimination of samples with a low probability of being a support vector, (c) the construction of an appropriate recurrent neural network to solve the dual-DBSVM based on an original energy function, and (d) finding the solution to the system of differential equations that govern the dynamics of the RNN, using the Euler–Cauchy method involving an optimal time step. Density-based preprocessing reduces the number of local minima in the dual-SVM. The RNN’s recurring architecture avoids the need to explore recently visited areas. With the optimal time step, the search moves from the current vectors to the best neighboring support vectors. It is demonstrated that RNN-SVM converges to feasible support vectors and Opt-RNN-DBSVM has very low time complexity compared to the RNN-SVM with a constant time step and the Kernel-Adatron algorithm–SVM. Several classification performance measures are used to compare Opt-RNN-DBSVM with different classification methods and the results obtained show the good performance of the proposed method.

When implementing SVMs, two major problems are encountered: (a) the number of local minima increases exponentially with the number of samples and (b) the quantity of required computer storage, required for a regular quadratic programming solver, increases by an exponential mag-nitude as the problem size expands. The Kernel-Adatron family of algorithms gaining attention lately which has allowed it to handle very large classification and regression problems. Howev-er, these methods treat different types of samples (Noise, border, and core) in the same manner, which causes searches in unpromising areas and increases the number of iterations. In this work, we introduce a hybrid method to overcome these shortcomings, namely Optimal Recurrent Neu-ral Network Density Based Support Vector Machine (Opt-RNN-DBSVM). This method consists of four steps: (a) characterization of different samples, (b) elimination of samples with a low probability of being a support vector, (c) construction of an appropriate recurrent neural network based on an original energy function, and (d) solution of the system of differential equations, managing the dynamics of the RNN, using the Euler-Cauchy method involving an optimal time step. The RNN remembers the regions explored during the search process thanks to its recurrent architecture. We demonstrated that RNN-SVM converges to feasible support vectors and Opt-RNN-DBSVM has a very low time complexity compared to RNN-SVM with constant time step, and KAs-SVM. Several experiments were performed on academic data sets. We used several classification performances measures to compare Opt-RNN-DBSVM to different classification methods and the results obtained show the good performance of the proposed method.