Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout

Cited 5 time in webofscience Cited 0 time in scopus
  • Hit : 243
  • Download : 0
This paper focuses on the problem of designing a material flow network for a given block layout. For an efficient design of a network, we simultaneously consider locations of input and output points, flow paths, and the smoothness of material flow paths. A mixed integer programming formulation is given for the problem with the objective of minimising the sum of transportation cost, cost related to flow paths, and penalty cost for non-smooth flows, i.e., flows with many turns. We suggest two heuristic algorithms based on the linear programming relaxation and the Lagrangian relaxation techniques. To evaluate performance of the suggested algorithms, a series of computational experiments is performed on well-known problem instances as well as randomly generated test problems. Results show that the suggested algorithms give good solutions in a reasonable amount of computation time.
Publisher
TAYLOR FRANCIS LTD
Issue Date
2009
Language
English
Article Type
Article
Keywords

CYCLE-BASED NEIGHBORHOODS; HANDLING-SYSTEM DESIGN; FACILITY LAYOUT; LOCATION; GUIDE; ALGORITHM; POINTS

Citation

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v.47, no.18, pp.5185 - 5202

ISSN
0020-7543
DOI
10.1080/00207540802050852
URI
http://hdl.handle.net/10203/98771
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 5 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0