Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/11006
Appears in Collections:Computing Science and Mathematics Journal Articles
Peer Review Status: Refereed
Title: An evolutionary approach to cancer chemotherapy scheduling
Authors: Ochoa, Gabriela
Villasana, Minaya
Burke, Edmund
Contact Email: gabriela.ochoa@cs.stir.ac.uk
Keywords: evolutionary algorithms
evolution strategies
objective function
optimal control
cancer chemotherapy
cancer model
cycle-phase-specific drugs
Issue Date: Dec-2007
Publisher: Springer
Citation: Ochoa G, Villasana M & Burke E (2007) An evolutionary approach to cancer chemotherapy scheduling, Genetic Programming and Evolvable Machines, 8 (4), pp. 301-318.
Abstract: In this paper, we investigate the employment of evolutionary algorithms as a search mechanism in a decision support system for designing chemotherapy schedules. Chemotherapy involves using powerful anti-cancer drugs to help eliminate cancerous cells and cure the condition. It is given in cycles of treatment alternating with rest periods to allow the body to recover from toxic side-effects. The number and duration of these cycles would depend on many factors, and the oncologist would schedule a treatment for each patient's condition. The design of a chemotherapy schedule can be formulated as an optimal control problem; using an underlying mathematical model of tumour growth (that considers interactions with the immune system and multiple applications of a cycle-phase-specific drug), the objective is to find effective drug schedules that help eradicate the tumour while maintaining the patient health's above an acceptable level. A detailed study on the effects of different objective functions, in the quality and diversity of the solutions, was performed. A term that keeps at a minimum the tumour levels throughout the course of treatment was found to produce more regular treatments, at the expense of imposing a higher strain on the patient's health, and reducing the diversity of the solutions. Moreover, when the number of cycles was incorporated in the problem encoding, and a parsimony pressure added to the objective function, shorter treatments were obtained than those initially found by trial and error.
Type: Journal Article
URI: http://hdl.handle.net/1893/11006
DOI Link: http://dx.doi.org/10.1007/s10710-007-9041-y
Rights: The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.
Affiliation: Computing Science - CSM Dept
Universidad Simon Bolivar
Computing Science and Mathematics

Files in This Item:
File Description SizeFormat 
Ochoa et al_GPEM_2007.pdf505.09 kBAdobe PDFUnder Embargo until 31/12/2999     Request a copy

Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependant on the depositor still being contactable at their original email address.

This item is protected by original copyright



Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.