Results 41 to 50 of about 16,552 (267)

An Improved Shuffled Frog Leaping Algorithm for Assembly Sequence Planning of Remote Handling Maintenance in Radioactive Environment

Science and Technology of Nuclear Installations, 2015
Assembly sequence planning (ASP) of remote handling maintenance in radioactive environment is a combinatorial optimization problem. This study proposes an improved shuffled frog leaping algorithm (SFLA) for the combinatorial optimization problem of ASP ...
Jianwen Guo, Hong Tang, Zhenzhong Sun, Song Wang, Xuejun Jia, Haibin Chen, Zhicong Zhang   +6 more
doaj   +1 more source

Similarity-based parameter transferability in the quantum approximate optimization algorithm

Frontiers in Quantum Science and Technology, 2023
The quantum approximate optimization algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage through quantum-enhanced combinatorial optimization.
Alexey Galda, Alexey Galda, Eesh Gupta, Eesh Gupta, Jose Falla, Jose Falla, Xiaoyuan Liu, Xiaoyuan Liu, Danylo Lykov, Yuri Alexeev, Ilya Safro   +10 more
doaj   +1 more source

Stochastic Simulated Quantum Annealing for Fast Solution of Combinatorial Optimization Problems

IEEE Access
Combinatorial optimization problems are frequently classified as NP-hard, which means that the time needed to find the optimal solution generally increases exponentially with the problem size.
Naoya Onizawa, Ryoma Sasaki, Duckgyu Shin, Warren J. Gross, Takahiro Hanyu   +4 more
doaj   +1 more source

State Transition Simulated Annealing Algorithm for Discrete-Continuous Optimization Problems

IEEE Access, 2019
A simulated annealing (SA) algorithm is an effective method for solving optimization problems, especially for combinatorial optimization problems. However, SA algorithms rely heavily on the iterative mechanism of the neighborhood structure.
Xiaoxia Han, Yingchao Dong, Lin Yue, Quanxi Xu   +3 more
doaj   +1 more source

A General Combinatorial Ant System-based Distributed Routing Algorithm for Communication Networks [PDF]

Journal of Systemics, Cybernetics and Informatics, 2007
In this paper, a general Combinatorial Ant System-based distributed routing algorithm modeled like a dynamic combinatorial optimization problem is presented.
Jose Aguilar, Miguel Labrador
doaj  

A comparative evaluation of swarm intelligence techniques for solving combinatorial optimization problems

International Journal of Advanced Robotic Systems, 2017
This article presents a critical evaluation of swarm intelligence techniques for solving combinatorial optimization problems. Since, unarguably, the traveling salesman’s problem is the most developed, studied, and popular combinatorial problem, this ...
Julius Odili, Mohd Nizam Mohmad Kahar, A Noraziah, Syafiq F Kamarulzaman   +3 more
doaj   +1 more source

Organoids in pediatric cancer research

FEBS Letters, EarlyView.
Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley   +1 more source

Cell wall target fragment discovery using a low‐cost, minimal fragment library

FEBS Letters, EarlyView.
LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan, Mathew Stanley, Olawale Raimi, Andrew T. Ferenbach, Helge C Dorfmueller, Daan M. F. van Aalten   +5 more
wiley   +1 more source

A Hybrid Particle Swarm Optimization with Genetic Operator for Vehicle Routing Problem

Journal of Advances in Information Technology, 2010
The Vehicle Routing Problem (VRP) is a NP-hard and Combinatorial optimization problem. Combinatorial optimization problem can be viewed as searching for best element in a set of discrete items, which can be solved using search algorithm or meta heuristic.
Geetha Shanmugam, Poonthalir Ganesan, Vanathi P T   +2 more
doaj   +1 more source

Trip Planning Based on subQUBO Annealing

IEEE Access, 2023
The trip planning problem (TPP) can be formulated as a combinatorial optimization problem that searches for the best route to visit a series of landmarks and hotels.
Tatsuya Noguchi, Keisuke Fukada, Siya Bao, Nozomu Togawa   +3 more
doaj   +1 more source