.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Evolutionary computations
Packing
Combinatorial optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
分享收藏Effect of 24-epibrassinolide on salinity-induced changes in loquat (Eriobotrya japonica Lindl).png)
OAAI
IF0
OAAI分享收藏分享收藏
查看更多内容