论文信息 - Recent models and techniques for solving the layout problem - 字舞流文

Recent models and techniques for solving the layout problem

Abstract In this paper, some models for the layout problem are surveyed. Seven heuristic algorithms for solving the models are also listed and briefly compared. Certain issues that need to be addressed while solving the layout problem are mentioned.

Sunderesh S. Heragu | S. Heragu

[1] Andrew Kusiak,et al. Machine layout: an optimization and knowledge-based approach , 1990 .

[2] A. Alfa,et al. Experimental analysis of simulated annealing based algorithms for the layout problem , 1992 .

[3] Marc Goetschalckx,et al. Matching Based Interactive Facility Layout , 1987 .

[4] M. Bazaraa. Computerized Layout Design: A Branch and Bound Approach , 1975 .

[5] Donald M. Simmons. One-Dimensional Space Allocation: An Ordering Algorithm , 1969, Oper. Res..

[6] Jadranka Skorin-Kapov,et al. Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..

[7] Andrew Kusiak,et al. The facility layout problem , 1987 .

[8] T. Koopmans,et al. Assignment Problems and the Location of Economic Activities , 1957 .

[9] D. Adolphson. Optimal linear-ordering. , 1973 .

[10] J. Y. Wong,et al. Solving quadratic assignment problems with rectangular distances and integer programming , 1976 .

[11] Andrew Kusiak,et al. Machine Layout Problem in Flexible Manufacturing Systems , 1988, Oper. Res..

[12] J. Y. Wong,et al. On Solving A One-Dimensional Space Allocation Problem With Integer Programming , 1976 .

[13] Teofilo F. Gonzalez,et al. P-Complete Approximation Problems , 1976, J. ACM.

[14] Maurice Queyranne,et al. On the One-Dimensional Space Allocation Problem , 1981, Oper. Res..

[15] S. Heragu,et al. Efficient models for the facility layout problem , 1991 .