Improving solution of discrete competitive facility location problems

DOI10.1007/S11590-015-0930-3zbMATH Open1369.90096OpenAlexW1107508256MaRDI QIDQ526408FDOQ526408

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

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

zbMATH Keywords

genetic algorithmcompetitive facility locationdiscrete optimization

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A bibliography for some fundamental problem categories in discrete location science
• Title not available (Why is that?)
• Static competitive facility location: an overview of optimisation approaches.
• Global optimization
• Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria.
• Title not available (Why is that?)

Cited In (17)

• Title not available (Why is that?)
• GASUB: finding global optima to discrete location problems by a genetic-like algorithm
• Modeling Discrete Competitive Facility Location
• A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid 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
• New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
• 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
• Title not available (Why is that?)
• Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems
• Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness
• Robust model for discrete competitive facility location problem with the uncertainty of customer behaviors
• GENETIC ALGORITHM SOLUTION FOR MULTI-PERIOD TWO-ECHELON INTEGRATED COMPETITIVE/UNCOMPETITIVE FACILITY LOCATION PROBLEM
• Exact approaches for competitive facility location with discrete attractiveness
• Population-based algorithm for discrete facility location with ranking of candidate locations

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)