By Topic

High Performance Peer-to-Peer Distributed Computing with Application to Constrained Two-Dimensional Guillotine Cutting Problem

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

3 Author(s)
Hifi, M. ; Lab. MIS, Univ. de Picardie JulesVerne, Amiens, France ; Saadi, T. ; Haddadou, N.

This paper proposes a parallel peer-to-peer cooperative algorithm for approximately solving the constrained fixed-orientation two-staged two-dimensional cutting problem. The resolution process is based in three mechanisms: a beam-search search strategy, a strip generation filling procedure, and a upper bound applied for refining the selected paths. The algorithm explores, in parallel, a subset of elite nodes where each processor develops its own path according to its internal lists. the algorithms adapts to the number of processors available on the peer-to-peer platform by backuping the plateform the partial solutions. The computational investigation on the P2Pdc environment shows the good efficiency of the proposed algorithm.

Published in:

Parallel, Distributed and Network-Based Processing (PDP), 2011 19th Euromicro International Conference on

Date of Conference:

9-11 Feb. 2011