Simulated annealing: Difference between revisions

--

-- The Rosetta Code simulated annealing task in Ada.

end simanneal;

Some might notice the calculations of random integers are done in a way that may introduce a bias, which is miniscule as long as the integer is much smaller than 2 to the 31st power. I mention this now so no one will complain about it later.

#include <stdio.h>

#include <stdlib.h>

return 0;

{{out}}

=={{header|C++}}==

'''Compiler:''' [[MSVC]] (19.27.29111 for x64)

#include<array>

#include<utility>

return 0;

}

{{out}}

<pre>

=={{header|EchoLisp}}==

(lib 'math)

;; distances

(printf "E(s_final) %d" Emin)

(writeln 'Path s))

{{out}}

<pre>

implicit none

write (*, 10)

=={{header|Go}}==

{{trans|zkl}}

import (

func main() {

sa(1e6, 1)

{{out}}

link random

}

return path

{{out}}

Implementation:

satsp=:4 :0

end.

0,s,0

Notes:

Sample run:

0 1 538.409

100000 0.9 174.525

900000 0.1 101.657

1e6 0 101.657

=={{header|Julia}}==

'''Module''':

using Random, Printf

end

'''Main''':

const _citydist = collect(distance((ci % 10, ci ÷ 10), (cj % 10, cj ÷ 10)) for ci in 1:100, cj in 1:100)

{{out}}

=={{header|Nim}}==

const

echo fmt"path: {s}"

Compile and run: <pre>nim c -r -d:release --opt:speed travel_sa.nim</pre>

=={{header|Perl}}==

{{trans|Raku}}

use strict;

use warnings;

printf "@{['%4d' x 20]}\n", @s[$l*20 .. ($l+1)*20 - 1];

}

{{out}}

<pre>k: 0 T: 1.0 Es: 519.2

=={{header|Phix}}==

{{trans|zkl}}

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #008080;">function</span> <span style="color: #000000;">hypot</span><span style="color: #0000FF;">(</span><span style="color: #004080;">atom</span> <span style="color: #000000;">a</span><span style="color: #0000FF;">,</span><span style="color: #000000;">b</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">return</span> <span style="color: #7060A8;">sqrt</span><span style="color: #0000FF;">(</span><span style="color: #000000;">a</span><span style="color: #0000FF;">*</span><span style="color: #000000;">a</span><span style="color: #0000FF;">+</span><span style="color: #000000;">b</span><span style="color: #0000FF;">*</span><span style="color: #000000;">b</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">end</span> <span style="color: #008080;">function</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">procedure</span>

<span style="color: #000000;">sa</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1_000_000</span><span style="color: #0000FF;">,</span><span style="color: #000000;">1</span><span style="color: #0000FF;">)</span>

{{out}}

<pre>

=={{header|Racket}}==

#lang racket

(require racket/fixnum)

(module+ main

{{out}}

<pre>T:1 E:552.4249706051347

(formerly Perl 6)

{{trans|Go}}

my \cities = 100; # number of cities

my \kmax = 1e6; # iterations to run

say "\nE(s_final): " ~ E-min-global.fmt('%.1f');

{{out}}

<pre>k: 0 T: 1.0 Es: 522.0

# The Rosetta Code simulated annealing task, in Ratfor 77.

#

write (*, 60) pthlen (path)

write (*, 10)

{{out}}

(r7rs)

(chicken (import r7rs)))

(display (path-length s-final))

(newline)))

{{out}}

(r7rs)

(chicken (import r7rs)))

(format #t "Final E(s): ~,5F~%" (E_s s-final))

(format #t "Final path length: ~,5F~%" (path-length s-final))

=={{header|Sidef}}==

{{trans|Julia}}

# Eₛ: length(path)

}.map(1..100)

{{out}}

{{libheader|Wren-math}}

{{libheader|Wren-fmt}}

import "/math" for Math

import "/fmt" for Fmt

}

{{out}}

=={{header|zkl}}==

{{trans|EchoLisp}}

ab,cd,a,b,c,d:=abcd/100, abcd%100, ab/10,ab%10, cd/10,cd%10;

(a-c).toFloat().hypot(b-d)

println("E(s_final) %f".fmt(Emin));

println("Path: ",s.toString(*));

{{out}}

<pre>