Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm
DOI10.1155/2014/430243zbMath1407.90225OpenAlexW1981800580WikidataQ59067129 ScholiaQ59067129MaRDI QIDQ1718374
Rosa G. González-Ramírez, José-Fernando Camacho-Vallejo, Álvaro Eduardo Cordero-Franco
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/430243
Hierarchical games (including Stackelberg games) (91A65) Applications of game theory (91A80) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (13)
Uses Software
Cites Work
- Bilevel model for production-distribution planning solved by using ant colony optimization
- A method for solving to optimality uncapacitated location problems
- A bilevel fixed charge location model for facilities under imminent attack
- The simple plant location problem: Survey and synthesis
- An evolutionary algorithm for solving bilevel programming problems using duality conditions
- Fuzzy facility location problem with preference of candidate sites
- An overview of bilevel optimization
- A strengthened formulation for the simple plant location problem with order
- Metaheuristic methods for solving the Bilevel Uncapacitated Facility Location Problem with Clients' Preferences
- What you should know about location modeling
- New lower bounds for the facility location problem with clients’ preferences
- Integer Programming: Methods, Uses, Computations
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Combining game theory and genetic algorithms with application to DDM-nozzle optimization problems.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm