Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment
From MaRDI portal
Publication:2397582
Recommendations
- Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment
- Risk-averse hub location: formulation and solution approach
- Robust optimization approach to capacitated single and multiple allocation hub location problems
- 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
Cites work
- A Benders decomposition for hub location problems arising in public transport
- A fuzzy EOQ model with demand-dependent unit cost under limited storage capacity
- A fuzzy programming approach for dynamic virtual hub location problem
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- A new model for the hazardous waste location-routing problem
- A stochastic programming approach for supply chain network design under uncertainty
- An improved Benders decomposition algorithm for the tree of hubs location problem
- An interactive possibilistic programming approach for multiple objective supply chain master planning
- Benders decomposition for large-scale uncapacitated hub location
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Capacitated single allocation hub location problem-A bi-criteria approach
- Designing a road network for hazardous materials shipments
- Designing a supply chain network under the risk of disruptions
- Emergency facility location under random network damage: insights from the Istanbul case
- Fuzzy sets
- Generalized Benders decomposition
- Integer programming formulations of discrete hub location problems
- Location models for airline hubs behaving as M/D/c queues.
- Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
- Multi-objective optimization using evolutionary algorithms
- Multiple allocation hub-and-spoke network design under hub congestion
- Multiple attribute decision making. Methods and applications. A state-of- the-art survey
- Partitioning procedures for solving mixed-variables programming problems
- Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia
- Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm
- Stochastic air freight hub location and flight routes planning
- Stochastic uncapacitated hub location
- The stochastic p-hub center problem with service-level constraints
- The stochastic location model with risk pooling
- The uncapacitated hub location problem in networks under decentralized management
Cited in
(9)- Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment
- Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm
- Adjustable robust balanced hub location problem with uncertain transportation cost
- Risk-averse hub location: formulation and solution approach
- Developing equilibrium optimization methods for hub location problems
- Dynamic location problem under uncertainty with a regret‐based measure of robustness
- An $$\alpha $$-risk appetite cost minimizing model for multi-commodity capacitated p-hub median problem with time windows and uncertain flows
- A fuzzy programming approach for dynamic virtual hub location problem
- Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
This page was built for publication: Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397582)
