Jump to content

File:Travelling salesman problem solved with simulated annealing.gif

Page contents not supported in other languages.
This is a file from the Wikimedia Commons
From Wikipedia, the free encyclopedia

Travelling_salesman_problem_solved_with_simulated_annealing.gif (512 × 512 pixels, file size: 2.26 MB, MIME type: image/gif, looped, 125 frames, 13 s)

Summary

Description
English: Simulated Annealing is applied to the travelling Salesman problem. There are 125 knots in 5 blocks. The number of possible combinations is about 1.5e+207.
Deutsch: Simulated Annealing angewendet auf das Problem des Handlungsreisenden. Es gibt in diesem Beispiel 125 Knoten, die auf 5 Blöcke verteilt sind. Die Anzahl möglicher Kombinationen beträgt etwa 1.5e+207.
Date
Source Own work
Author Geodac

Licensing

I, the copyright holder of this work, hereby publish it under the following license:
Creative Commons CC-Zero This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication.
The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

3 April 2018

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current17:58, 3 April 2018Thumbnail for version as of 17:58, 3 April 2018512 × 512 (2.26 MB)GeodacUser created page with UploadWizard

The following page uses this file:

Global file usage

The following other wikis use this file: