In Rectangular BIN-Packing Problem Based on its Block Strucrure.

E.A.Mukhacheva, A.F.Valeeva, A.S.Mukhacheva: In Rectangular BIN-Packing Problem Based on its Block Strucrure CSIT 2000 : 270-279

Abstract

The problem of rectangular objects packing into a semi-endless strip is under consideration. Here we propose to solve this problem by linear cutting approximation that may be presented as block structure of packing. Sometimes it becomes necessary to rearrange elements inside linear cutting block. The determined method of "reconstruction" (REC) proposed below helps to get solutiond close to optimal for some classes of problems. But as usial REC does not ensure rven local minimum. Two probabilistic methods that can ensure the best goal function parameters are considered in the paper: gynetic algorithm and dynamic sorting. Numerical experiment results are shown.

Copyright © 2000 by the Institute for Contemporary Education "JurInfoR-MSU". Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the CSIT copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Institute for Contemporary Education JMSUICE. To copy otherwise, or to republish, requires a fee and/or special permission from the JMSUICE.

Printed Edition

Heinz Schweppe and Yuri S. Kabalnov (Eds.): CSIT'2000, Proceedings of 2nd International Workshop on Computer Science and Information Technologies, September 18-23, 2000, Ufa, Russia. USATU Publishers & JurInfoR-MSU Publishing 2000, ISBN 5-86911-312-1

Electronic Edition