Artikel
A firefly algorithm for solving competitive location-design problem: A case study
This paper aims at determining the optimal number of new facilities besides specifying both the optimal location and design level of them under the budget constraint in a competitive environment by a novel hybrid continuous and discrete firefly algorithm. A real-world application of locating new chain stores in the city of Tehran, Iran, is used and the results are analyzed. In addition, several examples have been solved to evaluate the efficiency of the proposed model and algorithm. The results demonstrate that the performed method provides good-quality results for the test problems.
- Sprache
-
Englisch
- Erschienen in
-
Journal: Journal of Industrial Engineering International ; ISSN: 2251-712X ; Volume: 12 ; Year: 2016 ; Pages: 517-527 ; Heidelberg: Springer
- Klassifikation
-
Management
- Thema
-
Competitive facility location
Location design
Market share
Budget constraint
Firefly algorithm
- Ereignis
-
Geistige Schöpfung
- (wer)
-
Sadjadi, Seyed Jafar
Ashtiani, Milad Gorji
Ramezanian, Reza
Makui, Ahmad
- Ereignis
-
Veröffentlichung
- (wer)
-
Springer
- (wo)
-
Heidelberg
- (wann)
-
2016
- DOI
-
doi:10.1007/s40092-016-0160-z
- Handle
- Letzte Aktualisierung
-
10.03.2025, 11:43 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Artikel
Beteiligte
- Sadjadi, Seyed Jafar
- Ashtiani, Milad Gorji
- Ramezanian, Reza
- Makui, Ahmad
- Springer
Entstanden
- 2016
Ähnliche Objekte (12)
Solving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method
Competitive and voting location
Competitive Location in the Plane
Sequential Competitive Location on Networks
Sequential competitive location on networks
Average case and smoothed competitive analysis of the multi-level feedback algorithm
Competitive problem solving and the optimal prize schemes
A competitive exact algorithm for assembly line balancing
Makanin's algorithm for solving word equations with regular constraints
An exact algorithm for solving difficult detailed routing problems
Genetic algorithm based technique for solving chance constrained problems
A new algorithm for solving dynamic stochastic macroeconomic models
Solving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method
Competitive and voting location
Competitive Location in the Plane
Sequential Competitive Location on Networks
Sequential competitive location on networks
Average case and smoothed competitive analysis of the multi-level feedback algorithm
Competitive problem solving and the optimal prize schemes
A competitive exact algorithm for assembly line balancing
Makanin's algorithm for solving word equations with regular constraints
An exact algorithm for solving difficult detailed routing problems
Genetic algorithm based technique for solving chance constrained problems
A new algorithm for solving dynamic stochastic macroeconomic models
Solving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method
Competitive and voting location
Competitive Location in the Plane
Sequential Competitive Location on Networks
Sequential competitive location on networks
Average case and smoothed competitive analysis of the multi-level feedback algorithm
Competitive problem solving and the optimal prize schemes
A competitive exact algorithm for assembly line balancing
Makanin's algorithm for solving word equations with regular constraints
An exact algorithm for solving difficult detailed routing problems
Genetic algorithm based technique for solving chance constrained problems