I have been searching through internet how could simulated annealing to solve the vehicle routing problem, but didn't find anything that made it clear to me. Most of what I found are research papers intended to solve some specific variation of the routing problem.

So I would appreciate if someone can make some kind of explanation of possible ways two things can be related and give some links that to so.


Simulated annealing is an optimization paradigm, in which (very roughly speaking) you start with some solution, and then try to make local changes that improve it, sometimes making a local change even if it doesn't improve.

Vehicle routing is an optimization problem. It is likely that the simulated annealing paradigm can be applied to it, probably in many different ways (corresponding to different notions of local change).

  • $\begingroup$ Simulated annealing is mostly interesting because it's a strategy for changing how randomized choices change over time. $\endgroup$ – Raphael Apr 11 '16 at 22:12
  • $\begingroup$ Right, that's why I wrote very roughly. $\endgroup$ – Yuval Filmus Apr 11 '16 at 22:13
  • $\begingroup$ @Yuval I think there's no short answer to OPs question. But how does your answer help OP at all? $\endgroup$ – Auberon Apr 13 '16 at 11:23
  • $\begingroup$ @Auberon If you're not happy with my answer, add a better one yourself. You can also downvote my answer, if you haven't already done so. $\endgroup$ – Yuval Filmus Apr 13 '16 at 12:38

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.