2015
DOI: 10.1504/ijads.2015.074612
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid spanning tree-based genetic/simulated annealing algorithm for a closed-loop logistics network design problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 9 publications
(8 citation statements)
references
References 0 publications
0
8
0
Order By: Relevance
“…For the integrated problem of forward/ reverse SCND, 14 test problem samples are used from small to large sizes based on a steel company in Iran. Some other data are generated based on papers in the literature: Wang and Hsu [14] and Yadegari et al [16,20]. In this part, the CSA's performance is compared to the performance of two of the algorithms in the literature that used the spanning tree representation method to solve the NP-hard problem.…”
Section: Computational Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…For the integrated problem of forward/ reverse SCND, 14 test problem samples are used from small to large sizes based on a steel company in Iran. Some other data are generated based on papers in the literature: Wang and Hsu [14] and Yadegari et al [16,20]. In this part, the CSA's performance is compared to the performance of two of the algorithms in the literature that used the spanning tree representation method to solve the NP-hard problem.…”
Section: Computational Resultsmentioning
confidence: 99%
“…In this part, the CSA's performance is compared to the performance of two of the algorithms in the literature that used the spanning tree representation method to solve the NP-hard problem. The first algorithm is GA developed in [14] and the second is the SA developed in [16]. The three mentioned meta-heuristics are compared for efficiency and effectiveness.…”
Section: Computational Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…The model presents an NP-hard problem that is not possible to solve through traditional methods in acceptable time, particularly in large size. In this regard, many researchers have been developed heuristics and metaheuristics to cope with this NP-hard [6,[9][10][11][12][13][14]. Although as the network presented in this study is not a case-based network, developing an efficient solution methodology to tackle this NP hard problem is still a critical need in this area [15].…”
Section: Introductionmentioning
confidence: 99%