Automating the drug scheduling with different toxicity clearance in cancer chemotherapy via evolutionary computation

ABSTRACT

The toxicity of an anticancer drug is cleared from the body by different processes, including saturable metabolic and nonsaturable renal-excretion pathways. According to the principles of toxicokinetics, we propose a new anticancer drug scheduling model with different toxic elimination processes in this paper. We also present a sophisticated automating drug scheduling approach based on evolutionary computation and computer modeling. To explore multiple efficient drug scheduling policies, we use a multimodal optimization algorithm --- adaptive elitist-population based genetic algorithm (AEGA) to solve the new model, and discuss the situation of multiple optimal solutions under different parameter settings. The simulation results obtained by the new model match well with the clinical treatment experience, and can provide much more drug scheduling policies for a doctor to choose depending on the particular conditions of the patients.

REFERENCES

• 1: B. Bojkov, R. Hansel, and R. Luus, Application of direct search optimization to optimal control problem, Hung. J. Ind. Chem. 21: 177--185, 1993
• 2: E. F. Carrasco, and J. R. Banga, A hybrid method for the optimal control of chemical processes, Proc. of UKACC Int. Conf. Control'98, II: 925--930, June 1998
• 3: E. M. David, Biochemistry, Harcourt/Academic Press, 2001
• 4: K. S. Leung, and Y. Liang, Genetic algorithm with adaptive elitist-population strategies for multimodal function optimization. Proc. of Int. Conf. GECCO-2003, pages 1160--1171. July 2003
• 5: K. S. Leung, Y. Liang, and S. K. Mok, Multiple optimal scheduling in cancer chemotherapy by evolutionary computation. Proc. of Taiwan-Japan Symposium 2005 on Intelligent Technology and Innovational Computing, pages 9--17, August 2005
• 6: Y. Liang, K. S. Leung, and S. K. Mok, Evolutionary Drug Scheduling Model for Cancer Chemotherapy, IEEE Trans. on Inf. Tech. in BioMed., 10(2): 237--245, 2006
• 7: R. Luus, Comments on dynamic optimization of batch reactors using adaptive stochastic algorithms, Ind. Eng. Chen. Res., 37: 305--327, 1998
• 8: R. B. Martin, Optimal control drug scheduling of cancer chemotherapy, Automatica (Journal of IFAC), v.28 n.6, p.1113-1123, Nov. 1992 [doi>10.1016/0005-1098(92)90054-J]
• 9: V. Minay, and O. Gabriela, Heuristic design of cancer chemotherapies, IEEE Trans. on Evol. Comp., 8(6): 513--521, 2005
• 10: J. M. Murray, Optimal control of a cancer chemotherapy problem with general growth and loss functions, Math. Biosci., 38: 273--287, 1990
• 11: J. C. Panetta and J. Adam, A mathematical model of cycle-specific chemotherapy, Math. Comput. Modeling, 22(2): 67--82, 1995
• 12: William H. Press , Saul A. Teukolsky , William T. Vetterling , Brian P. Flannery, Numerical recipes in C (2nd ed.): the art of scientific computing, Cambridge University Press, New York, NY, 1992
• 13: K. C. Tan, E. F. Khor, J. Cai, C. M. Heng, and T. H. Lee, Automating the drug scheduling of cancer chemotherapy via evolutionary computation, Art. Intel. in Med., 25: 169--185, 2002
• 14: S. M. Tse, Y. Liang, K. S. Leung, K. H. Lee, and S. K. Mok, Multiple drugs cancer chemotherapy scheduling by a new memetic optimization algorithm, Proceeding of 2005 IEEE Congress on Evol. Comp., pages 699--706, August 2005

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.6 SIMULATION AND MODELING
      I.6.5 Model Development
          Subjects: Modeling methodologies

General Terms:
Algorithms

Keywords:
drug scheduling model, multimodal optimization algorithm