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

Statistical optimisation and tuning of GA factors.

This paper presents a practical methodology of improving the efficiency of Genetic Algorithms through tuning the factors significantly affecting GA performance. This methodology is based on the methods of statistical inference and has been successfully applied to both binary- and integer-encoded Genetic Algorithms that search for good chemotherapeutic schedules

Care Network Coordination for Chemotherapy at Home: A Case Study

International audienceThis paper deals with a system of chemotherapy at home which is managed by a Home Care Services (HCS) structure. The main role of this HCS structure is to coordinate care actors for a smooth organization of chemotherapy at home. In this work, we model a real system of chemotherapy at home managed by a HCS structure, and simulate its behaviour. The objective is to evaluate the relevance of such a system for current activities of the HCS structure, and to propose solutions for improving the optimal coordination of the care network for chemotherapy at home

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

Distributed computational intelligence applied in bioinformatics

Master'sMASTER OF ENGINEERIN

Intelligent data mining via evolutionary computing

Master'sMASTER OF ENGINEERIN

DNAgents: Genetically Engineered Intelligent Mobile Agents

Mobile agents are a useful paradigm for network coding providing many advantages and disadvantages. Unfortunately, widespread adoption of mobile agents has been hampered by the disadvantages, which could be said to outweigh the advantages. There is a variety of ongoing work to address these issues, and this is discussed. Ultimately, genetic algorithms are selected as the most interesting potential avenue. Genetic algorithms have many potential benefits for mobile agents. The primary benefit is the potential for agents to become even more adaptive to situational changes in the environment and/or emergent security risks. There are secondary benefits such as the natural obfuscation of functions inherent to genetic algorithms. Pitfalls also exist, namely the difficulty of defining a satisfactory fitness function and the variable execution time of mobile agents arising from the fact that it exists on a network. DNAgents 1.0, an original application of genetic algorithms to mobile agents is implemented and discussed, and serves to highlight these difficulties. Modifications of traditional genetic algorithms are also discussed. Ultimately, a combination of genetic algorithms and artificial life is considered to be the most appropriate approach to mobile agents. This allows the consideration of agents to be organisms, and the network to be their environment. Towards this end, a novel framework called DNAgents 2.0 is designed and implemented. This framework allows the continual evolution of agents in a network without having a seperate training and deployment phase. Parameters for this new framework were defined and explored. Lastly, an experiment similar to DNAgents 1.0 is performed for comparative purposes against DNAgents 1.0 and to prove the viability of this new framework

Evolutionary computing for routing and scheduling applications

Ph.DDOCTOR OF PHILOSOPH