Contact
Cum să cumpăr
Livrare
Consilier de cumpărături
A Heuristic Based Solution for Rectangle Packing Problem
An Analysis and Design of Heuristic Approach
engleză
180 b
30 de zile pentru retur bunuri
Clienții au cumpărat de asemenea
/
Copertă tare
116.13
lei
/
Carte broșată
148.97
lei
/
Copertă tare
261.77
lei
/
Carte broșată
89.86
lei
This monograph investigates approaches for two-dimensional stock cutting (Rectangle Packing) problems and development of a new algorithm which brings back the revision of a classical heuristic for Rectangle Packing as proposed by Cheok and Nee. These problems occur in several important manufacturing industries e.g. Paper, Glass, Wood, Textile, Plastic and Foam, Garments, Leather, Ship manufacturing and Shoe making etc. The application of automatic packing algorithms can yield considerable cost savings through the diminution of human solvers and better utilisation of raw material.The scope of the research study is to develop an algorithm for a heuristic that aims for optimisation of a rectangle packing problem (RPP). An instance of RPP can be described as number of rectangles called items (comparatively smaller in size) that are to be packed/ cut from relatively larger rectangles called objects, in such a way that the scrap left is minimum or sheet utilisation is maximum. These objects can even be a stock of different sized rectangles available in assorted numbers. This monograph has 6 chapters and provides adequate material on various approaches to solve the RPP.
Informații despre carte
engleză
Dăruiește această carte chiar astăzi
Este foarte ușor
1 Adaugă cartea în coș și selectează Livrează ca un cadou 2 Îți vom trimite un voucher în schimb 3 Cartea va ajunge direct la adresa destinataruluiAr putea de asemenea, să te intereseze
/
Carte broșată
91.21
lei
/
Copertă tare
221.01
lei
/
Copertă tare
626.35
lei
/
Copertă tare
681.92
lei
