A robust and efficient algorithm for planar competitive location problems |
| |
Authors: | J L Redondo J Fernández I García P M Ortigosa |
| |
Institution: | (1) Department of Computer Arquitecture and Electronics, University of Almería, Almería, Spain;(2) Facultad de Matemáticas, Universidad de Murcia, 30100 Espinardo, Murcia, Spain;(3) Department of Statistics and Operations Research, University of Murcia, Murcia, Spain |
| |
Abstract: | In this paper we empirically analyze several algorithms for solving a Huff-like competitive location and design model for
profit maximization in the plane. In particular, an exact interval branch-and-bound method and a multistart heuristic already
proposed in the literature are compared with uego (Universal Evolutionary Global Optimizer), a recent evolutionary algorithm. Both the multistart heuristic and uego use a Weiszfeld-like algorithm as local search procedure. The computational study shows that uego is superior to the multistart heuristic, and that by properly fine-tuning its parameters it usually (in the computational
study, always) find the global optimal solution, and this in much less time than the interval branch-and-bound method. Furthermore, uego can solve much larger problems than the interval method. |
| |
Keywords: | Continuous location Competition Weiszfeld-like algorithm Heuristic Evolutionary algorithm Computational study |
本文献已被 SpringerLink 等数据库收录! |
|