Finding multiple global optima for unconstrained discrete location problems

Optimization Methods and Software

Volumn 26, Issue 2, 2011, Pages 207-224

  Redondo, J L ^a   Pelegrin, B ^b   Fernandez, P ^b   Garcia, I ^a   Ortigosa, P M ^a  

^a UNIVERSITY OF ALMERÍA   (Spain)

^b UNIVERSITY OF MURCIA   (Spain)

Author keywords

discrete location; evolutionary computing; global optimization; multimodal genetic algorithms

Indexed keywords

COMPUTATIONAL TIME; DISCRETE LOCATION; EVOLUTIONARY COMPUTING; FACILITY LOCATIONS; FITNESS FUNCTIONS; GLOBAL OPTIMAL SOLUTIONS; GLOBALOPTIMUM; LOCATION PROBLEMS; MULTI-MODAL; MULTISTART; NEW PARAMETERS; OBJECTIVE FUNCTIONS; OPTIMIZERS; P-MEDIAN; PARALLELIZATIONS; PARAMETER VALUES; PREFERRED SOLUTIONS;

FUNCTION EVALUATION; GENETIC ALGORITHMS; GLOBAL OPTIMIZATION; OPTIMAL SYSTEMS;

OPTIMIZATION;

EID: 79951902198     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780903567760     Document Type: Article

References (13)

1. E. Alba, Parallel Metaheuristics. A New Class of Algorithms, John Wiley and Sons, Hoboken, NJ, 2005.
2. J. Beasley, Or-library: Distributing testproblems by electronic mail, J. Oper. Res. Soc 41 (1990), pp. 1069-1072.
3. O. Berman and D. Krass, The generalized maximal covering location problem, Comput. Oper. Res. 29 (2002), pp. 563-581. (Pubitemid 34099405)
4. G. Cornuejols, M. Fisher, and G. Nemhauser, Locations ofbank accounts to optimizefloat: An analytical study of exact and approximate algorithms, Manage. Sci. 23 (1997), pp. 789-810.
5. H. Eiselt and G. Laporte, Objectives in location problems, in Facility Location: A Survey of Applications and Methods, Z. Drezner, ed., Springer Series in Operations Research and Financial Engineering, Springer, Berlin, 1995, pp. 151-180.
6. R. Francis, T. Lowe, and A. Tamir, Demandpoint aggregation for location models, in Facility Location: Application and Theory, Z. Drezner and H. Hamacher, eds., Springer, Berlin, 2002, pp. 207-232.
7. S. Hakimi, Locating newfacilities in a competitive environment, Eur. J. Oper. Res. 12 (1983), pp. 29-35.
8. J. Mesa, J. Puerto, and A. Tamir, Improved algorithmsfor several network locationproblems with equality measures, Discrete Appl. Math. 130 (2003), pp. 437-448.
9. B. Pelegrín, J. Redondo, P. Fernández, I. García, and P. Ortigosa, GASUB: Finding global optima to discrete location problems by a genetic-like algorithm, J. Glob. Optim. 38 (2007), pp. 249-264. (Pubitemid 46686131)
10. J. Redondo, Solving competitive location problems via memetic algorithms: High performance computing approaches, Ph.D. thesis, University of Almería, 2008.
11. J. Redondo, J. Fernández, I. García, and P. Ortigosa, Parallel algorithms for continuous competitive location problems, Optim. Methods Softw. 23 (2008), pp. 779-791.
12. O. Shylo, T. Middelkoop, and P. Pardalos, Restart strategies in optimization: Parallel and serial cases, Tech. Rep. CAO-0529, Department of Industrial and Systems Engineering, University of Florida, 2008. Available at http://plaza.ufl.edu/shylo/technical-report0529.pdf
13. FICO Xpress Mosel 32-bit v3.0.0.©2009 Fair Isaac Corp.