A Comparison Of Optimization Methods For Multi-Objective Constrained Bin Packing Problems
INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, CPAIOR 2018(2018)
摘要
Despite the existence of efficient solution methods for bin packing problems, in practice these seldom occur in such a pure form but feature instead various considerations such as pairwise conflicts or profits between items, or aiming for balanced loads amongst the bins. The Wedding Seating Problem is a combinatorial optimization problem incorporating elements of bin packing with conflicts, bin packing with profits, and load balancing. We use this representative problem to present and compare constraint programming, integer programming, and met aheuristic approaches.
更多查看译文
关键词
Pairwise Conflicts, Comparing Constraint Programming, Efficient Solution Methods, Conflict Graph, Pareto Set
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络