2018
DOI: 10.1007/s12351-018-0438-6
|View full text |Cite
|
Sign up to set email alerts
|

The capacitated modular single-allocation hub location problem with possibilities of hubs disruptions: modeling and a solution algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(1 citation statement)
references
References 63 publications
0
1
0
Order By: Relevance
“…Nakhjirkan et al [7] developed a supply chain decision-making model under the demand for uncertainty using genetic algorithm and network data envelopment analysis. Husseinzadeh Kashan et al [8,9] modeled and solved single-capacity hub locating algorithm with hub distribution capability and considered a small number of capacity transportation devices as a parameter and solved it as a two-step random problem with meta-algorithms. Wu et al [1] introduced several non-random hub locating problems in a multipurpose transportation and distribution system and formulated it with uncertain transportation cost and demand and solved it using Benders algorithm using Turkish shipping network data and AP data.In his research,Erdogan et al [10] addressed the issue of hubing and location hubs in a NP-Hard and MIP problem by linking the hub locating problem on a network and defining the cost of transportation between hubs and considering two levels of decision makers, one for transport suppliers and the other for customers.…”
Section: Introductionmentioning
confidence: 99%
“…Nakhjirkan et al [7] developed a supply chain decision-making model under the demand for uncertainty using genetic algorithm and network data envelopment analysis. Husseinzadeh Kashan et al [8,9] modeled and solved single-capacity hub locating algorithm with hub distribution capability and considered a small number of capacity transportation devices as a parameter and solved it as a two-step random problem with meta-algorithms. Wu et al [1] introduced several non-random hub locating problems in a multipurpose transportation and distribution system and formulated it with uncertain transportation cost and demand and solved it using Benders algorithm using Turkish shipping network data and AP data.In his research,Erdogan et al [10] addressed the issue of hubing and location hubs in a NP-Hard and MIP problem by linking the hub locating problem on a network and defining the cost of transportation between hubs and considering two levels of decision makers, one for transport suppliers and the other for customers.…”
Section: Introductionmentioning
confidence: 99%