A bi-level model and memetic algorithm for arc interdiction location-routing problem
From MaRDI portal
Recommendations
- Hub interdiction problem variants: models and metaheuristic solution algorithms
- Efficient solution methods for a general \(r\)-interdiction median problem with fortification
- On the \(p\)-hub interdiction problem
- Location-routing robust bilevel optimization model in emergency logistics
- Capacitated location routing problem with simultaneous pickup and delivery under the risk of disruption
Cites work
- A bi-level programming model and solution algorithm for the location of logistics distribution centers
- A bi-level programming model for protection of hierarchical facilities under imminent attacks
- A bilevel fixed charge location model for facilities under imminent attack
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- A continuous bi-level model for the expansion of highway networks
- A global optimization method for solving convex quadratic bilevel programming problems
- A hybrid of genetic algorithm and particle swarm optimization for solving bi-level linear programming problem -- a case study on supply chain model
- A memetic algorithm for the capacitated location-routing problem with mixed backhauls
- A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment
- A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds
- A simple and effective evolutionary algorithm for the capacitated location-routing problem
- A survey of network interdiction models and algorithms
- A survey of recent research on location-routing problems
- A survey of variants and extensions of the location-routing problem
- A total-value greedy heuristic for the integer knapsack problem
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- An iterated local search for solving a location-routing problem
- Combined location-routing problems: A synthesis and future research directions
- Deterministic network interdiction
- Global optimization of mixed-integer bilevel programming problems
- scientific article; zbMATH DE number 4051316 (Why is no real title available?)
- scientific article; zbMATH DE number 2050720 (Why is no real title available?)
- Incorporating the threat of terrorist attacks in the design of public service facility networks
- Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model
- Location-routing: issues, models and methods
- Maximizing the minimum source-sink path subject to a budget constraint
- Multi-level programming and conflict resolution
- Multi-objective Stackelberg game model for water supply networks against interdictions with incomplete information
- Network flow interdiction on planar graphs
- Network interdiction via a critical disruption path: branch-and-price algorithms
- New approach based on group technology for the consolidation problem in cloud computing-mathematical model and genetic algorithm
- Optimal interdiction of a supply network
- Optimal interdiction policy for a flow network
- Parameter estimation of lithium ion polymer battery mathematical model using genetic algorithm
- Recent advances in memetic algorithms.
- Removing Arcs from a Network
- Shortest path network interdiction with asymmetric information
- Shortest-path network interdiction
- Solution of stochastic optimal control problems and financial applications
- Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm
- The effect of ignoring routes when locating depots
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- The Mixed Integer Linear Bilevel Programming Problem
- The multi-terminal maximum-flow network-interdiction problem
- Two-Person Zero-Sum Games for Network Interdiction
- Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands
This page was built for publication: A bi-level model and memetic algorithm for arc interdiction location-routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2244003)
