Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem

被引:27
作者
Redondo, Juana L. [1 ]
Fernandez, Jose [2 ]
Alvarez Hervas, Jose Domingo [3 ]
Gila Arrondo, Aranzazu [2 ]
Ortigosa, Pilar M. [4 ]
机构
[1] Univ Granada, Dept Comp Architecture & Technol, CeiA3, Granada, Spain
[2] Univ Murcia, Dept Stat & Operat Res, Murcia, Spain
[3] Univ Seville, Dept Automat & Syst Engn, Seville, Spain
[4] Univ Almeria, Dept Informat, CeiA3, Almeria, Spain
关键词
Competitive location; Franchise system; Nonlinear bi-objective optimization problem; Pareto-front; Evolutionary computation; EFFICIENT SET; OPTIMIZATION; FRAMEWORK; ALGORITHM; SEARCH;
D O I
10.1016/j.cor.2014.02.013
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
A bi-objective competitive facility location and design problem is considered. The problem of obtaining a complete representation of the efficient set and its corresponding Pareto-front has been previously tackled through exact general methods, but they require high computational effort. In this work, we propose a new evolutionary multi-objective optimization algorithm, named FEMOEA, which deals with the problem at hand in a fast and efficient way. It combines ideas from different multi-objective and single-objective optimization evolutionary algorithms, although it also incorporates new devices which help to reduce the computational requirements, and also to improve the quality of the provided solutions. The performance of the algorithm is analyzed by comparing it to other (meta)heuristics previously proposed in the literature. In particular, the reference algorithms MOEA/D, SPEA2 and NSGA-II have been considered. A comprehensive computational study shows that the new heuristic method outperforms, on average, the three heuristic algorithms. Additionally, it reduces, on average, the computing time of the exact methods by approximately 99%, and this offering high-quality discrete approximations of the true Pareto-front. (C) 2014 Elsevier Ltd. All rights reserved.
引用
收藏
页码:337 / 349
页数:13
相关论文
共 26 条
  • [1] [Anonymous], 2001, P 5 C EVOLUTIONARY M
  • [2] [Anonymous], 1995, C++ Toolbox for Verified Computing I, Basic Numerical Problems
  • [3] [Anonymous], 1999, EVOLUTIONARY ALGORIT
  • [4] Metaheuristics in combinatorial optimization: Overview and conceptual comparison
    Blum, C
    Roli, A
    [J]. ACM COMPUTING SURVEYS, 2003, 35 (03) : 268 - 308
  • [5] A fast and elitist multiobjective genetic algorithm: NSGA-II
    Deb, K
    Pratap, A
    Agarwal, S
    Meyarivan, T
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) : 182 - 197
  • [6] jMetal: A Java']Java framework for multi-objective optimization
    Durillo, Juan J.
    Nebro, Antonio J.
    [J]. ADVANCES IN ENGINEERING SOFTWARE, 2011, 42 (10) : 760 - 771
  • [7] COMPETITIVE LOCATION MODELS - A FRAMEWORK AND BIBLIOGRAPHY
    EISELT, HA
    LAPORTE, G
    THISSE, JF
    [J]. TRANSPORTATION SCIENCE, 1993, 27 (01) : 44 - 54
  • [8] Solving a Huff-like competitive location and design model for profit maximization in the plane
    Fernandez, Jose
    Pelegrin, Blas
    Plastria, Frank
    Toth, Boglarka
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (03) : 1274 - 1287
  • [9] Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
    Fernandez, Jose
    Toth, Boglarka
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2007, 38 (02) : 315 - 331
  • [10] Planar location and design of a new facility with inner and outer competition:: An interval lexicographical-like solution procedure
    Fernandez, Jose
    Pelegrin, Blas
    Plastria, Frank
    Toth, Boglarka
    [J]. NETWORKS & SPATIAL ECONOMICS, 2007, 7 (01) : 19 - 44