Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Traveling-salesman problem--Computer simulation."”.

  1. A more robust ant colony learning algorithm : with application to travelling salesman problem

    Graph problems model many real life applications, where the quantity of the nodes often changes with time. In such graphs, the evaluation of shortest tour is important as various guiding and navigation systems use this information. Nodes of a graph, in many applications, often change over time, and …

    unm Repository record for A more robust ant colony learning algorithm : with application to travelling salesman problem (opens in a new tab)