1 / 6

Traveling Salesperson Problem: A Java MPJ-Express Approach

Explore the shortest closed circuit visiting all locations using an NP-Hard Genetic Algorithm in Java, presented by Jakob Haug Oftebro, Ulrik Sagen, and Eirik Aasved Holst. Learn the sequential and parallel GA pseudocode for efficient population evolution.

senta
Télécharger la présentation

Traveling Salesperson Problem: A Java MPJ-Express Approach

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Travelling Salesperson ProblemA Java mpj-expressapproach By Jakob Haug Oftebro, Ulrik Sagen and Eirik Aasved Holst

  2. The problem • What is theshortestclosedcircuitthatvisits all locations? • O(n!) • NP-Hard

  3. Genetic algorithm PSEUDOCODE FOR SEQUENTIAL GA: Generate initial population while(not finished){ evaluatefitness evolvepopulation }

  4. IN PARALLEL PSEUDOCODE FOR PARALLEL GA: while(outerloop){ //onrootprocessor mixPopulation() for(innerloop){ //oneachprocessor evaluatefitness evolvesubPopulation } }

  5. PARALLELISM • Population = n • subPopulation = n/#processors

  6. Graphicalevolutionrepresentation

More Related