2012
DOI: 10.1504/ijams.2012.047677
|View full text |Cite
|
Sign up to set email alerts
|

A simulated annealing-based hybrid algorithm for solving UFL problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 16 publications
0
1
0
Order By: Relevance
“…Their method provided optimum solution in small problems and its solution was still better than simulated annealing algorithm for large problems [28]. Pradeepmon and Paul offered a hybrid meta-heuristic algorithm for facility location problem with limited capacity [29]. Saboury et al proposed a combination of simulated annealing algorithm with nearest-neighbor search (NNS) for a fully connected bi-level network [30].…”
Section: Hybrid Metaheuristic Literaturementioning
confidence: 99%
“…Their method provided optimum solution in small problems and its solution was still better than simulated annealing algorithm for large problems [28]. Pradeepmon and Paul offered a hybrid meta-heuristic algorithm for facility location problem with limited capacity [29]. Saboury et al proposed a combination of simulated annealing algorithm with nearest-neighbor search (NNS) for a fully connected bi-level network [30].…”
Section: Hybrid Metaheuristic Literaturementioning
confidence: 99%