Improving solution of discrete competitive facility location problems

DOI10.1007/S11590-015-0930-3MaRDI QIDQ526408zbMATH OpenOpenAlexFDO

Authors Algirdas Lančinskas, P. Fernández, Blas Pelegín, Julius Žilinskas

Publication date 12 May 2017

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-015-0930-3

zbMATH Keywords

genetic algorithmcompetitive facility locationdiscrete optimization

Mathematics Subject Classification ID

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

Recommendations

• New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
• Discrete competitive facility location: modeling and optimization approaches
• A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem
• scientific article; zbMATH DE number 6006831
• Randomized local search for the discrete competitive facility location problem

Cites work

• scientific article; zbMATH DE number 1803760 (Why is no real title available?)
• scientific article; zbMATH DE number 9247 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• A bibliography for some fundamental problem categories in discrete location science
• Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria.
• Global optimization
• Static competitive facility location: an overview of optimisation approaches.

Cited in

(17)

• New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
• GASUB: finding global optima to discrete location problems by a genetic-like algorithm
• A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem
• Population-based algorithm for discrete facility location with ranking of candidate locations
• A discrete competitive facility location model with proportional and binary rules sequentially applied
• Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem
• Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule
• The discrete facility location problem with balanced allocation of customers
• Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule
• Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness
• GENETIC ALGORITHM SOLUTION FOR MULTI-PERIOD TWO-ECHELON INTEGRATED COMPETITIVE/UNCOMPETITIVE FACILITY LOCATION PROBLEM
• Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems
• Exact approaches for competitive facility location with discrete attractiveness
• Modeling Discrete Competitive Facility Location
• Robust model for discrete competitive facility location problem with the uncertainty of customer behaviors
• scientific article; zbMATH DE number 1159167 (Why is no real title available?)
• scientific article; zbMATH DE number 6006831 (Why is no real title available?)

This page was built for publication: Improving solution of discrete competitive facility location problems

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