Metaheuristic methods for solving the Bilevel Uncapacitated Facility Location Problem with Clients' Preferences

DOI10.1016/j.endm.2012.10.007zbMath1268.90153OpenAlexW1997982540MaRDI QIDQ2840751

Zorica Stanimirović, Nikola Milenković, Miroslav Marić

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.007

zbMATH Keywords

simulated annealinglocation problemsvariable neighborhood searchdiscrete optimizationparticle swarm optimization

Mathematics Subject Classification ID

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

Related Items (8)

Bilevel programming and applications ⋮ Metaheuristics for bilevel optimization: a comprehensive review ⋮ Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem ⋮ Revisiting Stackelberg p-median problem with user preferences ⋮ Dynamically second-preferred \(p\)-center problem ⋮ Competitive Facility Location with Selfish Users and Queues ⋮ Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm ⋮ Estimation of distribution algorithm for a class of nonlinear bilevel programming problems

Cites Work

• Optimization by Simulated Annealing
• A strengthened formulation for the simple plant location problem with order
• New lower bounds for the facility location problem with clients’ preferences
• Variable neighborhood search: Principles and applications

This page was built for publication: Metaheuristic methods for solving the Bilevel Uncapacitated Facility Location Problem with Clients' Preferences