Evolving Nano Particle Cancer Treatments with Multiple Particle Types
원문 초록
Evolutionary algorithms have long been used for optimization problems where the appropriate size of solutions is unclear a priori. The applicability of this methodology is here investigated on the problem of designing a nano-particle (NP) based drug delivery system targeting cancer tumours. Utilizing a treatment comprising of multiple types of NPs is expected to be more effective due to the higher complexity of the treatment. This paper begins by utilizing the well-known NK model to explore the effects of fitness landscape ruggedness upon the evolution of genome length and, hence, solution complexity. The size of a novel sequence and the absence or presence of sequence deletion are also considered. Results show that whilst landscape ruggedness can alter the dynamics of the process, it does not hinder the evolution of genome length. These findings are then explored within the aforementioned real-world problem. In the first known instance, treatments with multiple types of NPs are used simultaneously, via an agent-based open source physics-based cell simulator. The results suggest that utilizing multiple types of NPs is more efficient when the solution space is explored with the evolutionary techniques under a predefined computational budget.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Graph-Supported Dynamic Algorithm Configuration for Multi-Objective Combinatorial Optimization
Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback
Benchmarking MOEAs for solving continuous multi-objective RL problems
Mergenetic: a Simple Evolutionary Model Merging Library
Evolutionary thoughts: integration of large language models and evolutionary algorithms
RainbowPlus: Enhancing Adversarial Prompt Generation via Evolutionary Quality-Diversity Search
토론
이 논문과 연결된 포럼 글이 아직 없습니다.