A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds
From MaRDI portal
Publication:2027659
DOI10.1007/s40314-020-01349-7zbMath1461.90005MaRDI QIDQ2027659
Alireza Amini, Sadoullah Ebrahimnejad, Reza Tavakkoli-Moghaddam
Publication date: 28 May 2021
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-020-01349-7
90C11: Mixed integer programming
90C59: Approximation methods and heuristics in mathematical programming
90B80: Discrete location and assignment
90-08: Computational methods for problems pertaining to operations research and mathematical programming
90C17: Robustness in mathematical programming
Related Items
Solving a hub location-routing problem with a queue system under social responsibility by a fuzzy meta-heuristic algorithm, A bi-level model and memetic algorithm for arc interdiction location-routing problem, Arc routing under uncertainty: introduction and literature review
Cites Work
- Unnamed Item
- Robust optimization approach to capacitated single and multiple allocation hub location problems
- A survey of recent research on location-routing problems
- Location-arc routing problem: heuristic approaches and test instances
- Location arc routing problem with inventory constraints
- Location-routing: issues, models and methods
- Combinatorial optimization: current successes and directions for the future
- Territorial design optimization for business sales plan
- A survey of the standard location-routing problem
- The late acceptance hill-climbing heuristic
- A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach
- Lower and upper bounds for location-arc routing problems with vehicle capacity constraints
- Robust optimization for relief logistics planning under uncertainties in demand and transportation time
- The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty
- Solving the bi-objective Robust Vehicle Routing Problem with uncertain costs and demands
- The Price of Robustness
- Tabu Search—Part I
- Robust Optimization of Large-Scale Systems
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands