A Memetic Algorithm for Multiple-Drug Cancer Chemotherapy Schedule Optimization

  • Authors:
  • S. -M. Tse;Yong Liang;Kwong-Sak Leung;Kin-Hong Lee;T. S.-K. Mok

  • Affiliations:
  • Dept. of Comput. Sci. & Eng., Chinese Univ. of Hong Kong;-;-;-;-

  • Venue:
  • IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

This correspondence introduces a multidrug cancer chemotherapy model to simulate the possible response of the tumor cells under drug administration. We formulate the model as an optimal control problem. The algorithm in this correspondence optimizes the multidrug cancer chemotherapy schedule. The objective is to minimize the tumor size under a set of constraints. We combine the adaptive elitist genetic algorithm with a local search algorithm called iterative dynamic programming (IDP) to form a new memetic algorithm (MA-IDP) for solving the problem. MA-IDP has been shown to be very efficient in solving the multidrug scheduling optimization problem