Different approaches for the loop layout problems: a review

作者：Saravanan M^*; Kumar S Ganesh

来源：International Journal of Advanced Manufacturing Technology, 2013, 69(9-12): 2513-2529.

DOI：10.1007/s00170-013-5133-4

• Combinatorial optimization
• Quadratic assignment problems (QAP)
• Mixed integer programming (MIP)

In the manufacturing process, loop layout problems (LLPs) are preferred to configurations like single row layout, double row layout, cluster layout, and circular layout for their relative lower initial investment costs because they contain a minimal number of required material links to connect all workstations while providing a high degree of material handling flexibility. The performance of a system is based on the impact of the loop layout. Most of these LLPs are non-polynomial hard. Numerous research works related to loop layout have been published. The literature analysis given here is not restricted to specific considerations about loop layout design. This paper aims to deal with the current and future trends of research on LLPs based on previous research including formulations, solution methodologies. A trend toward bidirectional assumption, large-sized test problems, mixed integer programming, shortcuts instead of additional loop, loading and waiting time for shortcuts, integration of the supply chain management with the data envelopment analysis and also integrate exact, decomposition algorithm with metaheuristics, and developing loop layout using metaheuristics such as scatter search algorithm, improved tabu search, and artificial bees colony algorithm to loop layout is observed. Several research directions are pointed out and discussed.

• 出版日期2013-12