.png){kind=icon}
.png){kind=icon}
Return
Exact and approximate methods for the score-constrained packing problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2022.01.028.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper investigates a packing problem related to the one-dimensional bin packing problem in which the order and orientation of items influences the feasibility of a solution. We give an exact polynomial-time algorithm for the Constrained Ordering Problem, explaining how it can be used to find a feasible packing of items in a single bin. We then introduce an evolutionary algorithm for the multi-bin version of the problem, which incorporates the exact algorithm along with a local search procedure and three recombination operators. The mechanisms and results produced by each of the recombination operators are compared, and we discuss the circumstances in which each approach proves most advantageous. (C) 2022 Elsevier B.V. All rights reserved.
Keywords:
Evolutionary computations
Packing
Combinatorial optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W