Treffer: A simple randomized algorithm for two-dimensional strip packing
Title:
A simple randomized algorithm for two-dimensional strip packing
Authors:
Source:
Computers & operations research. 40(1):1-8
Publisher Information:
Kidlington: Elsevier, 2013.
Publication Year:
2013
Physical Description:
print, 40 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Flots dans les réseaux. Problèmes combinatoires, Flows in networks. Combinatorial problems, Théorie de la décision. Théorie de l'utilité, Decision theory. Utility theory, Algorithme randomisé, Randomized algorithm, Algoritmo aleatorizado, Classification hiérarchique, Hierarchical classification, Clasificación jerarquizada, Hauteur, Height, Altura, Mesure information, Information measure, Medida información, Métamodèle, Metamodel, Metamodelo, Méthode heuristique, Heuristic method, Método heurístico, Plan randomisé, Randomized design, Plan aleatorizado, Priorité, Priority, Prioridad, Problème remplissage, Bin packing problem, Problema relleno, Résolution problème, Problem solving, Resolución problema, Heuristic, Packing problem
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Software school of Xiamen University, 361005, China
Department of Management Science, Xiamen University, 361005, China
Department of Management Science, Xiamen University, 361005, China
ISSN:
0305-0548
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Operational research. Management
Accession Number:
edscal.26380519
Database:
PASCAL Archive
Weitere Informationen
Two-dimensional strip packing problem is to pack given rectangular pieces on a strip of stock sheet having fixed width and infinite height. Its aim is to minimize the height of the strip such that non-guillotinable and fix orientation constraints are meet. In this paper, an improved scoring rule is developed and the least waste priority strategy is introduced, and a randomized algorithm is presented for solving this problem. This algorithm is very simple and does not need to set any parameters. Computational results on a wide range of benchmark problem instances show that the proposed algorithm obtains a better or matching performance as compared to the most of the previously published meta-heuristics.