An Efficient Hybrid Particle Swarm Optimization Algorithm for Solving the Uncapacitated Continuous Location-Allocation Problem
暂无分享,去创建一个
Mohammad Saeed Jabalameli | Ragheb Rahmaniani | Abdolsalam Ghaderi | Farnaz Barzinpour | M. Jabalameli | A. Ghaderi | F. Barzinpour | Ragheb Rahmaniani
[1] M. Jabalameli,et al. Hybrid algorithms for the uncapacitated continuous location-allocation problem , 2008 .
[2] An-Hsiang Wang,et al. Solving Location-allocation Problems with Rectilinear Distances by Simulated Annealing , 1994 .
[3] Sebastián Lozano,et al. Kohonen maps for solving a class of location-allocation problems , 1998, Eur. J. Oper. Res..
[4] Mitsuo Gen,et al. Hybrid evolutionary method for capacitated location-allocation problem , 1997 .
[5] Guohui Li,et al. Sites Selection of ATMs Based on Particle Swarm Optimization , 2009, 2009 International Conference on Information Technology and Computer Science.
[6] Valentin I. Spitkovsky,et al. Simulated N-Body: New Particle Physics-Based Heuristics for a Euclidean Location-Allocation Problem , 2001, J. Heuristics.
[7] S. L. Hakimi,et al. Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .
[8] Zeinab Azarmand,et al. Location Allocation Problem , 2009 .
[9] M. N. Neema,et al. New Genetic Algorithms Based Approaches to Continuous p-Median Problem , 2011 .
[10] Luiz Antonio Nogueira Lorena,et al. Local Search Heuristics for Capacitated p-Median Problems , 2003 .
[11] Xiaoming Yuan,et al. A heuristic algorithm for constrained multi-source Weber problem - The variational inequality approach , 2008, Eur. J. Oper. Res..
[12] Nenad Mladenović,et al. SOLVING THE CONTINUOUS LOCATION-ALLOCATION PROBLEM WITH TABU SEARCH , 1996 .
[13] A. Weber,et al. Alfred Weber's Theory of the Location of Industries , 1930 .
[14] L. Cooper. Location-Allocation Problems , 1963 .
[15] Russell C. Eberhart,et al. Guest Editorial Special Issue on Particle Swarm Optimization , 2004, IEEE Trans. Evol. Comput..
[16] Leon Cooper,et al. Heuristic Methods for Location-Allocation Problems , 1964 .
[17] K. Rosing. An Optimal Method for Solving the (Generalized) Multi-Weber Problem , 1992 .
[18] Francisco Saldanha-da-Gama,et al. Facility location and supply chain management - A review , 2009, Eur. J. Oper. Res..
[19] R. Love,et al. A computation procedure for the exact solution of location-allocation problems with rectangular distances , 1975 .
[20] Pierre Hansen,et al. Decomposition Strategies for Large Scale Continuous Location-Allocation Problems , 2004 .
[21] Richard M. Soland,et al. Exact and approximate solutions to the multisource weber problem , 1972, Math. Program..
[22] Sebastián Lozano,et al. A particle swarm optimization algorithm for part–machine grouping , 2006 .
[23] M Ohlemüller. Tabu search for large location–allocation problems , 1997 .
[24] Paul H. Calamai,et al. A projection method forlp norm location-allocation problems , 1994, Math. Program..
[25] James Kennedy,et al. Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.
[26] Kerstin Dächert,et al. Allocation search methods for a generalized class of location-allocation problems , 2009, Eur. J. Oper. Res..
[27] Mauricio G. C. Resende,et al. A fast swap-based local search procedure for location problems , 2007, Ann. Oper. Res..
[28] Russell C. Eberhart,et al. Parameter Selection in Particle Swarm Optimization , 1998, Evolutionary Programming.
[29] R. Love,et al. Properties and Solution Methods for Large Location—Allocation Problems , 1982 .
[30] Fang-Chih Tien,et al. Self-organizing feature maps for solving location-allocation problems with rectilinear distances , 2004, Comput. Oper. Res..
[31] Nenad Mladenović,et al. A Variable Neighbourhood Algorithm for Solving the Continuous Location-Allocation Problem , 1995 .
[32] Andreas Drexl,et al. Facility location models for distribution system design , 2005, Eur. J. Oper. Res..
[33] I. K. Altinel,et al. Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps , 2006, J. Oper. Res. Soc..
[34] Yuhui Shi,et al. Particle swarm optimization: developments, applications and resources , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).
[35] Baoding Liu,et al. New stochastic models for capacitated location-allocation problem , 2003, Comput. Ind. Eng..
[36] Alice E. Smith,et al. Solving the semi-desirable facility location problem using bi-objective particle swarm , 2007, Eur. J. Oper. Res..
[37] Polly Bart,et al. Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..
[38] Kathrin Klamroth,et al. An efficient solution method for Weber problems with barriers based on genetic algorithms , 2007, Eur. J. Oper. Res..
[39] R. A. Whitaker,et al. A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems , 1983 .
[40] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[41] Horst A. Eiselt,et al. A bibliography for some fundamental problem categories in discrete location science , 2008, Eur. J. Oper. Res..
[42] Rui Kang,et al. Some optimal models for facility location-allocation problem with random fuzzy demands , 2011, Appl. Soft Comput..
[43] Saïd Salhi,et al. A Genetic Algorithm Based Approach for the Uncapacitated Continuous Location–Allocation Problem , 2003, Ann. Oper. Res..
[44] Pierre Hansen,et al. Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem , 2000, Oper. Res..
[45] Pierre Hansen,et al. Heuristic solution of the multisource Weber problem as a p-median problem , 1996, Oper. Res. Lett..
[46] Christopher R. Houck,et al. Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems , 1996, Comput. Oper. Res..