Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences
From MaRDI portal
Publication:2422923
DOI10.1016/j.amc.2017.03.051zbMath1426.90174OpenAlexW2605840890MaRDI QIDQ2422923
Martha-Selene Casas-Ramírez, José-Fernando Camacho-Vallejo, Iris Martínez-Salazar
Publication date: 21 June 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2017.03.051
Related Items
A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences, New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm, 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, On location-allocation problems for dimensional facilities, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Sequential competitive location on networks
- A review of hierarchical facility location models
- Hybridizing the cross-entropy method: An application to the max-cut problem
- A meta-heuristic approach for solving the urban network design problem
- A survey of algorithms for the generalized assignment problem
- Sequential location problems
- Practical bilevel optimization. Algorithms and applications
- Bilevel and multilevel programming: A bibliography review
- Bilevel programming and applications
- Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm
- A leader-follower game in competitive facility location
- Greedy randomized adaptive search procedures
- The cross-entropy method for combinatorial and continuous optimization
- Local search algorithms for the problem of competitive location of enterprises
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- An overview of bilevel optimization
- A tutorial on the cross-entropy method
- A strengthened formulation for the simple plant location problem with order
- A study on the use of heuristics to solve a bilevel programming problem
- Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
- New lower bounds for the facility location problem with clients’ preferences
- Network design problem with congestion effects: A case of bilevel programming
- Metaheuristic approaches to solving large-scale Bilevel Uncapacitated Facility Location Problem with clients' preferences
- Competitive Location Models: A Framework and Bibliography
- Static competitive facility location: an overview of optimisation approaches.
- On the use of genetic algorithms to solve location problems
