![]() ![]() By implementing it the researchers were able to produce high-quality solutions in very short computational time detecting some new world's best solutions too. developed a simulated annealing algorithm for the VRPTW with synchronization constraints incorporating several local search techniques to deal with this problem. Woch and Łebkowski presented in 2009 a standard sequential simulated annealing algorithm applied to the VRPTW, which gave two new world's best solutions to Solomon benchmark set. ![]() Although proposed more than 40 years ago, it still attracts some attention and is broadly used in many existing solutions for different variants of the vehicle routing problems. The SA is a stochastic algorithm involving asymptotic convergence and allowing random movements in the searched neighborhood in order to escape local minima. Simulated Annealing procedure (blue (mid gray in print version) dot – initial solution, orange (light gray in print version) dot – local minimum, green (mid gray in print version) dot – global minimum, red (dark gray in print version) arrow – hill climbing (move accepted with certain probability)). ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |