UFLPUncapacitated Facility Location Problem
References in periodicals archive ?
CFLP is solved by decomposing the problem into an allocation problem (which can be solved by polynomial time transportation algorithm) and a location problem (where the capacity constraints is initially relaxed, transforming it to a UFLP, which has many ready solutions).
2002) apply GA to various location problems which include UFLP and CFLP, however, found that GA is too excessively time consuming for CFLP and abandon the computational test, although GA is found to be effective for UFLP.
The successful application of GA to location-allocation problems can be found in p-median problems, which is similar to UFLP, except that they do not involve fixed charges and the number of facilities is predetermined.