New heuristic for the dynamic layout problem

Simple item page
dc.citation.epage1282en_US
dc.citation.issueNumber12en_US
dc.citation.spage1275en_US
dc.citation.volumeNumber54en_US
dc.contributor.authorErel, E.en_US
dc.contributor.authorGhosh, J. B.en_US
dc.contributor.authorSimon, J. T.en_US
dc.date.accessioned2016-02-08T10:28:22Z
dc.date.available2016-02-08T10:28:22Z
dc.date.issued2003en_US
dc.departmentDepartment of Managementen_US
dc.description.abstractThe dynamic layout problem addresses the situation where the traffic among the various units within a facility changes over time. Its objective is to determine a layout for each period in a planning horizon such that the total of the flow and the relocation costs is minimized. The problem is computationally very hard and has begun to receive attention only recently. In this paper, we present a new heuristic scheme, based on the idea of viable layouts, which is easy to operationalize. A limited computational study shows that, depending upon how it is implemented, this scheme can be reasonably fast and can yield results that are competitive with those from other available solution methods.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:28:22Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2003en
dc.identifier.doi10.1057/palgrave.jors.2601646en_US
dc.identifier.eissn1476-9360
dc.identifier.issn0160-5682
dc.identifier.urihttp://hdl.handle.net/11693/24371
dc.language.isoEnglishen_US
dc.publisherPalgrave Macmillanen_US
dc.relation.isversionofhttp://dx.doi.org/10.1057/palgrave.jors.2601646en_US
dc.source.titleJournal of the Operational Research Societyen_US
dc.subjectHeuristicsen_US
dc.subjectLayout planningen_US
dc.subjectMathematical programmingen_US
dc.subjectBudget controlen_US
dc.subjectCostsen_US
dc.subjectFacilitiesen_US
dc.subjectFlow patternsen_US
dc.subjectHeuristic methodsen_US
dc.subjectMathematical programmingen_US
dc.subjectPlanningen_US
dc.subjectProblem solvingen_US
dc.subjectRelocationen_US
dc.subjectSimulated annealingen_US
dc.subjectDynamic layout problemsen_US
dc.subjectOperations researchen_US
dc.titleNew heuristic for the dynamic layout problemen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
New_heuristic_for_the_dynamic_layout_problem.pdf
Size:
324.67 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Management