A Heuristic Based Solution for Rectangle Packing Problem: An Analysis and Design of Heuristic Approach - Softcover

Jain, Leena; Singh, Kawaljeet

Softcover

ISBN 10: 3846538426 ISBN 13: 9783846538425

Publisher: LAP LAMBERT Academic Publishing, 2011

Synopsis

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.

About this title

About the Author

Dr. Leena Jain is Assistant Professor in RIMT Mandi Gobindgarh, Punjab,India. She has seven years of experience in the academic field and has twenty Research Papers.Dr. Kawaljeet Singh is working as Director, University Computer Centre, Punjabi University, Patiala. He has to his contribution 60 papers published in National/ International journals.

Edition details

• Publisher: LAP LAMBERT Academic Publishing
• Publication date: 2011
• Language: English
• ISBN 10: 3846538426
• ISBN 13: 9783846538425
• Binding: Paperback
• Number of pages: 296