15 research outputs found
A parallel 2-opt algorithm for the traveling salesman problem
No full textWe present a scalable parallel local search algorithm based on data parallelism. The concept of distributed neighborhood structures is introduced, and applied to the Traveling Salesman Problem (TSP). Our parallel local search algorithm finds the same quality solutions as the classical 2-opt algorithm and has a good speed-up. The algorithm is implemented on a Parsytec GCel, consisting of 512 transputers. Its performance is empirically analyzed for TSP instances with several thousands of cities.
Author Keywords: Local search; Traveling Salesman Problem; Data parallelis
Formulation and Tabu Search Algorithm for the Resource Constrained Project Scheduling Problem
No full text
Interactive effects of mycorrhizae and a root hemiparasite on plant community productivity and diversity
No full textGeography and habitat predominate over climate influences on arbuscular mycorrhizal fungal communities of mid-European meadows
No full textLitter fingerprint on microbial biomass, activity, and community structure in the underlying soil
No full textA novel impact of a novel weapon: allelochemicals in Alliaria petiolata disrupt the legume-rhizobia mutualism
No full text
