Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands

DOI10.1287/ijoc.2017.0755zbMath1446.90102OpenAlexW2759122744MaRDI QIDQ5131702

Elena Fernández, Maria Albareda-Sambola, Francisco Saldanha-Da-gama

Publication date: 9 November 2020

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/111476

zbMATH Keywords

GRASPBernoulli demandspath relinkingdiscrete facility location

Mathematics Subject Classification ID

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

Related Items

Stochastic hub location problems with Bernoulli demands ⋮ Optimizing a single-product production-inventory system under constant absolute risk aversion ⋮ A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands ⋮ An enhanced GRASP approach for the index tracking problem ⋮ Unnamed Item ⋮ A Lagrangian dual method for two-stage robust optimization with binary uncertainties

Uses Software

• Scatter Search
• Tabu search

Cites Work

• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
• The impact of sampling methods on bias and variance in stochastic linear programs
• A hybrid multistart heuristic for the uncapacitated facility location problem
• A reactive GRASP for a commercial territory design problem with multiple balancing requirements
• Facility location and supply chain management. A review
• Greedy randomized adaptive search procedures
• Heuristics for multi-stage interdiction of stochastic networks
• A memetic algorithm for the multi trip vehicle routing problem
• Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
• Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item