Dr. James McCaffrey of Microsoft Research uses full code samples to detail an evolutionary algorithm technique that apparently hasn't been published before. The goal of a combinatorial optimization ...

This is a preview. Log in through your library . Abstract The traveling-salesman problem is a generalized form of the simple problem to find the smallest closed loop that connects a number of points ...

The Journal of the Operational Research Society, Vol. 29, No. 7 (Jul., 1978), pp. 697-701 (5 pages) The paper describes a heuristic algorithm for the asymmetric travelling salesman problem. The ...

The goal of a combinatorial optimization problem is to find a set of distinct integer values that minimizes some cost function. The most famous example is the Traveling Salesman Problem (TSP). There ...