A variable neighborhood search algorithm for the (r p) hub-centroid problem under the price war

DOI10.1007/S10898-021-01036-9MaRDI QIDQ2149602zbMATHOpenAlexFDO

Authors Dimitrije D. Čvokić, Yury Kochetov, A. V. Plyasunov, Aleksandar Savić

Publication date 29 June 2022

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-021-01036-9

zbMATH Keywords

pricingvariable neighborhood searchreformulationcompetitive hub location

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Mixed integer programming (90C11) Microeconomic theory (price theory and economic markets) (91B24) Discrete location and assignment (90B80)

Recommendations

• Variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
• Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem
• A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem
• The competitive hub location under the price war
• A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem

Cites work

• A Leader-Follower Hub Location Problem Under Fixed Markups
• A competitive hub location and pricing problem
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
• A leader-follower game in competitive facility location
• A leader-follower single allocation hub location problem under fixed markups
• A quadratic integer program for the location of interacting hub facilities
• A single allocation hub location and pricing problem
• An alternating heuristic for medianoid and centroid problems in the plane
• Bilevel competitive facility location and pricing problems
• Comparison of metaheuristics for the bilevel facility location and mill pricing problem
• Fast metaheuristics for the discrete \((r|p)\)-centroid problem
• Foundations of bilevel programming
• HUB NETWORK DESIGN MODEL IN A COMPETITIVE ENVIRONMENT WITH FLOW THRESHOLD
• Handbook of metaheuristics
• Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane
• Hub location problems with price sensitive demands
• Hub location problems: the location of interacting facilities
• Hub location under competition
• Network hub location problems: The state of the art
• Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems
• On Hotelling's "Stability in Competition"
• STACKELBERG HUB LOCATION PROBLEM
• The competitive hub location under the price war
• Variable neighborhood search

Cited in

(3)

• The multilevel facility location and pricing problems: the computational complexity and the stability analysis
• Special issue: 18th international conference on mathematical optimization theory and operations research (MOTOR 2019)
• Hub location problems with price sensitive demands

Describes a project that uses

Uses Software

• Matplotlib

This page was built for publication: A variable neighborhood search algorithm for the \((r\mid p)\) hub-centroid problem under the price war

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