├── gradle └── wrapper │ └── gradle-wrapper.properties ├── README.md ├── src └── main │ └── kotlin │ ├── Parameters.kt │ ├── Animation.kt │ ├── City.kt │ ├── TempSchedule.kt │ ├── Launcher.kt │ ├── Tour.kt │ ├── Sample.kt │ ├── Dashboard.kt │ ├── Edge.kt │ └── SearchStrategy.kt ├── .gitignore ├── gradlew.bat ├── gradlew └── LICENSE /gradle/wrapper/gradle-wrapper.properties: -------------------------------------------------------------------------------- 1 | distributionBase=GRADLE_USER_HOME 2 | distributionPath=wrapper/dists 3 | zipStoreBase=GRADLE_USER_HOME 4 | zipStorePath=wrapper/dists 5 | distributionUrl=https\://services.gradle.org/distributions/gradle-4.4-bin.zip 6 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Traveling Salesman Plotter 2 | 3 | A Traveling Salesman Problem plotter built in Kotlin/TornadoFX. 4 | 5 | [WATCH VIDEO PREVIEW HERE](https://vimeo.com/278812238) 6 | 7 | ![](https://i.imgur.com/J3SA95A.png) 8 | 9 | ![](https://i.imgur.com/Y8Q7uoi.png) 10 | 11 | ![](https://i.imgur.com/zvqMxe3.png) 12 | 13 | 14 | 15 | -------------------------------------------------------------------------------- /src/main/kotlin/Parameters.kt: -------------------------------------------------------------------------------- 1 | import javafx.beans.property.SimpleDoubleProperty 2 | import tornadofx.* 3 | 4 | object Parameters { 5 | 6 | val animatedTempProperty = SimpleDoubleProperty(0.0) 7 | var animatedTemp by animatedTempProperty 8 | 9 | val distanceProperty = SimpleDoubleProperty(0.0) 10 | var distance by distanceProperty 11 | } -------------------------------------------------------------------------------- /src/main/kotlin/Animation.kt: -------------------------------------------------------------------------------- 1 | import javafx.animation.SequentialTransition 2 | import javafx.animation.Timeline 3 | import tornadofx.* 4 | 5 | val sequentialTransition = SequentialTransition() 6 | operator fun SequentialTransition.plusAssign(timeline: Timeline) { children += timeline } 7 | 8 | var defaultSpeed = 200.millis 9 | var speed = defaultSpeed 10 | var defaultAnimationOn = true -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | # Compiled class file 2 | *.class 3 | 4 | # Log file 5 | *.log 6 | 7 | # BlueJ files 8 | *.ctxt 9 | 10 | # Mobile Tools for Java (J2ME) 11 | .mtj.tmp/ 12 | 13 | # Package Files # 14 | *.jar 15 | *.war 16 | *.nar 17 | *.ear 18 | *.zip 19 | *.tar.gz 20 | *.rar 21 | 22 | # virtual machine crash logs, see http://www.java.com/en/download/help/error_hotspot.xml 23 | hs_err_pid* 24 | 25 | *.iml 26 | .idea/ 27 | .gradle/ 28 | out/ -------------------------------------------------------------------------------- /src/main/kotlin/City.kt: -------------------------------------------------------------------------------- 1 | import javafx.collections.FXCollections 2 | import kotlin.math.sqrt 3 | 4 | class City(val id: Int, val x: Double, val y: Double) { 5 | 6 | fun distanceTo(otherCity: City) = sqrt(Math.pow(x - otherCity.x, 2.0) + Math.pow(y - otherCity.y, 2.0)) 7 | 8 | companion object { 9 | 10 | val all = FXCollections.observableArrayList() 11 | 12 | fun create(x: Double, y: Double): City { 13 | 14 | val nextId = (all.asSequence().map { it.id }.max()?:-1) + 1 15 | 16 | return City(nextId, x, y).also { all += it } 17 | } 18 | } 19 | } -------------------------------------------------------------------------------- /src/main/kotlin/TempSchedule.kt: -------------------------------------------------------------------------------- 1 | import java.util.concurrent.ThreadLocalRandom 2 | 3 | /** 4 | * Simulates a weighted TRUE/FALSE coin flip, with a percentage of probability towards TRUE 5 | */ 6 | fun weightedCoinFlip(trueProbability: Double) = 7 | ThreadLocalRandom.current().nextDouble(0.0,1.0) <= trueProbability 8 | 9 | 10 | 11 | class TempSchedule(val maxTemp: Int, val temperatureSequence: DoubleArray) { 12 | 13 | private var index = -1 14 | 15 | val heat get() = temperatureSequence[index] 16 | val ratio get() = temperatureSequence[index] / maxTemp.toDouble() 17 | 18 | fun next(): Boolean { 19 | if (index == (temperatureSequence.size-1)) return false 20 | index++ 21 | return true 22 | } 23 | } -------------------------------------------------------------------------------- /src/main/kotlin/Launcher.kt: -------------------------------------------------------------------------------- 1 | import javafx.application.Application 2 | import java.io.File 3 | 4 | fun main(args: Array) { 5 | 6 | if (args.isNotEmpty()) { 7 | 8 | File(args[0]) 9 | .readLines().asSequence() 10 | .drop(1) 11 | .map { it.split(" ").map { it.toDouble() } } 12 | .mapIndexed { i,c -> City(i,c[0], c[1]) } 13 | .toList() 14 | .also { 15 | City.all.setAll(it) 16 | } 17 | SearchStrategy.prepare() 18 | SearchStrategy.SIMULATED_ANNEALING.execute() 19 | 20 | println(Tour.tourDistance) 21 | 22 | } else { 23 | Application.launch(TSPApp::class.java, *args) 24 | } 25 | } 26 | -------------------------------------------------------------------------------- /src/main/kotlin/Tour.kt: -------------------------------------------------------------------------------- 1 | object Tour { 2 | 3 | val traverseTour: Sequence get() { 4 | val captured = mutableSetOf() 5 | 6 | return generateSequence(Edge.all.minBy { it.id }) { 7 | it.nextEdge?.takeIf { it !in captured } 8 | }.onEach { captured += it } 9 | } 10 | val tourDistance get() = Edge.all.map { it.distance }.sum() 11 | val isMaintained get() = traverseTour.count() == Edge.all.count() 12 | 13 | val conflicts get() = Edge.all.asSequence() 14 | .map { edge1 -> edge1.intersectConflicts.map { edge2 -> edge1 to edge2}.sampleOrNull() } 15 | .filterNotNull() 16 | 17 | fun toConfiguration() = traverseTour.map { it.startCity to it.endCity }.toList().toTypedArray() 18 | fun applyConfiguration(configuration: Array>) = Edge.all.zip(configuration).forEach { (e,c) -> 19 | e.startCity = c.first 20 | e.endCity = c.second 21 | } 22 | } -------------------------------------------------------------------------------- /src/main/kotlin/Sample.kt: -------------------------------------------------------------------------------- 1 | import java.util.concurrent.ThreadLocalRandom 2 | 3 | 4 | /** 5 | * Samples a single random element `T` from a `List`, and throws an error if no elements exist 6 | */ 7 | fun List.sample() = sampleOrNull()?: throw Exception("No elements found!") 8 | 9 | /** 10 | * Samples a single random element `T` from a `List`, and returns `null` if no elements exist 11 | */ 12 | fun List.sampleOrNull(): T? { 13 | if (size == 0) return null 14 | 15 | val random = ThreadLocalRandom.current().nextInt(0,size) 16 | 17 | return this[random] 18 | } 19 | 20 | 21 | /** 22 | * Samples a single random element `T` from a `Sequence`, and throws an error if no elements exist 23 | */ 24 | fun Sequence.sample() = toList().sample() 25 | 26 | /** 27 | * Samples a single random element `T` from a `Sequence`, and returns `null` if no elements exist 28 | */ 29 | fun Sequence.sampleOrNull() = toList().sampleOrNull() 30 | 31 | 32 | /** 33 | * Samples a single random element `T` from a `Sequence`, and throws an error if no elements exist 34 | */ 35 | fun Iterable.sample() = toList().sample() 36 | 37 | /** 38 | * Samples a single random element `T` from an `Iterable`, and returns `null` if no elements exist 39 | */ 40 | fun Iterable.sampleOrNull() = toList().sampleOrNull() 41 | 42 | 43 | /** 44 | * Samples a single random element `T` from an `Iterable`, and returns `null` if no elements exist 45 | */ 46 | fun List.sampleDistinct(sampleSize: Int): List { 47 | 48 | val cappedSampleSize = if (sampleSize > size) size else sampleSize 49 | 50 | return (0..Int.MAX_VALUE).asSequence().map { 51 | ThreadLocalRandom.current().nextInt(0,size) 52 | }.distinct() 53 | .take(cappedSampleSize) 54 | .map { this[it] } 55 | .toList() 56 | } 57 | 58 | 59 | fun Sequence.sampleDistinct(sampleSize: Int) = toList().sampleDistinct(sampleSize) -------------------------------------------------------------------------------- /gradlew.bat: -------------------------------------------------------------------------------- 1 | @if "%DEBUG%" == "" @echo off 2 | @rem ########################################################################## 3 | @rem 4 | @rem Gradle startup script for Windows 5 | @rem 6 | @rem ########################################################################## 7 | 8 | @rem Set local scope for the variables with windows NT shell 9 | if "%OS%"=="Windows_NT" setlocal 10 | 11 | set DIRNAME=%~dp0 12 | if "%DIRNAME%" == "" set DIRNAME=. 13 | set APP_BASE_NAME=%~n0 14 | set APP_HOME=%DIRNAME% 15 | 16 | @rem Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script. 17 | set DEFAULT_JVM_OPTS= 18 | 19 | @rem Find java.exe 20 | if defined JAVA_HOME goto findJavaFromJavaHome 21 | 22 | set JAVA_EXE=java.exe 23 | %JAVA_EXE% -version >NUL 2>&1 24 | if "%ERRORLEVEL%" == "0" goto init 25 | 26 | echo. 27 | echo ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH. 28 | echo. 29 | echo Please set the JAVA_HOME variable in your environment to match the 30 | echo location of your Java installation. 31 | 32 | goto fail 33 | 34 | :findJavaFromJavaHome 35 | set JAVA_HOME=%JAVA_HOME:"=% 36 | set JAVA_EXE=%JAVA_HOME%/bin/java.exe 37 | 38 | if exist "%JAVA_EXE%" goto init 39 | 40 | echo. 41 | echo ERROR: JAVA_HOME is set to an invalid directory: %JAVA_HOME% 42 | echo. 43 | echo Please set the JAVA_HOME variable in your environment to match the 44 | echo location of your Java installation. 45 | 46 | goto fail 47 | 48 | :init 49 | @rem Get command-line arguments, handling Windows variants 50 | 51 | if not "%OS%" == "Windows_NT" goto win9xME_args 52 | 53 | :win9xME_args 54 | @rem Slurp the command line arguments. 55 | set CMD_LINE_ARGS= 56 | set _SKIP=2 57 | 58 | :win9xME_args_slurp 59 | if "x%~1" == "x" goto execute 60 | 61 | set CMD_LINE_ARGS=%* 62 | 63 | :execute 64 | @rem Setup the command line 65 | 66 | set CLASSPATH=%APP_HOME%\gradle\wrapper\gradle-wrapper.jar 67 | 68 | @rem Execute Gradle 69 | "%JAVA_EXE%" %DEFAULT_JVM_OPTS% %JAVA_OPTS% %GRADLE_OPTS% "-Dorg.gradle.appname=%APP_BASE_NAME%" -classpath "%CLASSPATH%" org.gradle.wrapper.GradleWrapperMain %CMD_LINE_ARGS% 70 | 71 | :end 72 | @rem End local scope for the variables with windows NT shell 73 | if "%ERRORLEVEL%"=="0" goto mainEnd 74 | 75 | :fail 76 | rem Set variable GRADLE_EXIT_CONSOLE if you need the _script_ return code instead of 77 | rem the _cmd.exe /c_ return code! 78 | if not "" == "%GRADLE_EXIT_CONSOLE%" exit 1 79 | exit /b 1 80 | 81 | :mainEnd 82 | if "%OS%"=="Windows_NT" endlocal 83 | 84 | :omega 85 | -------------------------------------------------------------------------------- /src/main/kotlin/Dashboard.kt: -------------------------------------------------------------------------------- 1 | import javafx.geometry.Orientation 2 | import javafx.scene.input.MouseEvent 3 | import javafx.scene.paint.Color 4 | import javafx.scene.shape.Circle 5 | import javafx.scene.shape.Line 6 | import tornadofx.* 7 | 8 | 9 | class TSPApp: App(TSPView::class) 10 | 11 | 12 | 13 | 14 | class TSPView: View() { 15 | 16 | private val dots = mutableListOf() 17 | private val lines = mutableListOf() 18 | 19 | override val root = borderpane { 20 | title = "Traveling Salesman Plotter" 21 | primaryStage.isMaximized = true 22 | 23 | top = menubar { 24 | 25 | menu("File") { 26 | item("Quit") { 27 | setOnAction { 28 | System.exit(0) 29 | } 30 | } 31 | } 32 | menu("Edit") { 33 | item("Clear") { 34 | setOnAction { 35 | City.all.clear() 36 | Edge.all.clear() 37 | SearchStrategy.prepare() 38 | } 39 | } 40 | } 41 | } 42 | left = toolbar { 43 | orientation = Orientation.VERTICAL 44 | 45 | SearchStrategy.values().forEach { ss -> 46 | 47 | button(ss.toString().replace("_", " ")) { 48 | setOnAction { 49 | SearchStrategy.prepare() 50 | ss.execute() 51 | sequentialTransition.play() 52 | } 53 | useMaxWidth = true 54 | } 55 | } 56 | separator(orientation = Orientation.HORIZONTAL) 57 | separator(orientation = Orientation.HORIZONTAL) 58 | 59 | 60 | label("DISTANCE") 61 | textfield(Parameters.distanceProperty) 62 | 63 | separator(orientation = Orientation.HORIZONTAL) 64 | 65 | label("TEMPERATURE") 66 | stackpane { 67 | progressbar(Parameters.animatedTempProperty) { 68 | style { 69 | accentColor = Color.RED 70 | } 71 | useMaxWidth = true 72 | } 73 | label(Parameters.animatedTempProperty) 74 | useMaxWidth = true 75 | } 76 | } 77 | 78 | center = pane { 79 | 80 | // Sychronize changes to cities 81 | City.all.onChange { 82 | children.removeAll(dots) 83 | dots.clear() 84 | 85 | it.list.forEach { 86 | Circle(it.x, it.y, 5.0).apply { 87 | fill = Color.RED 88 | children += this 89 | dots += this 90 | } 91 | } 92 | } 93 | // Synchronize Edges 94 | 95 | Edge.all.onChange { 96 | 97 | children.removeAll(lines) 98 | lines.clear() 99 | 100 | it.list.forEach { edge -> 101 | Line().apply { 102 | startXProperty().bind(edge.edgeStartX) 103 | startYProperty().bind(edge.edgeStartY) 104 | endXProperty().bind(edge.edgeEndX) 105 | endYProperty().bind(edge.edgeEndY) 106 | strokeWidth = 3.0 107 | stroke = Color.RED 108 | }.also { 109 | children += it 110 | lines += it 111 | } 112 | } 113 | } 114 | 115 | addEventHandler(MouseEvent.MOUSE_CLICKED) { 116 | City.create(it.x, it.y) 117 | } 118 | } 119 | } 120 | } -------------------------------------------------------------------------------- /gradlew: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env sh 2 | 3 | ############################################################################## 4 | ## 5 | ## Gradle start up script for UN*X 6 | ## 7 | ############################################################################## 8 | 9 | # Attempt to set APP_HOME 10 | # Resolve links: $0 may be a link 11 | PRG="$0" 12 | # Need this for relative symlinks. 13 | while [ -h "$PRG" ] ; do 14 | ls=`ls -ld "$PRG"` 15 | link=`expr "$ls" : '.*-> \(.*\)$'` 16 | if expr "$link" : '/.*' > /dev/null; then 17 | PRG="$link" 18 | else 19 | PRG=`dirname "$PRG"`"/$link" 20 | fi 21 | done 22 | SAVED="`pwd`" 23 | cd "`dirname \"$PRG\"`/" >/dev/null 24 | APP_HOME="`pwd -P`" 25 | cd "$SAVED" >/dev/null 26 | 27 | APP_NAME="Gradle" 28 | APP_BASE_NAME=`basename "$0"` 29 | 30 | # Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script. 31 | DEFAULT_JVM_OPTS="" 32 | 33 | # Use the maximum available, or set MAX_FD != -1 to use that value. 34 | MAX_FD="maximum" 35 | 36 | warn () { 37 | echo "$*" 38 | } 39 | 40 | die () { 41 | echo 42 | echo "$*" 43 | echo 44 | exit 1 45 | } 46 | 47 | # OS specific support (must be 'true' or 'false'). 48 | cygwin=false 49 | msys=false 50 | darwin=false 51 | nonstop=false 52 | case "`uname`" in 53 | CYGWIN* ) 54 | cygwin=true 55 | ;; 56 | Darwin* ) 57 | darwin=true 58 | ;; 59 | MINGW* ) 60 | msys=true 61 | ;; 62 | NONSTOP* ) 63 | nonstop=true 64 | ;; 65 | esac 66 | 67 | CLASSPATH=$APP_HOME/gradle/wrapper/gradle-wrapper.jar 68 | 69 | # Determine the Java command to use to start the JVM. 70 | if [ -n "$JAVA_HOME" ] ; then 71 | if [ -x "$JAVA_HOME/jre/sh/java" ] ; then 72 | # IBM's JDK on AIX uses strange locations for the executables 73 | JAVACMD="$JAVA_HOME/jre/sh/java" 74 | else 75 | JAVACMD="$JAVA_HOME/bin/java" 76 | fi 77 | if [ ! -x "$JAVACMD" ] ; then 78 | die "ERROR: JAVA_HOME is set to an invalid directory: $JAVA_HOME 79 | 80 | Please set the JAVA_HOME variable in your environment to match the 81 | location of your Java installation." 82 | fi 83 | else 84 | JAVACMD="java" 85 | which java >/dev/null 2>&1 || die "ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH. 86 | 87 | Please set the JAVA_HOME variable in your environment to match the 88 | location of your Java installation." 89 | fi 90 | 91 | # Increase the maximum file descriptors if we can. 92 | if [ "$cygwin" = "false" -a "$darwin" = "false" -a "$nonstop" = "false" ] ; then 93 | MAX_FD_LIMIT=`ulimit -H -n` 94 | if [ $? -eq 0 ] ; then 95 | if [ "$MAX_FD" = "maximum" -o "$MAX_FD" = "max" ] ; then 96 | MAX_FD="$MAX_FD_LIMIT" 97 | fi 98 | ulimit -n $MAX_FD 99 | if [ $? -ne 0 ] ; then 100 | warn "Could not set maximum file descriptor limit: $MAX_FD" 101 | fi 102 | else 103 | warn "Could not query maximum file descriptor limit: $MAX_FD_LIMIT" 104 | fi 105 | fi 106 | 107 | # For Darwin, add options to specify how the application appears in the dock 108 | if $darwin; then 109 | GRADLE_OPTS="$GRADLE_OPTS \"-Xdock:name=$APP_NAME\" \"-Xdock:icon=$APP_HOME/media/gradle.icns\"" 110 | fi 111 | 112 | # For Cygwin, switch paths to Windows format before running java 113 | if $cygwin ; then 114 | APP_HOME=`cygpath --path --mixed "$APP_HOME"` 115 | CLASSPATH=`cygpath --path --mixed "$CLASSPATH"` 116 | JAVACMD=`cygpath --unix "$JAVACMD"` 117 | 118 | # We build the pattern for arguments to be converted via cygpath 119 | ROOTDIRSRAW=`find -L / -maxdepth 1 -mindepth 1 -type d 2>/dev/null` 120 | SEP="" 121 | for dir in $ROOTDIRSRAW ; do 122 | ROOTDIRS="$ROOTDIRS$SEP$dir" 123 | SEP="|" 124 | done 125 | OURCYGPATTERN="(^($ROOTDIRS))" 126 | # Add a user-defined pattern to the cygpath arguments 127 | if [ "$GRADLE_CYGPATTERN" != "" ] ; then 128 | OURCYGPATTERN="$OURCYGPATTERN|($GRADLE_CYGPATTERN)" 129 | fi 130 | # Now convert the arguments - kludge to limit ourselves to /bin/sh 131 | i=0 132 | for arg in "$@" ; do 133 | CHECK=`echo "$arg"|egrep -c "$OURCYGPATTERN" -` 134 | CHECK2=`echo "$arg"|egrep -c "^-"` ### Determine if an option 135 | 136 | if [ $CHECK -ne 0 ] && [ $CHECK2 -eq 0 ] ; then ### Added a condition 137 | eval `echo args$i`=`cygpath --path --ignore --mixed "$arg"` 138 | else 139 | eval `echo args$i`="\"$arg\"" 140 | fi 141 | i=$((i+1)) 142 | done 143 | case $i in 144 | (0) set -- ;; 145 | (1) set -- "$args0" ;; 146 | (2) set -- "$args0" "$args1" ;; 147 | (3) set -- "$args0" "$args1" "$args2" ;; 148 | (4) set -- "$args0" "$args1" "$args2" "$args3" ;; 149 | (5) set -- "$args0" "$args1" "$args2" "$args3" "$args4" ;; 150 | (6) set -- "$args0" "$args1" "$args2" "$args3" "$args4" "$args5" ;; 151 | (7) set -- "$args0" "$args1" "$args2" "$args3" "$args4" "$args5" "$args6" ;; 152 | (8) set -- "$args0" "$args1" "$args2" "$args3" "$args4" "$args5" "$args6" "$args7" ;; 153 | (9) set -- "$args0" "$args1" "$args2" "$args3" "$args4" "$args5" "$args6" "$args7" "$args8" ;; 154 | esac 155 | fi 156 | 157 | # Escape application args 158 | save () { 159 | for i do printf %s\\n "$i" | sed "s/'/'\\\\''/g;1s/^/'/;\$s/\$/' \\\\/" ; done 160 | echo " " 161 | } 162 | APP_ARGS=$(save "$@") 163 | 164 | # Collect all arguments for the java command, following the shell quoting and substitution rules 165 | eval set -- $DEFAULT_JVM_OPTS $JAVA_OPTS $GRADLE_OPTS "\"-Dorg.gradle.appname=$APP_BASE_NAME\"" -classpath "\"$CLASSPATH\"" org.gradle.wrapper.GradleWrapperMain "$APP_ARGS" 166 | 167 | # by default we should be in the correct project dir, but when run from Finder on Mac, the cwd is wrong 168 | if [ "$(uname)" = "Darwin" ] && [ "$HOME" = "$PWD" ]; then 169 | cd "$(dirname "$0")" 170 | fi 171 | 172 | exec "$JAVACMD" "$@" 173 | -------------------------------------------------------------------------------- /src/main/kotlin/Edge.kt: -------------------------------------------------------------------------------- 1 | import javafx.beans.property.SimpleDoubleProperty 2 | import javafx.beans.property.SimpleObjectProperty 3 | import javafx.collections.FXCollections 4 | import tornadofx.* 5 | 6 | 7 | data class Point(val x: Double, val y: Double) 8 | 9 | fun ccw(a: Point, b: Point, c: Point) = 10 | (c.y - a.y) * (b.x - a.x) > (b.y - a.y) * (c.x - a.x) 11 | 12 | fun intersect(a: Point, b: Point, c: Point, d: Point) = 13 | ccw(a,c,d) != ccw(b,c,d) && ccw(a,b,c) != ccw(a,b,d) 14 | 15 | 16 | 17 | class Edge(val id: Int, startingCity: City) { 18 | 19 | val startCityProperty = SimpleObjectProperty(startingCity) 20 | var startCity by startCityProperty 21 | 22 | val endCityProperty = SimpleObjectProperty(startingCity) 23 | var endCity by endCityProperty 24 | 25 | val edgeStartX = SimpleDoubleProperty(startCityProperty.get().x) 26 | val edgeStartY = SimpleDoubleProperty(startCityProperty.get().y) 27 | val edgeEndX = SimpleDoubleProperty(startCityProperty.get().x) 28 | val edgeEndY = SimpleDoubleProperty(startCityProperty.get().y) 29 | 30 | val startPoint get() = Point(startCity.x, startCity.y) 31 | val endPoint get() = Point(endCity.x, endCity.y) 32 | 33 | val nextEdge get() = (all.firstOrNull { it != this && it.startCity == endCity }) ?: 34 | (all.firstOrNull { it != this && it.endCity == endCity }?.also { it.flip() }) 35 | 36 | val distance get() = startCity.distanceTo(endCity) 37 | 38 | private fun flip() { 39 | val city1 = startCity 40 | val city2 = endCity 41 | startCity = city2 42 | endCity = city1 43 | } 44 | 45 | val intersectConflicts get() = Edge.all.asSequence() 46 | .filter { it != this } 47 | .filter { edge2 -> 48 | startCity !in edge2.let { setOf(it.startCity, it.endCity) } && 49 | endCity !in edge2.let { setOf(it.startCity, it.endCity) } && 50 | intersect(startPoint, endPoint, edge2.startPoint, edge2.endPoint) 51 | } 52 | 53 | class Swap(val city1: City, 54 | val city2: City, 55 | val edge1: Edge, 56 | val edge2: Edge 57 | ) { 58 | 59 | fun execute() { 60 | edge1.let { sequenceOf(it.startCityProperty, it.endCityProperty) }.first { it.get() == city1 }.set(city2) 61 | edge2.let { sequenceOf(it.startCityProperty, it.endCityProperty) }.first { it.get() == city2 }.set(city1) 62 | } 63 | fun reverse() { 64 | edge1.let { sequenceOf(it.startCityProperty, it.endCityProperty) }.first { it.get() == city2 }.set(city1) 65 | edge2.let { sequenceOf(it.startCityProperty, it.endCityProperty) }.first { it.get() == city1 }.set(city2) 66 | } 67 | 68 | 69 | fun animate() { 70 | sequentialTransition += timeline(play = false) { 71 | keyframe(speed) { 72 | sequenceOf(edge1,edge2).forEach { 73 | keyvalue(it.edgeStartX, it.startCity?.x ?: 0.0) 74 | keyvalue(it.edgeStartY, it.startCity?.y ?: 0.0) 75 | keyvalue(it.edgeEndX, it.endCity?.x ?: 0.0) 76 | keyvalue(it.edgeEndY, it.endCity?.y ?: 0.0) 77 | } 78 | } 79 | } 80 | 81 | sequentialTransition += timeline(play=false) { 82 | keyframe(1.millis) { 83 | keyvalue(Parameters.distanceProperty, Tour.tourDistance ) 84 | } 85 | } 86 | } 87 | 88 | override fun toString() = "$city1-$city2 ($edge1)-($edge2)" 89 | } 90 | 91 | fun attemptTwoSwap(otherEdge: Edge): Swap? { 92 | 93 | val e1 = this 94 | val e2 = otherEdge 95 | 96 | val startCity1 = startCity 97 | val endCity1 = endCity 98 | val startCity2 = otherEdge.startCity 99 | val endCity2 = otherEdge.endCity 100 | 101 | return sequenceOf( 102 | Swap(startCity1, startCity2, e1, e2), 103 | Swap(endCity1, endCity2, e1, e2), 104 | 105 | Swap(startCity1, endCity2, e1, e2), 106 | Swap(endCity1, startCity2, e1, e2) 107 | 108 | ).filter { 109 | it.edge1.startCity !in it.edge2.let { setOf(it.startCity, it.endCity) } && 110 | it.edge1.endCity !in it.edge2.let { setOf(it.startCity, it.endCity) } 111 | } 112 | .firstOrNull { swap -> 113 | swap.execute() 114 | val result = Tour.isMaintained 115 | if (!result) { 116 | swap.reverse() 117 | } 118 | result 119 | } 120 | } 121 | 122 | 123 | init { 124 | startCityProperty.onChange { 125 | if (defaultAnimationOn) { 126 | sequentialTransition += timeline(play = false) { 127 | keyframe(speed) { 128 | keyvalue(edgeStartX, it?.x ?: 0.0) 129 | keyvalue(edgeStartY, it?.y ?: 0.0) 130 | } 131 | } 132 | } 133 | } 134 | endCityProperty.onChange { 135 | if (defaultAnimationOn) 136 | sequentialTransition += timeline(play = false) { 137 | keyframe(speed) { 138 | keyvalue(edgeEndX, it?.x ?: 0.0) 139 | keyvalue(edgeEndY, it?.y ?: 0.0) 140 | } 141 | } 142 | } 143 | } 144 | 145 | fun animateChange() { 146 | sequentialTransition += timeline(play = false) { 147 | keyframe(speed) { 148 | keyvalue(edgeStartX, startCity?.x ?: 0.0) 149 | keyvalue(edgeStartY, startCity?.y ?: 0.0) 150 | keyvalue(edgeEndX, endCity?.x ?: 0.0) 151 | keyvalue(edgeEndY, endCity?.y ?: 0.0) 152 | } 153 | } 154 | } 155 | 156 | companion object { 157 | 158 | val all = FXCollections.observableArrayList() 159 | 160 | fun create(startingCity: City): Edge { 161 | 162 | val nextId = (all.asSequence().map { it.id }.max()?:-1) + 1 163 | 164 | return Edge(nextId, startingCity).also { all += it } 165 | } 166 | 167 | fun clearAndRebuild() { 168 | var id = -1 169 | City.all.map { Edge(id++, it) } 170 | .also { all.setAll(it) } 171 | } 172 | } 173 | } -------------------------------------------------------------------------------- /src/main/kotlin/SearchStrategy.kt: -------------------------------------------------------------------------------- 1 | import tornadofx.* 2 | import kotlin.math.exp 3 | 4 | enum class SearchStrategy { 5 | RANDOM { 6 | override fun execute() { 7 | val capturedCities = mutableSetOf() 8 | 9 | val startingEdge = Edge.all.sample() 10 | var edge = startingEdge 11 | 12 | while (capturedCities.size < City.all.size) { 13 | capturedCities += edge.startCity.id 14 | 15 | val nextRandom = Edge.all.asSequence() 16 | .filter { it.startCity.id !in capturedCities } 17 | .sampleOrNull() ?: startingEdge 18 | 19 | edge.endCity = nextRandom.startCity 20 | edge = nextRandom 21 | } 22 | 23 | if (!Tour.isMaintained) throw Exception("Tour broken in RANDOM SearchStrategy \r\n${Edge.all.joinToString("\r\n")}") 24 | defaultAnimationOn = true 25 | } 26 | }, 27 | 28 | GREEDY { 29 | override fun execute() { 30 | val capturedCities = mutableSetOf() 31 | 32 | var edge = Edge.all.first() 33 | 34 | while (capturedCities.size < City.all.size) { 35 | capturedCities += edge.startCity.id 36 | 37 | val closest = Edge.all.asSequence().filter { it.startCity.id !in capturedCities } 38 | .minBy { edge.startCity.distanceTo(it.startCity) } 39 | ?: Edge.all.first() 40 | 41 | edge.endCity = closest.startCity 42 | edge = closest 43 | } 44 | if (!Tour.isMaintained) throw Exception("Tour broken in GREEDY SearchStrategy \r\n${Edge.all.joinToString("\r\n")}") 45 | defaultAnimationOn = true 46 | } 47 | }, 48 | 49 | REMOVE_OVERLAPS { 50 | override fun execute() { 51 | 52 | SearchStrategy.RANDOM.execute() 53 | defaultAnimationOn = false 54 | 55 | (1..10).forEach { 56 | Tour.conflicts.forEach { (x, y) -> 57 | x.attemptTwoSwap(y)?.animate() 58 | } 59 | } 60 | 61 | defaultAnimationOn= true 62 | } 63 | }, 64 | 65 | TWO_OPT { 66 | override fun execute() { 67 | 68 | SearchStrategy.RANDOM.execute() 69 | defaultAnimationOn = false 70 | 71 | (1..10000).forEach { iteration -> 72 | Edge.all.sampleDistinct(2).toList() 73 | .let { it.first() to it.last() } 74 | .also { (e1,e2) -> 75 | 76 | val oldDistance = Tour.tourDistance 77 | e1.attemptTwoSwap(e2)?.also { 78 | when { 79 | oldDistance <= Tour.tourDistance -> it.reverse() 80 | oldDistance > Tour.tourDistance -> it.animate() 81 | } 82 | } 83 | } 84 | } 85 | 86 | if (!Tour.isMaintained) throw Exception("Tour broken in TWO_OPT SearchStrategy \r\n${Edge.all.joinToString("\r\n")}") 87 | defaultAnimationOn = true 88 | } 89 | }, 90 | SIMULATED_ANNEALING { 91 | override fun execute() { 92 | SearchStrategy.RANDOM.execute() 93 | defaultAnimationOn = false 94 | 95 | 96 | var bestDistance = Tour.tourDistance 97 | var bestSolution = Tour.toConfiguration() 98 | 99 | sequenceOf( 100 | generateSequence(80.0) { (it - .05).takeIf { it >= 0 } }/*, 101 | generateSequence(0.0) { (it + .005).takeIf { it <= 80 } }, 102 | generateSequence(80.0) { (it - .005).takeIf { it >= 30 } }*/ 103 | ).flatMap { it } 104 | .plus(0.0) 105 | .forEach { temp -> 106 | 107 | Edge.all.sampleDistinct(2) 108 | .toList() 109 | .also { (e1,e2) -> 110 | 111 | val oldDistance = Tour.tourDistance 112 | 113 | // try to swap vertices on the two random edges 114 | val swap = e1.attemptTwoSwap(e2) 115 | 116 | // track changes in distance 117 | val newDistance = Tour.tourDistance 118 | 119 | //if a swap was possible 120 | if (swap != null) { 121 | 122 | // if swap is superior to curent distance, keep it 123 | if (newDistance < oldDistance) { 124 | 125 | swap.animate() 126 | // if swap is superior to the last best found solution, save it as the new best solution 127 | if (newDistance < bestDistance) { 128 | bestDistance = newDistance 129 | 130 | bestSolution = Tour.toConfiguration() 131 | } 132 | } 133 | // shall I take an inferior move? Let's flip a coin 134 | else { 135 | // Desmos graph for intuition: https://www.desmos.com/calculator/rpfpfiq7ce 136 | if (weightedCoinFlip( 137 | exp((-(newDistance - oldDistance)) / temp) 138 | ) 139 | ) { 140 | swap.animate() 141 | } else { 142 | swap.reverse() 143 | } 144 | } 145 | } 146 | } 147 | 148 | sequentialTransition += timeline(play=false) { 149 | keyframe(1.millis) { 150 | keyvalue(Parameters.animatedTempProperty, temp / 80 ) 151 | } 152 | } 153 | } 154 | 155 | (1..10).forEach { 156 | Tour.conflicts.forEach { (x, y) -> 157 | x.attemptTwoSwap(y)?.animate() 158 | } 159 | } 160 | 161 | // apply best found model 162 | if (Tour.tourDistance > bestDistance) { 163 | Tour.applyConfiguration(bestSolution) 164 | Edge.all.forEach { it.animateChange() } 165 | } 166 | 167 | println("$bestDistance<==>${Tour.tourDistance}") 168 | defaultAnimationOn = true 169 | 170 | } 171 | }/*, 172 | 173 | 174 | INTEGER { 175 | override fun execute() { 176 | 177 | val solver = ExpressionsBasedModel() 178 | 179 | val cities = City.all 180 | 181 | val cityDummies = cities.map { it to solver.variable(isInteger = true, lower = 0) }.toMap() 182 | 183 | data class Segment(val city1: City, val city2: City) { 184 | val selected = solver.variable(isBinary = true) 185 | val distance get() = city1.distanceTo(city2) 186 | 187 | val u_i = cityDummies[city1]!! 188 | val u_j = cityDummies[city2]!! 189 | 190 | // TODO this is not working :/ 191 | // https://en.wikipedia.org/wiki/Travelling_salesman_problem#Integer_linear_programming_formulation 192 | init { 193 | solver.expression { 194 | set(u_i, 1) 195 | set(u_j, -1) 196 | set(selected, cities.size) 197 | upper(cities.size-1) 198 | } 199 | } 200 | operator fun contains(city: City) = city == city1 || city == city2 201 | } 202 | 203 | // create segments 204 | val segments = cities.flatMap { city1 -> 205 | cities.filter { it != city1 } 206 | .map { city1 to it } 207 | //.map { city2 -> if (city1.id > city2.id) city2 to city1 else city1 to city2 } 208 | }.distinct() 209 | .map { Segment(it.first, it.second) } 210 | .toList() 211 | 212 | solver.apply { 213 | 214 | // constrain each city to have two connections 215 | cities.forEach { city -> 216 | expression(lower=2, upper=2) { 217 | segments.filter { city in it }.forEach { set(it.selected, 1) } 218 | } 219 | } 220 | 221 | // minimize distance objective 222 | expression(weight = 1) { 223 | segments.forEach { 224 | set(it.selected, it.distance) 225 | } 226 | } 227 | 228 | } 229 | 230 | // execute and plot 231 | val result = solver.minimise().also(::println) 232 | 233 | segments.filter { it.selected.value.toInt() == 1 } 234 | .zip(Edge.all) 235 | .forEach { (selectedSegment, edge) -> 236 | edge.startCity = selectedSegment.city1 237 | edge.endCity = selectedSegment.city2 238 | edge.animateChange() 239 | } 240 | 241 | } 242 | }*/; 243 | 244 | abstract fun execute() 245 | 246 | companion object { 247 | fun prepare() { 248 | sequentialTransition.children.clear() 249 | Edge.clearAndRebuild() 250 | } 251 | } 252 | } -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | Apache License 2 | Version 2.0, January 2004 3 | http://www.apache.org/licenses/ 4 | 5 | TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 6 | 7 | 1. Definitions. 8 | 9 | "License" shall mean the terms and conditions for use, reproduction, 10 | and distribution as defined by Sections 1 through 9 of this document. 11 | 12 | "Licensor" shall mean the copyright owner or entity authorized by 13 | the copyright owner that is granting the License. 14 | 15 | "Legal Entity" shall mean the union of the acting entity and all 16 | other entities that control, are controlled by, or are under common 17 | control with that entity. For the purposes of this definition, 18 | "control" means (i) the power, direct or indirect, to cause the 19 | direction or management of such entity, whether by contract or 20 | otherwise, or (ii) ownership of fifty percent (50%) or more of the 21 | outstanding shares, or (iii) beneficial ownership of such entity. 22 | 23 | "You" (or "Your") shall mean an individual or Legal Entity 24 | exercising permissions granted by this License. 25 | 26 | "Source" form shall mean the preferred form for making modifications, 27 | including but not limited to software source code, documentation 28 | source, and configuration files. 29 | 30 | "Object" form shall mean any form resulting from mechanical 31 | transformation or translation of a Source form, including but 32 | not limited to compiled object code, generated documentation, 33 | and conversions to other media types. 34 | 35 | "Work" shall mean the work of authorship, whether in Source or 36 | Object form, made available under the License, as indicated by a 37 | copyright notice that is included in or attached to the work 38 | (an example is provided in the Appendix below). 39 | 40 | "Derivative Works" shall mean any work, whether in Source or Object 41 | form, that is based on (or derived from) the Work and for which the 42 | editorial revisions, annotations, elaborations, or other modifications 43 | represent, as a whole, an original work of authorship. For the purposes 44 | of this License, Derivative Works shall not include works that remain 45 | separable from, or merely link (or bind by name) to the interfaces of, 46 | the Work and Derivative Works thereof. 47 | 48 | "Contribution" shall mean any work of authorship, including 49 | the original version of the Work and any modifications or additions 50 | to that Work or Derivative Works thereof, that is intentionally 51 | submitted to Licensor for inclusion in the Work by the copyright owner 52 | or by an individual or Legal Entity authorized to submit on behalf of 53 | the copyright owner. For the purposes of this definition, "submitted" 54 | means any form of electronic, verbal, or written communication sent 55 | to the Licensor or its representatives, including but not limited to 56 | communication on electronic mailing lists, source code control systems, 57 | and issue tracking systems that are managed by, or on behalf of, the 58 | Licensor for the purpose of discussing and improving the Work, but 59 | excluding communication that is conspicuously marked or otherwise 60 | designated in writing by the copyright owner as "Not a Contribution." 61 | 62 | "Contributor" shall mean Licensor and any individual or Legal Entity 63 | on behalf of whom a Contribution has been received by Licensor and 64 | subsequently incorporated within the Work. 65 | 66 | 2. Grant of Copyright License. Subject to the terms and conditions of 67 | this License, each Contributor hereby grants to You a perpetual, 68 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 69 | copyright license to reproduce, prepare Derivative Works of, 70 | publicly display, publicly perform, sublicense, and distribute the 71 | Work and such Derivative Works in Source or Object form. 72 | 73 | 3. Grant of Patent License. Subject to the terms and conditions of 74 | this License, each Contributor hereby grants to You a perpetual, 75 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 76 | (except as stated in this section) patent license to make, have made, 77 | use, offer to sell, sell, import, and otherwise transfer the Work, 78 | where such license applies only to those patent claims licensable 79 | by such Contributor that are necessarily infringed by their 80 | Contribution(s) alone or by combination of their Contribution(s) 81 | with the Work to which such Contribution(s) was submitted. If You 82 | institute patent litigation against any entity (including a 83 | cross-claim or counterclaim in a lawsuit) alleging that the Work 84 | or a Contribution incorporated within the Work constitutes direct 85 | or contributory patent infringement, then any patent licenses 86 | granted to You under this License for that Work shall terminate 87 | as of the date such litigation is filed. 88 | 89 | 4. Redistribution. You may reproduce and distribute copies of the 90 | Work or Derivative Works thereof in any medium, with or without 91 | modifications, and in Source or Object form, provided that You 92 | meet the following conditions: 93 | 94 | (a) You must give any other recipients of the Work or 95 | Derivative Works a copy of this License; and 96 | 97 | (b) You must cause any modified files to carry prominent notices 98 | stating that You changed the files; and 99 | 100 | (c) You must retain, in the Source form of any Derivative Works 101 | that You distribute, all copyright, patent, trademark, and 102 | attribution notices from the Source form of the Work, 103 | excluding those notices that do not pertain to any part of 104 | the Derivative Works; and 105 | 106 | (d) If the Work includes a "NOTICE" text file as part of its 107 | distribution, then any Derivative Works that You distribute must 108 | include a readable copy of the attribution notices contained 109 | within such NOTICE file, excluding those notices that do not 110 | pertain to any part of the Derivative Works, in at least one 111 | of the following places: within a NOTICE text file distributed 112 | as part of the Derivative Works; within the Source form or 113 | documentation, if provided along with the Derivative Works; or, 114 | within a display generated by the Derivative Works, if and 115 | wherever such third-party notices normally appear. The contents 116 | of the NOTICE file are for informational purposes only and 117 | do not modify the License. You may add Your own attribution 118 | notices within Derivative Works that You distribute, alongside 119 | or as an addendum to the NOTICE text from the Work, provided 120 | that such additional attribution notices cannot be construed 121 | as modifying the License. 122 | 123 | You may add Your own copyright statement to Your modifications and 124 | may provide additional or different license terms and conditions 125 | for use, reproduction, or distribution of Your modifications, or 126 | for any such Derivative Works as a whole, provided Your use, 127 | reproduction, and distribution of the Work otherwise complies with 128 | the conditions stated in this License. 129 | 130 | 5. Submission of Contributions. Unless You explicitly state otherwise, 131 | any Contribution intentionally submitted for inclusion in the Work 132 | by You to the Licensor shall be under the terms and conditions of 133 | this License, without any additional terms or conditions. 134 | Notwithstanding the above, nothing herein shall supersede or modify 135 | the terms of any separate license agreement you may have executed 136 | with Licensor regarding such Contributions. 137 | 138 | 6. Trademarks. This License does not grant permission to use the trade 139 | names, trademarks, service marks, or product names of the Licensor, 140 | except as required for reasonable and customary use in describing the 141 | origin of the Work and reproducing the content of the NOTICE file. 142 | 143 | 7. Disclaimer of Warranty. Unless required by applicable law or 144 | agreed to in writing, Licensor provides the Work (and each 145 | Contributor provides its Contributions) on an "AS IS" BASIS, 146 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 147 | implied, including, without limitation, any warranties or conditions 148 | of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A 149 | PARTICULAR PURPOSE. You are solely responsible for determining the 150 | appropriateness of using or redistributing the Work and assume any 151 | risks associated with Your exercise of permissions under this License. 152 | 153 | 8. Limitation of Liability. In no event and under no legal theory, 154 | whether in tort (including negligence), contract, or otherwise, 155 | unless required by applicable law (such as deliberate and grossly 156 | negligent acts) or agreed to in writing, shall any Contributor be 157 | liable to You for damages, including any direct, indirect, special, 158 | incidental, or consequential damages of any character arising as a 159 | result of this License or out of the use or inability to use the 160 | Work (including but not limited to damages for loss of goodwill, 161 | work stoppage, computer failure or malfunction, or any and all 162 | other commercial damages or losses), even if such Contributor 163 | has been advised of the possibility of such damages. 164 | 165 | 9. Accepting Warranty or Additional Liability. While redistributing 166 | the Work or Derivative Works thereof, You may choose to offer, 167 | and charge a fee for, acceptance of support, warranty, indemnity, 168 | or other liability obligations and/or rights consistent with this 169 | License. However, in accepting such obligations, You may act only 170 | on Your own behalf and on Your sole responsibility, not on behalf 171 | of any other Contributor, and only if You agree to indemnify, 172 | defend, and hold each Contributor harmless for any liability 173 | incurred by, or claims asserted against, such Contributor by reason 174 | of your accepting any such warranty or additional liability. 175 | 176 | END OF TERMS AND CONDITIONS 177 | 178 | APPENDIX: How to apply the Apache License to your work. 179 | 180 | To apply the Apache License to your work, attach the following 181 | boilerplate notice, with the fields enclosed by brackets "[]" 182 | replaced with your own identifying information. (Don't include 183 | the brackets!) The text should be enclosed in the appropriate 184 | comment syntax for the file format. We also recommend that a 185 | file or class name and description of purpose be included on the 186 | same "printed page" as the copyright notice for easier 187 | identification within third-party archives. 188 | 189 | Copyright [yyyy] [name of copyright owner] 190 | 191 | Licensed under the Apache License, Version 2.0 (the "License"); 192 | you may not use this file except in compliance with the License. 193 | You may obtain a copy of the License at 194 | 195 | http://www.apache.org/licenses/LICENSE-2.0 196 | 197 | Unless required by applicable law or agreed to in writing, software 198 | distributed under the License is distributed on an "AS IS" BASIS, 199 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 200 | See the License for the specific language governing permissions and 201 | limitations under the License. 202 | --------------------------------------------------------------------------------