A new approach to cooperative competition in facility location problems: Mathematical formulations and an approximation algorithm

•This paper deals with cooperative competition in facility location problems.•A new game-theoretical multi-objective model is proposed that has efficient performance to achieve Nash equilibrium points.•Due to high computational complexity of the problem, a new approximation heuristic algorithm is pr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & operations research Jg. 83; S. 45 - 53
Hauptverfasser: Rohaninejad, Mohammad, Navidi, Hamidreza, Nouri, Behdin Vahedi, Kamranrad, Reza
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Elsevier Ltd 01.07.2017
Pergamon Press Inc
Schlagworte:
ISSN:0305-0548, 1873-765X, 0305-0548
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•This paper deals with cooperative competition in facility location problems.•A new game-theoretical multi-objective model is proposed that has efficient performance to achieve Nash equilibrium points.•Due to high computational complexity of the problem, a new approximation heuristic algorithm is proposed to solve large-sized problems.•The computational results show that the proposed algorithm has satisfactory performance in two criteria including computational time and the quality of final results. This paper deals with cooperative competition in facility location problems in which potential players (investors) are in competition (or conflict) over acquiring suitable sites and clients. In order to formulate the problem, a game-theoretical multi-objective model with the objective of maximizing investor utility is presented. In the proposed method, an acceptance threshold constraint is applied to facility allocation that is based on a combination of distance between a facility and clients, and investors’ product prices. Since the common solution methods for multi-objective optimization, such as weighted sums, ε-constraints, multi-objective meta-heuristic algorithms, etc. are not efficient enough, and cannot guarantee achieving Nash equilibrium points, a new approach is developed to solve the presented problem. Moreover, according to the computational complexity of the problem, an approximation algorithm is introduced for large-sized problems. Finally, the computational results demonstrate that the proposed algorithm performs efficiently in obtaining Nash equilibrium points.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2017.02.003