By Topic

A Cooperative Algorithm for Constrained Two-staged 2D Cutting Problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hifi, M. ; Univ. of Picardie Jules Verne, Amiens ; Saadi, T.

In this paper, we propose a cooperative solution procedure for the two-staged two-dimensional cutting stock problem (2TDC). We solve 2TDC by considering two key features: a search strategy and a fast filling procedure. The search strategy uses a beam-search method and the second strategy uses a local filling procedure for improving the quality of the obtained solutions

Published in:

Service Systems and Service Management, 2006 International Conference on  (Volume:2 )

Date of Conference:

Oct. 2006