Press escape to exit fullscreen

{{sketch.instructions}}

CC {{sketch.licenseObject.short}}

Archived Sketch

This sketch is created with an older version of Processing,
and doesn't work on browsers anymore.

View Source Code

Capture Screenshot

Travelling Salesman Problem

{{$t('general.by')}}
Ergun
Coruh
Travelling Salesman Problem resolved using an Evolutionary Algorithm. There are 12 cities. The task is to find a shortest possible tour that visits each city exactly once. Mouse click the area first. Each mouse click will show a solution for a different configuration. Down key will show you less optimal solutions for a given configuration. Up key will take you to climb an optimum hill. Generations label will tell you how many generations it took to climb the hill. You may notice some solutions may be less than optimum. This is because in EA sometimes a sub-optimal local hill is climbed
We recovered an unsaved version of this sketch. Please review your changes below.

As a Plus+ Member feature, this source code is hidden by the owner.

  • {{co.title}}
    •
    {{$t('sketch.mode-pjs')}} {{$t('general.learnMore')}}
    Select mode or a template
    {{liveCodeLink}}
    • {{l.url.substr(l.url.lastIndexOf('/') + 1)}}
    {{$t('sketch.layoutDescription')}}

    {{k.category}}
    {{k.label}}
    {{k.description}}

    {{$t('sketch.seeMoreShortcuts')}}

    Versions are only kept for 7 days.
    Join Plus+ to keep versions indefinitely!

    {{$t('general.joinPlus')}}

    {{$t('sketch.versionsSummarized')}}

    {{ $t('general.joinPlus') }}