There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience. We introduce the Multi-Objective ...
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 ...
Multi-objective scheduling problems in workshops are commonly encountered challenges in the increasingly competitive market economy. These scheduling problems require a trade-off among multiple ...
Two-dimensional (2D) irregular packing problems are widespread in manufacturing industries such as shipbuilding, metalworking, automotive production, aerospace, clothing and furniture manufacturing.
Abstract: We introduce a regret-based fitness assignment strategy for evolutionary algorithms to find Nash equilibria in noncooperative simultaneous combinatorial game theory problems where it is ...
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) ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results