A metaheuristic algorithm based on chemotherapy science: CSA

DOI10.1155/2017/3082024MaRDI QIDQ1659258zbMATH OpenOpenAlexWikidataFDO

Authors Mohammad Hassan Salmani, Kourosh Eshghi

Publication date 15 August 2018

Published in Journal of Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2017/3082024

zbMATH Keywords

chemotherapy science algorithmpopulation-based metaheuristic

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: Among scientific fields of study, mathematical programming has high status and its importance has led researchers to develop accurate models and effective solving approaches to addressing optimization problems. In particular, metaheuristic algorithms are approximate methods for solving optimization problems whereby good (not necessarily optimum) solutions can be generated via their implementation. In this study, we propose a population-based metaheuristic algorithm according to chemotherapy method to cure cancers that mainly search the infeasible region. As in chemotherapy, Chemotherapy Science Algorithm (CSA) tries to kill inappropriate solutions (cancers and bad cells of the human body); however, this would inevitably risk incidentally destroying some acceptable solutions (healthy cells). In addition, as the cycle of cancer treatment repeats over and over, the algorithm is iterated. To align chemotherapy process with the proposed algorithm, different basic terms and definitions including Infeasibility Function (IF), objective function (OF), Cell Area (CA), and Random Cells (RCs) are presented in this study. In the terminology of algorithms and optimization, IF and OF are mainly applicable as criteria to compare every pair of generated solutions. Finally, we test CSA and its structure using the benchmark Traveling Salesman Problem (TSP).

Recommendations

• Metaheuristics and Pontryagin's minimum principle for optimal therapeutic protocols in cancer immunotherapy: a case study and methods comparison
• Optimizing Chemotherapy Scheduling Using Local Search Heuristics
• Sperm motility algorithm: a novel metaheuristic approach for global optimisation
• A modified version of a T-cell algorithm for constrained optimization problems
• scientific article; zbMATH DE number 2167563

Cites work

• A New Metaheuristic Bat-Inspired Algorithm
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Firefly algorithm with chaos
• Future paths for integer programming and links to artificial intelligence
• GSA: A gravitational search algorithm
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• Krill herd: A new bio-inspired optimization algorithm
• Optimization by simulated annealing
• Optimization of computer simulation models with rare events
• POPMUSIC -- partial optimization metaheuristic under special intensification conditions
• The Reactive Tabu Search

Cited in

(2)

• Estimation of drug and tumor properties using novel hybrid meta-heuristic methods
• Quantum computing intelligence algorithm for structural topology optimization

Describes a project that uses

Uses Software

• POPMUSIC
• GSA
• Krill herd

This page was built for publication: A metaheuristic algorithm based on chemotherapy science: CSA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1659258)