COMPACT: Concurrent or Ordered Matrix-Based Packing Arrangement Computation Technique

Author:

Serhat GokhanORCID

Abstract

Despite their versatility in treating irregular geometries, the raster methods have received limited attention in solving packing problems involving rotatable objects. In addition, raster approximation allows the use of unique performance metrics and indirect consideration of constraints, which have not been exploited in the literature. This study presents the Concurrent or Ordered Matrix-based Packing Arrangement Computation Technique (COMPACT). The method allows the objects to be rotated by arbitrary angles, unlike the right-angled rotation restrictions imposed in many existing packing optimization studies based on raster methods. The raster approximations are obtained through loop-free operations that improve efficiency. Additionally, a novel performance metric is introduced, which favors efficient filling of the available space by maximizing the overall contact within the domain. Moreover, the objective functions are exploited to discard the overlap and overflow constraints and enable the use of unconstrained optimization methods. The results of the case studies demonstrate the effectiveness of the proposed technique.

Publisher

MDPI AG

Subject

Fluid Flow and Transfer Processes,Computer Science Applications,Process Chemistry and Technology,General Engineering,Instrumentation,General Materials Science

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3