Designing a model for service facility protection with a time horizon based on tri-level programming
From MaRDI portal
Publication:5059288
DOI10.1080/0305215X.2019.1577408WikidataQ128316588 ScholiaQ128316588MaRDI QIDQ5059288
Ata Allah Taleizadeh, Reza Bashirzadeh, Seyed Parsa Parvasi, Reza Tavakkoli-Moghaddam, Armand Baboli
Publication date: 23 December 2022
Published in: Engineering Optimization (Search for Journal in Brave)
maximal covering; metaheuristic algorithms; time horizon; tri-level programming; interdiction models
90-XX: Operations research, mathematical programming
Cites Work
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm
- A bi-level programming model for protection of hierarchical facilities under imminent attacks
- Dynamic conditional value-at-risk model for routing and scheduling of hazardous material transportation networks
- The budget constrained \(r\)-interdiction median problem with capacity expansion
- Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
- Capacitated location allocation problem with stochastic location and fuzzy demand: a hybrid algorithm
- Managing sudden transportation disruptions in supply chains under delivery delay and quantity loss
- A bilevel fixed charge location model for facilities under imminent attack
- Linear bilevel programming solution by genetic algorithm
- A robust parameter design for multi-response problems
- A bilevel mixed-integer program for critical infrastructure protection planning
- An exact solution approach for the interdiction median problem with fortification
- Solving bi-level optimization problems in engineering design using kriging models
- Simulated annealing heuristic for the general share-a-ride problem
- Network reliability maximization for stochastic-flow network subject to correlated failures using genetic algorithm and tabu search
- Solving a stochastic berth allocation problem using a hybrid sequence pair-based simulated annealing algorithm
- Removing Arcs from a Network