Solution of Discrete Competitive Facility Location Problem for Firm Expansion

被引：5

作者：

Lancinskas, Algirdas ^{[1
]}

Fernandez, Pascual ^{[2
]}

Pelegrin, Blas ^{[2
]}

Zilinskas, Julius ^{[1
]}

机构：

[1] Vilnius Univ, Inst Math & Informat, Akad 4, LT-08663 Vilnius, Lithuania

[2] Univ Murcia, Dept Stat & Operat Res, E-30001 Murcia, Spain

来源：

INFORMATICA | 2016年 / 27卷 / 02期

关键词：

facility location; multi-objective optimization; heuristic algorithms;

D O I：

10.15388/Informatica.2016.94

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A new heuristic algorithm for solution of bi-objective discrete competitive facility location problems is developed and experimentally investigated by solving different instances of a facility location problem for firm expansion. The proposed algorithm is based on ranking of candidate locations for the new facilities, where rank values are dynamically adjusted with respect to behaviour of the algorithm. Results of the experimental investigation show that the proposed algorithm is suitable for the latter facility location problems and provides good results in sense of accuracy of the approximation of the true Pareto front.

引用

页码：451 / 462

页数：12

共 50 条

[41] Model and Solution for Capacitated Facility Location Problem
Yu, Hongtao
Gao, Liqun
Lei, Yanhua
[J]. PROCEEDINGS OF THE 2012 24TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2012, : 1773 - 1776
[42] The discrete facility location problem with balanced allocation of customers
Marin, Alfredo
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 210 (01) : 27 - 38
[43] Competitive facility location
Friesz, Terry L.
[J]. NETWORKS & SPATIAL ECONOMICS, 2007, 7 (01): : 1 - 2
[44] Competitive Facility Location
Terry L. Friesz
[J]. Networks and Spatial Economics, 2007, 7 : 1 - 2
[45] Location equilibria for a continuous competitive facility location problem under delivered pricing
Fernandez, Jose
Salhi, Said
Toth, Boglarka G.
[J]. COMPUTERS & OPERATIONS RESEARCH, 2014, 41 : 185 - 195
[46] Upper Bound for the Competitive Facility Location Problem with Quantile Criterion
Melnikov, Andrey
Beresnev, Vladimir
[J]. DISCRETE OPTIMIZATION AND OPERATIONS RESEARCH, DOOR 2016, 2016, 9869 : 373 - 387
[47] Sensitivity Analysis of a Genetic Algorithm for a Competitive Facility Location Problem
Pangilinan, Jose Maria A.
Janssens, Gerrit K.
Caris, An
[J]. INNOVATIONS AND ADVANCED TECHNIQUES IN SYSTEMS, COMPUTING SCIENCES AND SOFTWARE ENGINEERING, 2008, : 266 - +
[48] Upper Bound for the Competitive Facility Location Problem with Demand Uncertainty
V. L. Beresnev
A. A. Melnikov
[J]. Doklady Mathematics, 2023, 108 : 438 - 442
[49] A competitive facility location problem on a tree network with stochastic weights
Shiode, S
Drezner, Z
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 149 (01) : 47 - 52
[50] Branch-and-bound algorithm for a competitive facility location problem
Beresnev, Vladimir
[J]. COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (08) : 2062 - 2070

← 1 2 3 4 5 →