Plant Location with Generalized Search Origin

Publisher Website
Google Scholar
Abstract
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.

This publication has 0 references indexed in Scilit: