Show simple item record

dc.contributor.authorBarbarasoğlu, G
dc.contributor.authorÖzdamar, Linet
dc.date.accessioned2014-11-05T14:45:50Z
dc.date.available2014-11-05T14:45:50Z
dc.date.issued2000-08
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/11413/820
dc.description.abstractThis study describes an analysis of different neighbourhood transition schemes and their effects; on the performance of a general purpose simulated annealing (SA) procedure in solving the dynamic multi-level capacitated lot sizing problem (MLCLSP) with general product structures. The proposed neighbourhood transition schemes are based on relaxing different types of constraints, each of which defines a different solution space. The experiments assess the influence of expanding the search space which includes infeasibilities arising from the elimination of different model restrictions. The results indicate that the performance of SA is highly dependent on the definition and the tightness of the search space. Furthermore, the increase in the number of search moves carried out by SA is shown to significantly improve the results with linearly increasing computational times.tr_TR
dc.language.isoen_UStr_TR
dc.publisherPERGAMON-ELSEVIER SCIENCE LTD, THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLANDtr_TR
dc.relationCOMPUTERS & OPERATIONS RESEARCHtr_TR
dc.subjectsimulated annealingtr_TR
dc.subjectneighbourhood transition schemestr_TR
dc.subjectcapacitated lot sizing with setup timestr_TR
dc.subjectısıl işlemtr_TR
dc.subjectmahalle geçiş şemalarıtr_TR
dc.subjectsetup süreleri ile kapasitan lot boyutlandırmatr_TR
dc.titleAnalysis of Solution Space-Dependent Performance of Simulated Annealing: The Case of the Multi-level Capacitated Lot Sizing Problemtr_TR
dc.typeArticletr_TR
dc.identifier.wos86865700005
dc.identifier.scopus2-s2.0-0034073578


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record