A branch and bound algorithm for locating input and output points of departments on the block layout

Cited 23 time in webofscience Cited 0 time in scopus
  • Hit : 837
  • Download : 6
We consider the problem of locating input and output (I/O) points of each department for a given layout. The objective of the problem is to minimise the total distance of material flows between the I/O points. Here, distances between the I/O points are computed as the lengths of the shortest path (not the rectilinear distances) between the I/O points. We developed a procedure to eliminate dominated candidate positions of I/O points that do not need to be considered. With this procedure, a large number of dominated candidate positions can be eliminated. A linear programming (LP) model for minimising the total rectilinear distance of flows is used to obtain a lower bound. Using the elimination procedure and the LP model, a branch and bound algorithm is developed to find an optimal location of the I/O points. Results from computational experiments show that the suggested algorithm finds optimal solutions in a very short time even for large-sized problems.
Publisher
STOCKTON PRESS
Issue Date
1999-05
Language
English
Article Type
Article
Keywords

FACILITY LAYOUT; SYSTEMS; DESIGN

Citation

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.50, no.5, pp.517 - 525

ISSN
0160-5682
DOI
10.1057/palgrave.jors.2600720
URI
http://hdl.handle.net/10203/7614
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 23 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0