Documents disponibles écrits par cet auteur

An effective recursive partitioning approach for the packing of identical rectangles in a rectangle / E. G. Birgin in Journal of the operational research society (JORS), Vol. 61 N° 2 (Fevrier 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 2 (Fevrier 2010) . - pp. 306–320 Titre : An effective recursive partitioning approach for the packing of identical rectangles in a rectangle Type de document : texte imprimé Auteurs : E. G. Birgin, Auteur ; R. D. Lobato, Auteur ; R. Morabito, Auteur Année de publication : 2011 Article en page(s) : pp. 306–320 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Cutting  and  packing  Manufacturer's  pallet  loading  problem  Woodpulp  stowage  problem  Non-guillotine  cutting  pattern  Dynamic  programming  Raster  points Index. décimale : 001.424 Résumé : In this work, we deal with the problem of packing (orthogonally and without overlapping) identical rectangles in a rectangle. This problem appears in different logistics settings, such as the loading of boxes on pallets, the arrangements of pallets in trucks and the stowing of cargo in ships. We present a recursive partitioning approach combining improved versions of a recursive five-block heuristic and an L-approach for packing rectangles into larger rectangles and L-shaped pieces. The combined approach is able to rapidly find the optimal solutions of all instances of the pallet loading problem sets Cover I and II (more than 50 000 instances). It is also effective for solving the instances of problem set Cover III (almost 100 000 instances) and practical examples of a woodpulp stowage problem, if compared to other methods from the literature. Some theoretical results are also discussed and, based on them, efficient computer implementations are introduced. The computer implementation and the data sets are available for benchmarking purposes. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n2/abs/jors2008141a.html [article] An effective recursive partitioning approach for the packing of identical rectangles in a rectangle [texte imprimé] / E. G. Birgin, Auteur ; R. D. Lobato, Auteur ; R. Morabito, Auteur . - 2011 . - pp. 306–320. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 2 (Fevrier 2010) . - pp. 306–320 Mots-clés : Cutting  and  packing  Manufacturer's  pallet  loading  problem  Woodpulp  stowage  problem  Non-guillotine  cutting  pattern  Dynamic  programming  Raster  points Index. décimale : 001.424 Résumé : In this work, we deal with the problem of packing (orthogonally and without overlapping) identical rectangles in a rectangle. This problem appears in different logistics settings, such as the loading of boxes on pallets, the arrangements of pallets in trucks and the stowing of cargo in ships. We present a recursive partitioning approach combining improved versions of a recursive five-block heuristic and an L-approach for packing rectangles into larger rectangles and L-shaped pieces. The combined approach is able to rapidly find the optimal solutions of all instances of the pallet loading problem sets Cover I and II (more than 50 000 instances). It is also effective for solving the instances of problem set Cover III (almost 100 000 instances) and practical examples of a woodpulp stowage problem, if compared to other methods from the literature. Some theoretical results are also discussed and, based on them, efficient computer implementations are introduced. The computer implementation and the data sets are available for benchmarking purposes. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n2/abs/jors2008141a.html

Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm / E. G. Birgin in Journal of the operational research society (JORS), Vol. 63 N° 2 (Fevrier 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 183–200 Titre : Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm Type de document : texte imprimé Auteurs : E. G. Birgin, Auteur ; R. D. Lobato, Auteur ; R. Morabito, Auteur Année de publication : 2012 Article en page(s) : pp. 183–200 Note générale : Recherche opérationne183–200lle Langues : Anglais (eng) Mots-clés : Cutting  and  packing  Two-dimensional  non-guillotine  cutting  pattern  Dynamic  programming  Recursive  approach  Distributor's  pallet  loading  problem Index. décimale : 001.424 Résumé : In this study, a dynamic programming approach to deal with the unconstrained two-dimensional non-guillotine cutting problem is presented. The method extends the recently introduced recursive partitioning approach for the manufacturer's pallet loading problem. The approach involves two phases and uses bounds based on unconstrained two-staged and non-staged guillotine cutting. The method is able to find the optimal cutting pattern of a large number of pro blem instances of moderate sizes known in the literature and a counterexample for which the approach fails to find known optimal solutions was not found. For the instances that the required computer runtime is excessive, the approach is combined with simple heuristics to reduce its running time. Detailed numerical experiments show the reliability of the method. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors20116a.html [article] Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm [texte imprimé] / E. G. Birgin, Auteur ; R. D. Lobato, Auteur ; R. Morabito, Auteur . - 2012 . - pp. 183–200. Recherche opérationne183–200lle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 183–200 Mots-clés : Cutting  and  packing  Two-dimensional  non-guillotine  cutting  pattern  Dynamic  programming  Recursive  approach  Distributor's  pallet  loading  problem Index. décimale : 001.424 Résumé : In this study, a dynamic programming approach to deal with the unconstrained two-dimensional non-guillotine cutting problem is presented. The method extends the recently introduced recursive partitioning approach for the manufacturer's pallet loading problem. The approach involves two phases and uses bounds based on unconstrained two-staged and non-staged guillotine cutting. The method is able to find the optimal cutting pattern of a large number of pro blem instances of moderate sizes known in the literature and a counterexample for which the approach fails to find known optimal solutions was not found. For the instances that the required computer runtime is excessive, the approach is combined with simple heuristics to reduce its running time. Detailed numerical experiments show the reliability of the method. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors20116a.html