Plant Location with Generalized Search Origin

There exists computational experience to the effect that search algorithms of the type introduced by Balas are frequently ineffective because of being tied to a rigid “natural” search origin. In this paper the dynamic relocation of the search origin to possibly more appropriate points is advocated. Details of such a procedure are given for the Simple Plant Location Problem. Computational improvements of, sometimes, a striking nature are presented.

• 저널Management Science · 16(3) · 165–178
• 토픽Data Management and Algorithms · Signal Processing
• DOI10.1287/mnsc.16.3.165
• 저자Kurt Spielberg