Chemotherapy drug regimen optimization using deterministic oscillatory search algorithm

Purpose: To schedule chemotherapy drug delivery using Deterministic Oscillatory Search algorithm, keeping the toxicity level within permissible limits and reducing the number of tumor cells within a predefined time period.Methods: A novel metaheuristic algorithm, deterministic oscillatory search, has been used to optimize the Gompertzian model of the drug regimen problem. The model is tested with fixed (fixed interval variable dose, FIVD) and variable (variable interval variable dose, VIVD) interval schemes and the dosage presented for 52 weeks. In the fixed interval, the treatment plan is fixed in such a way that doses are given on the first two days of every seven weeks such as day 7, day 14, etc.Results: On comparing the two schemes, FIVD provided a higher reduction in the number of tumor cells by 98 % compared to 87 % by VIVD after the treatment period. Also, a significant reduction in the number was obtained half way through the regimen. The dose level and toxicity are also reduced in the FIVD scheme. The value of drug concentration is more in FIVD scheme (50) compared to VIVD (41); however, it is well within the acceptable limits of concentration. The results proved the effectiveness of the proposed technique in terms of reduced drug concentration, toxicity, tumor size and drug level within a predetermined time period.Conclusion: Artificial intelligent techniques can be used as a tool to aid oncologists in the effective treatment of cancer through chemotherapy.Keywords: Deterministic Oscillatory Search, Chemotherapy scheduling, Drug schedule, Artificial intelligenc

Optimal Multi-Drug Chemotherapy Control Scheme for Cancer Treatment. Design and development of a multi-drug feedback control scheme for optimal chemotherapy treatment for cancer. Evolutionary multi-objective optimisation algorithms were used to achieve the optimal parameters of the controller for effective treatment of cancer with minimum side effects.

Cancer is a generic term for a large group of diseases where cells of the body lose their normal mechanisms for growth so that they grow in an uncontrolled way. One of the most common treatments of cancer is chemotherapy that aims to kill abnormal proliferating cells; however normal cells and other organs of the patients are also adversely affected. In practice, it¿s often difficult to maintain optimum chemotherapy doses that can maximise the abnormal cell killing as well as reducing side effects. The most chemotherapy drugs used in cancer treatment are toxic agents and usually have narrow therapeutic indices, dose levels in which these drugs significantly kill the cancerous cells are close to the levels which sometime cause harmful toxic side effects. To make the chemotherapeutic treatment effective, optimum drug scheduling is required to balance between the beneficial and toxic side effects of the cancer drugs. Conventional clinical methods very often fail to find drug doses that balance between these two due to their inherent conflicting nature. In this investigation, mathematical models for cancer chemotherapy are used to predict the number of tumour cells and control the tumour growth during treatment. A feedback control method is used so as to maintain certain level of drug concentrations at the tumour sites. Multi-objective Genetic Algorithm (MOGA) is then employed to find suitable solutions where drug resistances and drug concentrations are incorporated with cancer cell killing and toxic effects as design objectives. Several constraints and specific goal values were set for different design objectives in the optimisation process and a wide range of acceptable solutions were obtained trading off among different conflicting objectives. Abstract v In order to develop a multi-objective optimal control model, this study used proportional, integral and derivative (PID) and I-PD (modified PID with Integrator used as series) controllers based on Martin¿s growth model for optimum drug concentration to treat cancer. To the best of our knowledge, this is the first PID/I-PD based optimal chemotherapy control model used to investigate the cancer treatment. It has been observed that some solutions can reduce the cancer cells up to nearly 100% with much lower side effects and drug resistance during the whole period of treatment. The proposed strategy has been extended for more drugs and more design constraints and objectives.Libyan Ministry of Higher Educatio

Analysis of physiological signals using machine learning methods

Technological advances in data collection enable scientists to suggest novel approaches, such as Machine Learning algorithms, to process and make sense of this information. However, during this process of collection, data loss and damage can occur for reasons such as faulty device sensors or miscommunication. In the context of time-series data such as multi-channel bio-signals, there is a possibility of losing a whole channel. In such cases, existing research suggests imputing the missing parts when the majority of data is available. One way of understanding and classifying complex signals is by using deep neural networks. The hyper-parameters of such models have been optimised using the process of back propagation. Over time, improvements have been suggested to enhance this algorithm. However, an essential drawback of the back propagation can be the sensitivity to noisy data. This thesis proposes two novel approaches to address the missing data challenge and back propagation drawbacks: First, suggesting a gradient-free model in order to discover the optimal hyper-parameters of a deep neural network. The complexity of deep networks and high-dimensional optimisation parameters presents challenges to find a suitable network structure and hyper-parameter configuration. This thesis proposes the use of a minimalist swarm optimiser, Dispersive Flies Optimisation(DFO), to enable the selected model to achieve better results in comparison with the traditional back propagation algorithm in certain conditions such as limited number of training samples. The DFO algorithm offers a robust search process for finding and determining the hyper-parameter configurations. Second, imputing whole missing bio-signals within a multi-channel sample. This approach comprises two experiments, namely the two-signal and five-signal imputation models. The first experiment attempts to implement and evaluate the performance of a model mapping bio-signals from A toB and vice versa. Conceptually, this is an extension to transfer learning using CycleGenerative Adversarial Networks (CycleGANs). The second experiment attempts to suggest a mechanism imputing missing signals in instances where multiple data channels are available for each sample. The capability to map to a target signal through multiple source domains achieves a more accurate estimate for the target domain. The results of the experiments performed indicate that in certain circumstances, such as having a limited number of samples, finding the optimal hyper-parameters of a neural network using gradient-free algorithms outperforms traditional gradient-based algorithms, leading to more accurate classification results. In addition, Generative Adversarial Networks could be used to impute the missing data channels in multi-channel bio-signals, and the generated data used for further analysis and classification tasks

Controller tuning by means of evolutionary multiobjective optimization: current trends and applications

Control engineering problems are generally multi-objective problems; meaning that there are several specifications and requirements that must be fulfilled. A traditional approach for calculating a solution with the desired trade-off is to define an optimisation statement. Multi-objective optimisation techniques deal with this problem from a particular perspective and search for a set of potentially preferable solutions; the designer may then analyse the trade-offs among them, and select the best solution according to his/her preferences. In this paper, this design procedure based on evolutionary multiobjective optimisation (EMO) is presented and significant applications on controller tuning are discussed. Throughout this paper it is noticeable that EMO research has been developing towards different optimisation statements, but these statements are not commonly used in controller tuning. Gaps between EMO research and EMO applications on controller tuning are therefore detected and suggested as potential trends for research.The first author is grateful for the hospitality and availability of the UTC at the University of Sheffield during his academic research stay at 2011; especially to Dr. P.J. Fleming for his valuable comments and insights in the development of this paper. This work was partially supported by Grant FPI-2010/19 and project PAID-2011/2732 from the Universitat Politecnica de Valencia and projects TIN2011-28082 and ENE2011-25900 from the Spanish Ministry of Economy and Competitiveness.Reynoso Meza, G.; Blasco Ferragud, FX.; Sanchís Saez, J.; Martínez Iranzo, MA. (2014). Controller tuning by means of evolutionary multiobjective optimization: current trends and applications. Control Engineering Practice. 28:58-73. https://doi.org/10.1016/j.conengprac.2014.03.003S58732

Improve Performance Wireless Sensor Network Localization using RSSI and AEMM

Improve wireless sensor network localisation performance using RSSI and an advanced error minimisation method (AEMM). WSNs remain domain-specific and are typically deployed to support a single application. However, as WSN nodes become more powerful, it becomes increasingly important to investigate how multiple applications can share the same WSN infrastructure. Virtualisation is a technology that may allow for this sharing. The issues surrounding wireless sensor node localisation estimation are still being researched. There are a large number of Wireless Sensor Networks (WSNs) with limited computing, sensing, and energy capabilities. Localisation is one of the most important topics in wireless sensor networks (WSNs) because location information is typically useful for many applications. The locations of anchor nodes and the distances between neighbouring nodes are the primary data in a localisation process. The complexity and diversity of current and future wireless detector network operations drive this. Several single schemes have been proposed and studied for position estimation, each with advantages and limitations. Nonetheless, current methods for evaluating the performance of wireless detector networks are heavily focused on a single private or objective evaluation. Accurate position information in a wireless detector network is critical for colourful arising operations (WSN). It is critical to reducing the goods of noisy distance measures to improve localisation accuracy. Existing works (RSSI) are detailed and critically evaluated, with a higher error rate using a set of scenario requirements. Our proposed method (AEMM) is critical for detecting and dealing with outliers in wireless sensor networks to achieve a low localisation error rate. The proposed method (AEMM) for localisation and positioning nodes in wireless sensor networks supported by IOT and discovering the appropriate position of several nodes addresses all of the issues in WSN

Evolutionary Computation 2020

Intelligent optimization is based on the mechanism of computational intelligence to refine a suitable feature model, design an effective optimization algorithm, and then to obtain an optimal or satisfactory solution to a complex problem. Intelligent algorithms are key tools to ensure global optimization quality, fast optimization efficiency and robust optimization performance. Intelligent optimization algorithms have been studied by many researchers, leading to improvements in the performance of algorithms such as the evolutionary algorithm, whale optimization algorithm, differential evolution algorithm, and particle swarm optimization. Studies in this arena have also resulted in breakthroughs in solving complex problems including the green shop scheduling problem, the severe nonlinear problem in one-dimensional geodesic electromagnetic inversion, error and bug finding problem in software, the 0-1 backpack problem, traveler problem, and logistics distribution center siting problem. The editors are confident that this book can open a new avenue for further improvement and discoveries in the area of intelligent algorithms. The book is a valuable resource for researchers interested in understanding the principles and design of intelligent algorithms

Evolutionary Computation

This book presents several recent advances on Evolutionary Computation, specially evolution-based optimization methods and hybrid algorithms for several applications, from optimization and learning to pattern recognition and bioinformatics. This book also presents new algorithms based on several analogies and metafores, where one of them is based on philosophy, specifically on the philosophy of praxis and dialectics. In this book it is also presented interesting applications on bioinformatics, specially the use of particle swarms to discover gene expression patterns in DNA microarrays. Therefore, this book features representative work on the field of evolutionary computation and applied sciences. The intended audience is graduate, undergraduate, researchers, and anyone who wishes to become familiar with the latest research work on this field

Bio-inspired Optimization: Algorithm, Analysis and Scope of Application

In the last few years, bio-inspired optimization techniques have been widely adopted in fields such as computer science, mathematics, and biology in order to optimize solutions. Bio inspired optimization problems are usually nonlinear and restricted to multiple nonlinear constraints to tackle the problems of the traditional optimization algorithms, the recent trends tend to apply bio-inspired optimization algorithms which represent a promising approach for solving complex optimization problems. This work comprises state-of-art of ten recent bio-inspired algorithms, gap analysis, and its applications namely; Particle swarm optimization (PSO), Genetic Bee Colony (GBC) Algorithm, Fish Swarm Algorithm (FSA), Cat Swarm Optimization (CSO), Whale Optimization Algorithm (WOA), Artificial Algae Algorithm (AAA), Elephant Search Algorithm (ESA), Cuckoo Search Optimization Algorithm (CSOA), Moth flame optimization (MFO), and Grey Wolf Optimization (GWO) algorithm. The previous related works collected from Scopus databases are presented. Also, we explore some key issues in optimization and some applications for further research. We also analyze in-depth discussions on the essence of these algorithms and their connections to self-organization and their applications in different areas of research are presented. As a result, the proposed analysis of these algorithms leads to some key problems that have to be addressed in the future

On the role of metaheuristic optimization in bioinformatics

Metaheuristic algorithms are employed to solve complex and large-scale optimization problems in many different fields, from transportation and smart cities to finance. This paper discusses how metaheuristic algorithms are being applied to solve different optimization problems in the area of bioinformatics. While the text provides references to many optimization problems in the area, it focuses on those that have attracted more interest from the optimization community. Among the problems analyzed, the paper discusses in more detail the molecular docking problem, the protein structure prediction, phylogenetic inference, and different string problems. In addition, references to other relevant optimization problems are also given, including those related to medical imaging or gene selection for classification. From the previous analysis, the paper generates insights on research opportunities for the Operations Research and Computer Science communities in the field of bioinformatics