markus_swartz wrote:
> Hi,
>
> I´m trying to write some code in order to find a good approximation to
> the solution of a Capacitated Vehicle Routing Problem (similar to the
> Multiple Traveling Salesman Problem). I am aware that´s an NP-hard
> problem.
>
> Does anybody have an idea of what relax
dear friend,i believe that a branch and bound technique would not be
ideal(even simple to implement),I believe that you can you use an A*
algorith,and try to think a good (and robust) heuristic
function,albeit the inherent combinatorial explotion can be attacked
quite efficiently(it is highly depe
