Please use this identifier to cite or link to this item: https://dspace.univ-ouargla.dz/jspui/handle/123456789/2339
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAbdelkader LAMAMRI, Hacène AIT HADDADENE,Anass NAGIH-
dc.date.accessioned2013-12-18T13:33:06Z-
dc.date.available2013-12-18T13:33:06Z-
dc.date.issued2013-12-18-
dc.identifier.issndj-
dc.identifier.urihttp://hdl.handle.net/123456789/2339-
dc.description7 ieme Colloque sur l'Optimisation et les Systèmes d’Information COSI_2010 18-20 Avril 2010en_US
dc.description.abstractWe are interested in problems from combinatorial optimization, more precisely, the problem of construction crew rotations with resource constraints. The problem is to cover the cost of all flights of the company. Given the large size of the problems encountered in industry, these models are solved by an approach based on column generation that can handle implicitly all feasible solutions and a master problem determining the best solution. We propose in this paper an approach to improve the acceleration of the method of column generation for solving the problem of construction crew rotations, it is projected in each arc, the resources a vector of size smaller by using a Lagrangean relaxation algorithm to determine the coefficients of the projection arc combined with an algorithm for re-optimization, then generates a sub-set of complementary solutions to the master problem. The preliminary experiments of our technique gave good results on instances of random rotation of crews.en_US
dc.language.isoenen_US
dc.subjectCombinatorial optimizationen_US
dc.subjectcolumn generationen_US
dc.subjectmathematical programmingen_US
dc.titleUne Approche pour l’accélération de la génération de colonnes appliquées au problème de rotations d'équipagesen_US
dc.typeArticleen_US
Appears in Collections:2. Faculté des nouvelles technologies de l’information et de la communication

Files in This Item:
File Description SizeFormat 
Abdelkader LAMAMRI.pdf526,69 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.