2020
DOI: 10.1007/978-3-030-58930-1_11
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Simulated Annealing with Adaptive Neighborhood Using Hidden Markov Model

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 34 publications
0
1
0
Order By: Relevance
“…To reduce the high time complexity of capacitated vehicle routing issues, an enhanced simulated annealing algorithm combined with crossover operator (ISA-CO) was suggested in [ 126 ] to improve convergence. Using hidden Markov model (HHM), dynamic simulated annealing was introduced in [ 127 ], with the integration of HHM adapts neighborhood structure at every iteration in SA, thus proving the capability optimum nature of fellow function depending on the history of search. On the whole, in every observation of an algorithm, it is noted that many cases experience precipitate convergence in simulation results.…”
Section: Literature Reviewmentioning
confidence: 99%
“…To reduce the high time complexity of capacitated vehicle routing issues, an enhanced simulated annealing algorithm combined with crossover operator (ISA-CO) was suggested in [ 126 ] to improve convergence. Using hidden Markov model (HHM), dynamic simulated annealing was introduced in [ 127 ], with the integration of HHM adapts neighborhood structure at every iteration in SA, thus proving the capability optimum nature of fellow function depending on the history of search. On the whole, in every observation of an algorithm, it is noted that many cases experience precipitate convergence in simulation results.…”
Section: Literature Reviewmentioning
confidence: 99%