2016
DOI: 10.14257/ijhit.2016.9.1.29
|View full text |Cite
|
Sign up to set email alerts
|

Incremental Optimization of Hub and Spoke Network under Changes of Spokes' Number and Flow

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…Since the UMApHMP belongs to the class of NP-hard problems, it is difficult for exact optimization methods to solve large benchmarks (for instance, the hub and spook network of the China Deppon logistics includes 50 hubs and 5400 nodes and these numbers increase as time goes by Wang and Huang (2016). Therefore, heuristic and parallel computing methods are promising approaches for solving real problems with large sizes (Benaini et al, 2022).…”
Section: Introductionmentioning
confidence: 99%
“…Since the UMApHMP belongs to the class of NP-hard problems, it is difficult for exact optimization methods to solve large benchmarks (for instance, the hub and spook network of the China Deppon logistics includes 50 hubs and 5400 nodes and these numbers increase as time goes by Wang and Huang (2016). Therefore, heuristic and parallel computing methods are promising approaches for solving real problems with large sizes (Benaini et al, 2022).…”
Section: Introductionmentioning
confidence: 99%