Abstract: The knapsack problem is known as a NP-hard problem. There is a dynamic programming solution for this problem which is called the 0–1 knapsack. Firefly's innovative optimization algorithm is ...
Bio-inspired computational methods have gained popularity recently. These methods mimic the seemingly complex behavior of organisms to tackle difficult and often overwhelming problems. For example, ...
Abstract: With the widespread adoption of delivery services and advancements in autonomous driving technology, route optimization problems have attracted significant attention. In particular, the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback