dc.contributor.author | Zissimopoulos, Vassilis | |
dc.contributor.author | Hifi, Mhand | |
dc.contributor.author | Paschos, Vangelis | |
dc.date.accessioned | 2009-10-07T08:42:50Z | |
dc.date.available | 2009-10-07T08:42:50Z | |
dc.date.issued | 2004 | |
dc.identifier.uri | https://basepub.dauphine.fr/handle/123456789/2151 | |
dc.language.iso | en | en |
dc.subject | Simulated annealing | en |
dc.subject | Optimization | en |
dc.subject | Heuristics | en |
dc.subject | Cutting | en |
dc.subject.ddc | 003 | en |
dc.title | A simulated annealing approach for the circular cutting problem | en |
dc.type | Article accepté pour publication ou publié | |
dc.contributor.editoruniversityother | Université Paris 1;France | |
dc.contributor.editoruniversityother | Department of Informatics, University of Athens;Grèce | |
dc.contributor.editoruniversityother | Université d'Amiens;France | |
dc.description.abstracten | We propose a heuristic for the constrained and the unconstrained circular cutting problem based upon simulated annealing. We define an energy function, the small values of which provide a good concentration of the circular pieces on the left bottom corner of the initial rectangle. Such values of the energy correspond to configurations where pieces are placed in the rectangle without overlapping. Appropriate software has been devised and computational results and comparisons with some other algorithms are also provided and discussed. | en |
dc.relation.isversionofjnlname | European Journal of Operational Research | |
dc.relation.isversionofjnlvol | 159 | en |
dc.relation.isversionofjnlissue | 2 | en |
dc.relation.isversionofjnldate | 2004 | |
dc.relation.isversionofjnlpages | 430-448 | en |
dc.relation.isversionofdoi | http://dx.doi.org/10.1016/S0377-2217(03)00417-X | en |
dc.description.sponsorshipprivate | oui | en |
dc.relation.isversionofjnlpublisher | Elsevier | en |
dc.subject.ddclabel | Recherche opérationnelle | en |