Library

Ranking-based discrete optimization algorithm for asymmetric competitive facility location

We address a discrete competitive facility location problem for an entering firm with a binary customers choice rule and an asymmetric objective function. A heuristic optimization algorithm which is based on ranking of candidate locations and specially adopted for the discrete facility location problems is designed. The proposed algorithm is experimentally investigated by solving different instances of the facility location problem with an asymmetric objective function.

Computer ScienceEngineeringBusiness
View graphSource

Paper

Full text

PDF

Ranking-based discrete optimization algorithm for asymmetric competitive facility location

Semantic Scholar · Computer Science · 2019

Abstract

We address a discrete competitive facility location problem for an entering firm with a binary customers choice rule and an asymmetric objective function. A heuristic optimization algorithm which is based on ranking of candidate locations and specially adopted for the discrete facility location problems is designed. The proposed algorithm is experimentally investigated by solving different instances of the facility location problem with an asymmetric objective function.

Source of record · Semantic Scholar

Similar papers

A Nested Evolutionary Algorithm for Solving a Bilevel Competitive Location Problem: Optimistic vs. Pessimistic ApproachesJ. Camacho-Vallejo, Carlos Corpus2024 · IEEE Congress on Evolutionary Computation · 3 citations In Library
Quantity decisions of two-stage competitive location model based on different location modesYadong Li, Xue-mei Li2021 · Complex & Intelligent Systems · 4 citations In Library
Discrete facility location in machine learningIgor Vasilyev, Alexander Ushakov2021 · Diskretnyi analiz i issledovanie operatsii In Library
Extreme Learning Machine-based Genetic Algorithm for the facility location problem with distributed demands on network edgesMahmoud Golabi, Mokhtar Essaid, Muhammad Sulaman et al.2023 · IEEE Congress on Evolutionary Computation · 3 citations In Library
Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design PerspectivesH. Aziz, Hau Chan, Barton E. Lee et al.2019 · AAAI Conference on Artificial Intelligence · 46 citations In Library
A novel nondominated sorting simplified swarm optimization for multi-stage capacitated facility location problems with multiple quantitative and qualitative objectivesChyh-Ming Lai, Chun-Chih Chiu, Wei-Che Liu et al.2019 · Applied Soft Computing · 21 citations In Library
A Simheuristic Algorithm for the Location Routing Problem with Facility Sizing Decisions and Stochastic DemandsR. D. Tordecilla, J. Panadero, A. Juan et al.2020 · Online World Conference on Soft Computing in Industrial Applications · 3 citations In Library
A bi-objective single-server congested edge-based facility location problem under disruptionMahmoud Golabi, L. Idoumghar, J. Arkat2022 · IEEE Congress on Evolutionary Computation · 4 citations In Library
Optimizing Multiple Simultaneous Objectives for Voting and Facility LocationYe Han, Christopher Jerrett, Elliot Anshelevich2022 · AAAI Conference on Artificial Intelligence · 8 citations In Library
Two-Stage Facility Location Games with Strategic Clients and FacilitiesSimon Krogmann, Pascal Lenzner, Louise Molitor et al.2021 · International Joint Conference on Artificial Intelligence · 10 citations In Library
© 2026 NYSGPT2525 LLC