logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Open-End Bin Packing Problem with Conflicts

delete2025-07-04
delete0
PRE
AI
E
Ece Nur Balık
A
Ali Ekici
M
Milad Elyasi
O
Okan Örsan Özener
DOI：10.1016/j.cie.2025.111293delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
• Introduced the Open-End Bin Packing Problem with Conflicts (OEBPPC). • Developed a mathematical model and lower bounds for the OEBPPC. • Proposed a General Variable Neighborhood Search (GVNS) for solving OEBPPC. • GVNS outperforms benchmarks by 2.26% with an 8.28% average optimality gap. • Conducted experiments validating GVNS across various test instances.

Journal

Computers and Industrial Engineering cover
Computers and Industrial Engineering
IF:
6.5
Papers:
1.0W
Citations:
3.8W

Organization

No organization information available