Metaheuristic methods for solving the bilevel uncapacitated facility location problem with clients' preferences

DOI10.1016/J.ENDM.2012.10.007MaRDI QIDQ2840751zbMATH OpenOpenAlexFDO

Authors Miroslav Marić, Zorica Stanimirović, Nikola Milenković

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 annealingparticle swarm optimizationvariable neighborhood searchdiscrete optimizationlocation problems

Mathematics Subject Classification ID

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

Recommendations

• Metaheuristic approaches to solving large-scale Bilevel Uncapacitated Facility Location Problem with clients' preferences
• Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences
• Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm
• Comparison of metaheuristics for the bilevel facility location and mill pricing problem
• A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences

Cites work

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

Cited in

(14)

• A facility location problem for extracurricular workshop planning: bi-level model and metaheuristics
• Bilevel programming and applications
• Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm
• The branch and cut method for the facility location problem with client's preferences
• Metaheuristic approaches to solving large-scale Bilevel Uncapacitated Facility Location Problem with clients' preferences
• Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem
• Metaheuristics for bilevel optimization: a comprehensive review
• Revisiting Stackelberg p-median problem with user preferences
• A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences
• Comparison of metaheuristics for the bilevel facility location and mill pricing problem
• Estimation of distribution algorithm for a class of nonlinear bilevel programming problems
• Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences
• Competitive Facility Location with Selfish Users and Queues
• Dynamically second-preferred \(p\)-center problem

This page was built for publication: Metaheuristic methods for solving the bilevel uncapacitated facility location problem with clients' preferences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840751)