论文信息 - DISCON: A New Method for the Layout Problem

DISCON: A New Method for the Layout Problem

Layout problems often involve a given number of facilities which must be located in the plane. Each of these facilities has a given area, and the cost of interactions between every facility pair is known. Problem optimality is achieved when facilities do not overlap and the total cost, which is the sum of weighted distances between all pairs of facilities, is minimized. The problem is formulated and solved as a nonconvex mathematical programming problem using a procedure termed DISpersion-CONcentration.

Zvi Drezner | Z. Drezner

[1] P. Gilmore. Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem , 1962 .

[2] E. M. L. Beale,et al. Nonlinear and Dynamic Programming , 1965 .

[3] Elwood S. Buffa,et al. A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities , 1963 .

[4] Thomas E. Vollmann,et al. An Experimental Comparison of Techniques for the Assignment of Facilities to Locations , 1968, Oper. Res..

[5] R. L. Francis,et al. Properties of a multifacility location problem involving euclidian distances , 1972 .

[6] Robert F. Love,et al. A Dual Decomposition Method for Minimizing Transportation Costs in Multifacility Location Problems , 1973 .

[7] Larry P. Ritzman. The Efficiency of Computer Algorithms for Plant Layout , 1972 .

[8] F. Hillier,et al. Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities , 1966 .