A Two-Stage ϵ-Constraint Strategy-Based Heuristic for Bi-Objective Quadratic Multiple Knapsack Problems

2020 ◽  
Author(s):  
Meziane Aider ◽  
Oussama Gacem ◽  
Mhand Hifi
Keyword(s):  
Knapsack Problems ◽  
Two Stage ◽  
Multiple Knapsack

Multiple Knapsack Problems

2004 ◽  
pp. 285-316 ◽  
Author(s):  
Hans Kellerer ◽  
Ulrich Pferschy ◽  
David Pisinger
Keyword(s):  
Knapsack Problems ◽  
Multiple Knapsack

scholarly journals A procedure-based heuristic for 0-1 Multiple Knapsack Problems

2012 ◽  
Vol 4 (3) ◽  
pp. 214 ◽  
Author(s):  
Mohamed Esseghir Lalami ◽  
Moussa Elkihel ◽  
Didier El Baz ◽  
Vincent Boyer
Keyword(s):  
Knapsack Problems ◽  
Multiple Knapsack

An Algorithm to Optimal Two-Stage Homogenous Strip Patterns of Rectangular Pieces

2011 ◽  
Vol 347-353 ◽  
pp. 3189-3192
Author(s):  
Jun Ji ◽  
Yi Ping Lu ◽  
Jian Zhong Cha ◽  
Yao Dong Cui ◽  
Ling Jun Kong
Keyword(s):  
Dynamic Programming ◽  
Knapsack Problems ◽  
Benchmark Problems ◽  
Two Stage ◽  
Strip Layout ◽  
Punching Process ◽  
Two Stages ◽  
Computation Speed ◽  
Better Than

This paper presents an algorithm for two-stage homogenous strip patterns for rectangular pieces. The algorithm is appropriate for the shearing and punching process. It proposes the two-stage homogenous strip patterns that can be cut into homogenous strips in two stages, with another two stages being required to cut the strips into pieces. Firstly vertical cuts divide the stock sheet into segments, and then horizontal cuts divide the segments into homogenous strips. A homogenous strip contains pieces of the same type. The algorithm uses a dynamic programming recursion to determine the strip layout on each segment, solves knapsack problems to obtain the segment layout on the sheet. The algorithm is tested through benchmark problems, and compares with two famous algorithms. The pattern value and the computation speed of this paper’s algorithm are better than that of the classic two-stage algorithm. What’s more, this paper’s algorithm can give solutions very close to optimality.

scholarly journals On Merging Cover Inequalities for Multiple Knapsack Problems

2015 ◽  
Vol 04 (04) ◽  
pp. 141-155 ◽  
Author(s):  
Randal Hickman ◽  
Todd Easton
Keyword(s):  
Knapsack Problems ◽  
Multiple Knapsack ◽  
Cover Inequalities

scholarly journals On two-stage stochastic knapsack problems

2011 ◽  
Vol 159 (16) ◽  
pp. 1827-1841 ◽  
Author(s):  
S. Kosuch ◽  
A. Lisser
Keyword(s):  
Knapsack Problems ◽  
Two Stage ◽  
Stochastic Knapsack
Sign in / Sign up

Export Citation Format

Share Document