1
$\begingroup$

I'm looking into implementing a heuristic for the time-dependent traveling traveling salesman problem (TDTSP) that completes in a certain amount of time.

There are a wide range of possible ways to approach the problem, from dynamic programming to simulated annealing to genetic programming.

How do these approaches compare? Are there any metastudies on this?

$\endgroup$

Your Answer

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

Browse other questions tagged or ask your own question.