Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems

DOI10.1080/10556788.2014.973875zbMath1336.90060OpenAlexW2058341316MaRDI QIDQ3458816

No author found.

Publication date: 28 December 2015

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2014.973875

zbMATH Keywords

Taguchi methodbi-level programmingcompetitive facility location problemquantum binary particle swarm optimization

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Boolean programming (90C09)

Related Items

Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem, Putting continuous metaheuristics to work in binary search spaces, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Uses Software

• CPLEX

Cites Work

• Branch-and-bound algorithm for a competitive facility location problem
• A robust model for a leader-follower competitive facility location problem in a discrete space
• Sequential competitive location on networks
• Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution
• Competitive spatial models
• On locating new facilities in a competitive environment
• A leader-follower game in competitive facility location
• A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
• Lagrangean relaxation-based algorithm for bi-level problems
• The polynomial hierarchy and a simple model for competitive analysis
• New Branch-and-Bound Rules for Linear Bilevel Programming
• Competitive Location Models: A Framework and Bibliography