Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment
DOI10.3934/JIMO.2016082zbMATH Open1361.90039OpenAlexW4246621455MaRDI QIDQ2397582FDOQ2397582
Majid Aminnayeri, Mahdi Bashiri, Saeid Abbasi-Parizi
Publication date: 22 May 2017
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2016082
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Minimax problems in mathematical programming (90C47) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70) Discrete location and assignment (90B80)
Cites Work
- Fuzzy sets
- Partitioning procedures for solving mixed-variables programming problems
- A stochastic programming approach for supply chain network design under uncertainty
- Multiple attribute decision making. Methods and applications. A state-of- the-art survey
- Integer programming formulations of discrete hub location problems
- An improved Benders decomposition algorithm for the tree of hubs location problem
- Generalized Benders decomposition
- Multi-objective optimization using evolutionary algorithms
- Benders decomposition for large-scale uncapacitated hub location
- Stochastic uncapacitated hub location
- Multiple allocation hub-and-spoke network design under hub congestion
- Designing a road network for hazardous materials shipments
- The stochastic location model with risk pooling
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Location models for airline hubs behaving as \(M/D/c\) queues.
- Designing a supply chain network under the risk of disruptions
- Capacitated single allocation hub location problem-A bi-criteria approach
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- Stochastic air freight hub location and flight routes planning
- The stochastic \(p\)-hub center problem with service-level constraints
- The uncapacitated hub location problem in networks under decentralized management
- 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
- An interactive possibilistic programming approach for multiple objective supply chain master planning
- Emergency facility location under random network damage: insights from the Istanbul case
- A Benders Decomposition for Hub Location Problems Arising in Public Transport
- A fuzzy programming approach for dynamic virtual hub location problem
- Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
- A fuzzy EOQ model with demand-dependent unit cost under limited storage capacity
- Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm
Cited In (2)
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)
