Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment
type: Item
instance of: scholarly article
title: Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment
zbMATH Open document ID: 1412.90076
author: Saeid Abbasi-Parizi
author: Mahdi Bashiri
author: Majid Aminnayeri
published in: Journal of Industrial and Management Optimization
publication date: 2019-02-05T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 62G35
Mathematics Subject Classification ID: 83C15
zbMATH DE Number: 7012530
zbMATH Keywords: hub location
zbMATH Keywords: robust optimization
zbMATH Keywords: minimax regret
zbMATH Keywords: benders decomposition algorithm
MaRDI profile type: Publication
full work available at URL: jimo.2018083
OpenAlex ID: W2556976888
cites work: A new model for the hazardous waste location-routing problem
cites work: Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia
cites work: A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
cites work: Multiple allocation hub-and-spoke network design under hub congestion
cites work: Benders decomposition for the uncapacitated multiple allocation hub location problem
cites work: Integer programming formulations of discrete hub location problems
cites work: Benders decomposition for large-scale uncapacitated hub location
cites work: Stochastic uncapacitated hub location
cites work: Multi-objective optimization using evolutionary algorithms
cites work: Designing a road network for hazardous materials shipments
cites work: A Benders Decomposition for Hub Location Problems Arising in Public Transport
cites work: Generalized Benders decomposition
cites work: Capacitated single allocation hub location problem-A bi-criteria approach
cites work: Multiple attribute decision making. Methods and applications. A state-of- the-art survey
cites work: Designing a supply chain network under the risk of disruptions
cites work: Location models for airline hubs behaving as \(M/D/c\) queues.
cites work: Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm
cites work: A fuzzy EOQ model with demand-dependent unit cost under limited storage capacity
cites work: Benders decomposition applied to a robust multiple allocation incomplete hub location problem
cites work: An improved Benders decomposition algorithm for the tree of hubs location problem
cites work: Emergency facility location under random network damage: insights from the Istanbul case
cites work: A stochastic programming approach for supply chain network design under uncertainty
cites work: The stochastic \(p\)-hub center problem with service-level constraints
cites work: The stochastic location model with risk pooling
cites work: A fuzzy programming approach for dynamic virtual hub location problem
cites work: An interactive possibilistic programming approach for multiple objective supply chain master planning
cites work: The uncapacitated hub location problem in networks under decentralized management
cites work: Stochastic air freight hub location and flight routes planning
cites work: Fuzzy sets
Wikidata QID: Q129627236
DOI: 10.3934/JIMO.2018083
description: scientific article; zbMATH DE number 7012530