Comparison of metaheuristics for the bilevel facility location and mill pricing problem

DOI10.1134/S1990478915030102MaRDI QIDQ3186830zbMATH OpenOpenAlexFDO

Authors A. A. Panin, Yury Kochetov, A. V. Plyasunov

Publication date 12 August 2016

Published in Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1990478915030102

zbMATH Keywords

bilevel optimizationfacility locationpricinggenetic local search methodbilevel metaheuristicslocal improvement with variable neighborhoods

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Discrete location and assignment (90B80)

Recommendations

• Bilevel competitive facility location and pricing problems
• A double VNS heuristic for the facility location and pricing problem
• On complexity of the bilevel location and pricing problems
• Metaheuristic methods for solving the bilevel uncapacitated facility location problem with clients' preferences
• scientific article; zbMATH DE number 1264408

Cites work

• scientific article; zbMATH DE number 1803758 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 1047152 (Why is no real title available?)
• scientific article; zbMATH DE number 1985662 (Why is no real title available?)
• A competitive hub location and pricing problem
• A double VNS heuristic for the facility location and pricing problem
• Competitive Location Models: A Framework and Bibliography
• Competitive facility location model with concave demand
• Competitive location on networks under delivered pricing
• Fast metaheuristics for the discrete \((r|p)\)-centroid problem
• Foundations of bilevel programming
• Foundations of location analysis
• Genetic local search for the graph partitioning problem under cardinality constraints
• Large neighborhood local search for the \(p\)-median problem
• On complexity of the bilevel location and pricing problems
• Optimal bundle pricing with monotonicity constraint
• Optimization problems and the polynomial hierarchy
• Optimizing pricing and location decisions for competitive service facilities charging uniform price
• Pricing bridges to cross a river
• The pricing problem. I: Exact and approximate algorithms
• Uncapacitated Plant Location Under Alternative Spatial Price Policies
• Variable neighborhood search: Principles and applications

Cited in

(9)

• scientific article; zbMATH DE number 7656022 (Why is no real title available?)
• Metaheuristic methods for solving the bilevel uncapacitated facility location problem with clients' preferences
• A variable neighborhood search algorithm for the \((r\mid p)\) hub-centroid problem under the price war
• The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches
• The multilevel facility location and pricing problems: the computational complexity and the stability analysis
• Genetic local search and hardness of approximation for the server load balancing problem
• A double VNS heuristic for the facility location and pricing problem
• Bilevel optimization: theory, algorithms, applications and a bibliography
• A bilevel competitive location and pricing model with nonuniform split of demand

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Comparison of metaheuristics for the bilevel facility location and mill pricing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186830)