Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment
From MaRDI portal
Publication:1717038
DOI10.3934/jimo.2018083zbMath1412.90076OpenAlexW2556976888MaRDI QIDQ1717038
Saeid Abbasi-Parizi, Mahdi Bashiri, Majid Amin-Nayeri
Publication date: 5 February 2019
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2018083
Nonparametric robustness (62G35) Discrete location and assignment (90B80) Exact solutions to problems in general relativity and gravitational theory (83C15)
Related Items (1)
Cites Work
- Unnamed Item
- Emergency facility location under random network damage: insights from the Istanbul case
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- Stochastic uncapacitated hub location
- The uncapacitated hub location problem in networks under decentralized management
- A fuzzy programming approach for dynamic virtual hub location problem
- Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
- Stochastic air freight hub location and flight routes planning
- Multiple allocation hub-and-spoke network design under hub congestion
- The stochastic \(p\)-hub center problem with service-level constraints
- An interactive possibilistic programming approach for multiple objective supply chain master planning
- Designing a road network for hazardous materials shipments
- A new model for the hazardous waste location-routing problem
- Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia
- The stochastic location model with risk pooling
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Partitioning procedures for solving mixed-variables programming problems
- Multiple attribute decision making. Methods and applications. A state-of- the-art survey
- A fuzzy EOQ model with demand-dependent unit cost under limited storage capacity
- Integer programming formulations of discrete hub location problems
- Location models for airline hubs behaving as \(M/D/c\) queues.
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem
- Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm
- Designing a supply chain network under the risk of disruptions
- An improved Benders decomposition algorithm for the tree of hubs location problem
- Capacitated single allocation hub location problem-A bi-criteria approach
- A stochastic programming approach for supply chain network design under uncertainty
- Generalized Benders decomposition
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- A Benders Decomposition for Hub Location Problems Arising in Public Transport
- Fuzzy sets
This page was built for publication: Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment
