Metaheuristic approaches to solving large-scale Bilevel Uncapacitated Facility Location Problem with clients' preferences

DOI10.2298/YJOR130702032MzbMath1451.90090OpenAlexW2061059744MaRDI QIDQ5278852

Miroslav Marić, Aleksandar Đenić, Zorica Stanimirović, Nikola Milenković

Publication date: 19 July 2017

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/yjor130702032m

zbMATH Keywords

simulated annealinglocation problemsvariable neighborhood searchdiscrete optimizationparticle swarm optimization

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (3)

Metaheuristics for bilevel optimization: a comprehensive review ⋮ Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences ⋮ Dynamically second-preferred \(p\)-center problem

This page was built for publication: Metaheuristic approaches to solving large-scale Bilevel Uncapacitated Facility Location Problem with clients' preferences