Allocation search methods for a generalized class of location-allocation problems
We consider a generalized class of location-allocation problems, in which N new facilities are to be located in the plane with respect to M objects. Each object is associated with a convex cost function, specifying the expenses for serving the object from any location in the plane. For the resulting multi-dimensional mixed-integer optimization problem, we compare various traditional and new search methods. In particular, we apply multi-start, (variable) neighborhood search, tabu search, simulated annealing, an evolutionary algorithm and an ant colony optimization algorithm. They all have in common that they use the well-known alternate location and allocation algorithm [Cooper, L., 1964. Heuristic methods for location-allocation problems. SIAM Review 6, 37-53] as core local search function. We intend to impart a generalized view on these randomized search methods and also examine the efficiency of the different search strategies in solving the multi-connection location-allocation problem, a relatively new instance of the generalized class of location-allocation problems. Computational results show that the most crucial feature of the heuristics is the ability to combine a diversified search over the whole solution space with an intensified search near the best-known solution.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Bischoff, M. & Klamroth, K., 2007. "An efficient solution method for Weber problems with barriers based on genetic algorithms," European Journal of Operational Research, Elsevier, vol. 177(1), pages 22-41, February.
- Rosing, K. E., 1992. "An optimal method for solving the (generalized) multi-Weber problem," European Journal of Operational Research, Elsevier, vol. 58(3), pages 414-426, May.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:192:y:2009:i:3:p:793-807. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.