In this paper a new hybrid glowworm swarm algorithm (SAGSO) for solving structural optimization problems is presented. The structure proposed to be optimized here is a simply-supported concrete I-beam ...

Hello, this is Kamishita. Since I bought an M4 Macbook Air, I'd like to try out various AI coding tools. I received a 30,000 yen Apple Gift Card during Apple's first sale of the year, but I had no use ...

Abstract: The 0-1 Knapsack Problem (KP) and Bin Packing Problem (BPP) are NP-hard combinatorial optimization challenges often tackled using metaheuristics. Both problems have prominent utilization in ...

Two-dimensional (2D) irregular packing problems are widespread in manufacturing industries such as shipbuilding, metalworking, automotive production, aerospace, clothing and furniture manufacturing.

A major barrier to the wider use of supervised learning in emerging applications, such as genomic selection, is the lack of sufficient and representative labeled data to train prediction models. The ...

Implementation of simulated annealing algorithm for the multiple choice multidimensional knapsack problem. The multiple choice knapsack problem has n groups of items and m constraints. The objective ...

[Ahuja00] “A greedy genetic algorithm for the quadratic assignment problem”, R. Ahuja, J. Orlin, A. Tiwari, Computers and Operations Research, vol. 27, issue 10 (Sept. 2000), 917--934, ACM (2000) ...