This report describes an implementation of the Lin-Kernighan heuristic, one of the most successful methods for generating optimal or nearoptimal solutions for the symmetric travel...
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
The discrete particle swarm optimization (DPSO) is a kind of particle swarm optimization (PSO) algorithm to find optimal solutions for discrete problems. This paper proposes an i...
Ant Colony Optimization (ACO) has been applied successfully in solving the Traveling Salesman Problem. Marco Dorigo et al. used Ant System (AS) to explore the Symmetric Traveling S...