Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem

References

• Avriel M.Nonlinear Programming: Analysis and Methods (1976) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Baxter J. Local optima avoidance in depot location. J. Oper. Res. Soc. (1981) 32:815–819Crossref, Google Scholar
• Bhaskaran S. Identification of transshipment center locations. Euro. J. Oper. Res. (1992) 63:141–150Crossref, Google Scholar
• Boese K. D., Kahng A. B., Muddu S. A new adaptive multi-start technique for combinatorial global optimizations. Oper. Res. Letters (1994) 16:101–113Crossref, Google Scholar
• Bongartz I., Calamai P. H., Conn A. R. A projection method for lp norm location-allocation problems. Math. Programming (1994) 66:283–312Crossref, Google Scholar
• Brimberg J., Chen R., Chen D. Accelerating convergence in the Fermat-Weber location problem. Oper. Res. Letters (1998) 22:151–157Crossref, Google Scholar
• Brimberg J., Love R. F. Global convergence of a generalized iterative procedure for the minisum location problem with lp distances. Oper. Res. (1993) 41:1153–1163Link, Google Scholar
• Brimberg J., Mladenović N. Solving the continuous location-allocation problem with Tabu search. Studies in Locational Anal. (1996a) 8:23–32Google Scholar
• Brimberg J., Mladenović N. A variable neighbourhood algorithm for solving the continuous location-allocation problem. Studies in Locational Anal. (1996b) 10:1–12Google Scholar
• Brimberg J., Mladenović N. Degeneracy in the multi-source Weber problem. Les Cahiers du GERAD, G-98-08 (1998) MontrealAlso appears in Math. Programming (1999) 85 213–220Google Scholar
• Charalambous C., Bandler J. W. Non-linear optimization as a sequence of least p-th optimization with finite values of p. Internat. J. System Sci. (1976) 7:377–391Crossref, Google Scholar
• Chen R. Solution of minisum and minimax location-allocation problems with Euclidean distances. Naval Res. Logist. Quart. (1983) 30:449–459Crossref, Google Scholar
• Chen P. C., Hansen P., Jaumard B., Tuy H. Solution of the multisource Weber and conditional Weber problems by d.-c. programming. Oper. Res. (1992) 46(1998):548–562Les Cahiers du GERAD, G-92-35, Montreal, CanadaGoogle Scholar
• Cooper L. Location-allocation problems. Oper. Res. (1963) 11:331–343Link, Google Scholar
• Cooper L. Heuristic methods for location-allocation problems. SIAM Rev. (1964) 6:37–53Crossref, Google Scholar
• Cooper L. Solutions of generalized locational equilibrium models. J. Regional Sci. (1967) 7:1–18Crossref, Google Scholar
• Drezner Z. The planar two-center and two-median problems. Transp. Sci. (1984) 18:351–361Link, Google Scholar
• Drezner Z. A note on the Weber location problem. Ann. Oper. Res. (1992) 40:153–161Crossref, Google Scholar
• Eilon S., Watson-Gandy C. D. T., Christofides N.Distribution Management (1971) (Hafner, New York) Google Scholar
• Fleischmann B., Paraschis J. Solving a large scale districting problem: a case report. Comput. Oper. Res. (1988) 15:521–533Crossref, Google Scholar
• Frenk J. B. G., Melo M. T., Zhang S. A Weiszfeld method for a generalized lp distance minisum location model in continuous space. Location Sci. (1994) 2:111–127Google Scholar
• Gendreau M., Hertz A., Laporte G. The Traveling Salesman Problem with backhauls. Comput. Oper. Res. (1996) 23:501–508Crossref, Google Scholar
• Glover F. Tabu search. Part I. ORSA J. Comput. (1989) 1:190–206Link, Google Scholar
• Glover F. Tabu search. Part II. ORSA J. Comput. (1990) 2:4–32Link, Google Scholar
• Glover F., Laguna M., Reeves C. Tabu search. Modern Heuristic Techniques for Combinatorial Problems (1993) (Oxford, Blackwell) . (Chapter 3)Google Scholar
• Hanjoul P., Peeters D. A comparison of two dual-based procedures for solving the p-Median problem. Euro. J. Oper. Res. (1985) 20:387–396Crossref, Google Scholar
• Hansen P., Jaumard B. Algorithms for the maximum satisfiability problem. Comput. (1990) 44:279–303Crossref, Google Scholar
• Hansen P., Mladenović N., Voss S., et al. An introduction to variable neighborhood search. Les Cahiers du GERAD, G-97-51, Montreal, Canada and Metaheuristics Advances and Trends in Local Search Paradigms for Optimization (1997) (Kluwer, Dordrecht) . 1999Google Scholar
• Hansen P., Mladenović N., Taillard É. Heuristic solution of the multisource Weber problem as a p-Median problem. Oper. Res. Letters (1996) 22(1998):55–62Les Cahiers du GERAD, G-96-10, Montreal, CanadaGoogle Scholar
• Hansen P., Jaumard B., Krau S., du Merle O. A column generation algorithm for the multisource Weber problem. Les Cahiers du GERAD (1997) . (forthcoming 2000)Google Scholar
• Holland J. H.Adaptation in Natural and Artificial Systems (1975) (The University of Michigan Press, Ann Arbor, MI) Google Scholar
• Houck C. R., Joines J. A., Kay M. G. Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems. Comput. Oper. Res. (1996) 23:587–596Crossref, Google Scholar
• Krau S. Extensions du problème de Weber. (1997) . Ph.D. Thèse, École Polytechnique de Montréal (under direction of P. Hansen and B. Jaumard)Google Scholar
• Kuenne R. E., Soland R. M. Exact and approximate solutions to the multisource Weber problem. Math. Programming (1972) 3:193–209Crossref, Google Scholar
• Kuhn H. W. A note on Fermat's problem. Math. Programming (1973) 4:98–107Crossref, Google Scholar
• Love R. F., Juel H. Properties and solution methods for large location-allocation problems. J. Oper. Res. Soc. (1982) 33:443–452Google Scholar
• Love R. F., Morris J. G. A computational procedure for the exact solution of location-allocation problems with rectangular distances. Naval Res. Logist. Quart. (1975) 22:441–453Crossref, Google Scholar
• Love R. F., Morris J. G., Wesolowsky G. O.Facilities Location: Models and Methods (1988) (North Holland, New York) Google Scholar
• Megiddo N., Supowit K. J. On the complexity of some common geometric location problems. SIAM J. Comput. (1984) 13:182–196Crossref, Google Scholar
• du Merle O., Villeneuve D., Desrosiers J., Hansen P. Stabilization dans le cadre de la génération de colonnes. (1996) Les Cahiers du GERAD G-97-08MontrealGoogle Scholar
• Mirchandani P., Francis R.Discrete Location Theory (1990) (Wiley-Interscience, New York) Google Scholar
• Mladenović N. A variable neighbourhood algorithm—a new metaheuristic for combinatorial optimization. (1995) Abstract of papers presented at Optimization DaysMontreal:112–112Google Scholar
• Mladenović N., Brimberg J. A descent-ascent technique for solving the multisource Weber problem. Yugoslav J. Oper. Res. (1995) 5:211–219Google Scholar
• Mladenović N., Hansen P. Variable neighbourhood search. Comput. Oper. Res. (1997) 24:1097–1100Crossref, Google Scholar
• Moreno J., Rodrigez C., Jimenez N. Heuristic cluster algorithm for multiple facility location-allocation problem. RAIRO. Oper. Res. (1990) 25:97–107Crossref, Google Scholar
• Murtagh B. A., Niwattisyawong S. R. An efficient method for the multi-depot location-allocation problem. J. Oper. Res. Soc. (1982) 33:629–634Google Scholar
• Ostresh L. M., Rushton G., Goodchild M. F., Ostresh L. M. TWAIN-exact solutions to the two source location-allocation problem. Computer Programs for Location-Allocation Problems (1973a) (Department of Geography, University of Iowa, Iowa City, IA) . Monograph Number 6Google Scholar
• Ostresh L. M., Rushton G., Goodchild M. F., Ostresh L. M. MULTI-exact solutions to the M-center location-allocation problem. Computer Programs for Location-Allocation Problems (1973b) (Department of Geography, University of Iowa, Iowa City, IA) . Monograph Number 6Google Scholar
• Ostresh L. M. An efficient algorithm for solving the two center location-allocation problem. J. Regional Sci. (1975) 15:209–216Crossref, Google Scholar
• Reinelt G. TSLIB—a traveling salesman library. ORSA J. Comput. (1991) 3:376–384Link, Google Scholar
• Rolland E., Schilling D. A., Current J. R. An efficient Tabu search procedure for the p-median problem. Euro. J. Oper. Res. (1996) 96:329–342Crossref, Google Scholar
• Rosen J. B., Xue G.-L. Computational comparison of two algorithms for the Euclidean single facility location problem. ORSA J. Comput. (1991) 3:207–212Link, Google Scholar
• Rosing K. E. An optimal method for solving the (generalized) multi-Weber problem. Euro. J. Oper. Res. (1992) 58:414–426Crossref, Google Scholar
• Scott A. J. Location-allocation systems: a review. Geographical Anal. (1970) 2:95–119Crossref, Google Scholar
• Sullivan P. J., Peters N. A flexible user oriented location-allocation algorithm. J. Environmental Management (1980) 10:181–193Google Scholar
• Teitz M. B., Bart P. Heuristic methods for estimating the generalized vertex median of a weighted graph. Oper. Res. (1968) 16:955–961Link, Google Scholar
• Whitaker R. A fast algorithm for the greedy-interchange for large-scale clustering and median location problems. INFOR (1983) 21:95–108Google Scholar