Algorithms for adjusting shapes of departments in block layouts on the grid-based plane

Many existing algorithms for facility layout problems give block layouts in which departments have irregular shapes. This paper presents algorithms to modify shapes of departments in a given block layout with such departments. With the suggested algorithms, a given block layout is converted into a new block layout in which departments are of rectangular shapes without a significant change in the relative positions of the departments. Results of computational experiments show that the suggested algorithms give block layouts that are at least as good as original layouts in terms of the total transportation distance. (C) 2000 Elsevier Science Ltd. All rights reserved.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
2000-02
Language
ENG
Keywords

SIMULATED ANNEALING ALGORITHM; FACILITY LAYOUT; DUAL GRAPH; SEARCH

Citation

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, v.28, no.1, pp.111 - 122

ISSN
0305-0483
URI
http://hdl.handle.net/10203/7694
Appears in Collection
IE-Journal Papers(저널논문)
  • Hit : 500
  • Download : 3
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 12 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0