专题:Optimization and Packing Problems

This cluster of papers focuses on the optimization of cutting and packing problems, including knapsack problems, bin packing, heuristic and metaheuristic algorithms, three-dimensional packing, rectangular packing, genetic algorithms, and strip packing. The research explores various approaches to efficiently utilize space and resources for packing objects into containers or arranging them for optimal use.
最新文献
近5年高被引文献
Knapsack problems — An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems

article Full Text OpenAlex 195 FWCI19.0282

On approximating rectangle tiling and packing

report Full Text OpenAlex 104 FWCI0

Knapsack problems — An overview of recent advances. Part I: Single knapsack problems

article Full Text OpenAlex 99 FWCI9.7989

On-line three-dimensional packing problems: A review of off-line and on-line solution approaches

article Full Text OpenAlex 90 FWCI7.286

Heuristics Integrated Deep Reinforcement Learning for Online 3D Bin Packing

article Full Text OpenAlex 71 FWCI9.4571

A machine learning optimization approach for last-mile delivery and third-party logistics

article Full Text OpenAlex 58 FWCI7.7255

Two-dimensional irregular packing problems: A review

article Full Text OpenAlex 57 FWCI5.123

Automating Bin Packing: A Layer Building Matheuristics for Cost Effective Logistics

article Full Text OpenAlex 54 FWCI5.4812

Nesting and scheduling optimization of additive manufacturing systems: Mapping the territory

article Full Text OpenAlex 51 FWCI10.619

Sustainable and cost-effective optimal design of steel structures by minimizing cutting trim losses

article Full Text OpenAlex 50 FWCI10.4108