Les Inscriptions à la Bibliothèque sont ouvertes en
ligne via le site: https://biblio.enp.edu.dz
Les Réinscriptions se font à :
• La Bibliothèque Annexe pour les étudiants en
2ème Année CPST
• La Bibliothèque Centrale pour les étudiants en Spécialités
A partir de cette page vous pouvez :
Retourner au premier écran avec les recherches... |
Détail de l'auteur
Auteur M-K. Kang
Documents disponibles écrits par cet auteur
Affiner la rechercheHeuristics with a new block strategy for the single and multiple containers loading problems / M-K. Kang in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 95–107
Titre : Heuristics with a new block strategy for the single and multiple containers loading problems Type de document : texte imprimé Auteurs : M-K. Kang, Auteur ; C-S. Jang, Auteur ; K-S. Yoon, Auteur Année de publication : 2011 Article en page(s) : pp. 95–107 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Container loading problem Packing Heuristics Index. décimale : 001.424 Résumé : A heuristic algorithm using new block strategy for the heterogeneous single and multiple containers loading problem (CLP) is proposed in this paper. In order to solve the single CLP, this algorithm fills unused spaces with the homogeneous load-blocks of identically oriented boxes and splits residual space into three child-spaces starting with an empty container. An initial container pattern is first built applying this approach recursively until all boxes are stowed or no unused spaces are left. And then, alternative container patterns are generated after replacing the load-blocks of the pattern-determining spaces in the initial container pattern with the alternative-blocks previously stored. Finally, an improvement procedure compares these alternatives with the initial container pattern to identify an improved container pattern. An algorithm for the multiple CLP uses the single CLP algorithm to generate an initial solution and uses improvement procedures to improve the initial solution. Numerical experiments with 715 test cases for the single CLP and 47 test cases for the multiple the CLP revealed the excellent performance of this algorithm. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008120a.html [article] Heuristics with a new block strategy for the single and multiple containers loading problems [texte imprimé] / M-K. Kang, Auteur ; C-S. Jang, Auteur ; K-S. Yoon, Auteur . - 2011 . - pp. 95–107.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 95–107
Mots-clés : Container loading problem Packing Heuristics Index. décimale : 001.424 Résumé : A heuristic algorithm using new block strategy for the heterogeneous single and multiple containers loading problem (CLP) is proposed in this paper. In order to solve the single CLP, this algorithm fills unused spaces with the homogeneous load-blocks of identically oriented boxes and splits residual space into three child-spaces starting with an empty container. An initial container pattern is first built applying this approach recursively until all boxes are stowed or no unused spaces are left. And then, alternative container patterns are generated after replacing the load-blocks of the pattern-determining spaces in the initial container pattern with the alternative-blocks previously stored. Finally, an improvement procedure compares these alternatives with the initial container pattern to identify an improved container pattern. An algorithm for the multiple CLP uses the single CLP algorithm to generate an initial solution and uses improvement procedures to improve the initial solution. Numerical experiments with 715 test cases for the single CLP and 47 test cases for the multiple the CLP revealed the excellent performance of this algorithm. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008120a.html