Solving multi-objective functions for cancer treatment by using Metaheuristic Algorithms

Authors

  • Farid Heydarpoor Department of Applied Mathematics, Yazd University, Yazd, Iran
  • Seyed Mehdi Karbassi Yazd University
  • Narges Bidabadi Department of Applied Mathematics, Yazd University, Yazd, Iran
  • Mohammad Javad Ebadi Faculty of Marine Science, Chabahar Maritime University, Chabahar, Iran

Keywords:

Multimodal Functions, Genetic Algorithm, Particle Swarm Optimization, Optimal Control

Abstract

In this context, we introduce a multi-objective optimization problem (MOOP) to simultaneously minimize the objectives of cancerous cells density as well as the approved drug amount in order to optimize the medical remedy of a tumor. The main aim is gaining a proper pattern for medical supervision to sick people with malignant cancer. To this end, a comparison is made between the two important and useful methods of non-dominated sorting genetic algorithm II (NSGA-II) and multi-objective particle swarm optimization (MOPSO). The gained Pareto's Curve here yields a series of optimal protocols. A desired optimal technique is then selected from these optimal protocols for drug supervision, relating to an under consideration criterion. The results show that in both criterions the convergence and expansion of Pareto optimal fronts of the performance of the NSGA-II method is better compared to MOPSO.

Downloads

Published

2020-01-03

How to Cite

Heydarpoor, F., Karbassi, S. M., Bidabadi, N., & Ebadi, M. J. (2020). Solving multi-objective functions for cancer treatment by using Metaheuristic Algorithms. International Journal of Combinatorial Optimization Problems and Informatics, 11(3), 61–75. Retrieved from https://rt.http3.lol/ojs/article/view/124

Issue

Section

Articles