New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior

DOI10.1016/j.cor.2016.10.002zbMath1391.90373OpenAlexW2528902899MaRDI QIDQ1652139

Julius Žilinskas, Algirdas Lančinskas, Pascual Fernández, Blas Pelegrín

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.10.002

zbMATH Keywords

heuristic algorithmcompetitive locationbinary and partially binary rules

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (11)

Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems ⋮ 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 ⋮ Sequential customers' decisions in facility location with comparison-shopping ⋮ Multipurpose shopping trips and location ⋮ Location-based pricing and channel selection in a supply chain: a case study from the food retail industry ⋮ A continuum perspective of customer choice rules for competitive facility location problems ⋮ Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule ⋮ Robust model for discrete competitive facility location problem with the uncertainty of customer behaviors ⋮ Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule ⋮ Store location with multipurpose shopping trips and a new random utility customers' choice model

Uses Software

• XPRESS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Models and algorithms for competitive facility location problems with different customer behavior
• An exact procedure and LP formulations for the leader-follower location problem
• Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria.
• The leader-follower location model
• Discretization results for the Huff and Pareto-Huff competitive location models on networks
• A bibliography for some fundamental problem categories in discrete location science
• Finding the optimal solution to the Huff based competitive location model
• ON PLANAR MEDIANOID COMPETITIVE LOCATION PROBLEMS WITH MANHATTAN DISTANCE
• Static competitive facility location: an overview of optimisation approaches.

This page was built for publication: New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior