new_sp=1000_output_sa.txt

Filename: vrp-2-1-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 1, 2, 0]
Optimal cost: 637
Time taken: 0.06811833381652832 seconds
Error: 

--------------------------------------------------
Filename: vrp-2-1-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 1, 2, 0]
Optimal cost: 637
Time taken: 0.06143760681152344 seconds
Error: 

--------------------------------------------------
Filename: vrp-2-1-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 1, 2, 0]
Optimal cost: 637
Time taken: 0.062170982360839844 seconds
Error: 

--------------------------------------------------
Filename: vrp-2-1-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 1, 2, 0]
Optimal cost: 637
Time taken: 0.06337523460388184 seconds
Error: 

--------------------------------------------------
Filename: vrp-2-1-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 1, 2, 0]
Optimal cost: 637
Time taken: 0.06263613700866699 seconds
Error: 

--------------------------------------------------
Filename: vrp-2-1-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 1, 2, 0]
Optimal cost: 637
Time taken: 0.06168985366821289 seconds
Error: 

--------------------------------------------------
Filename: vrp-3-1-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 3, 1, 2, 0]
Optimal cost: 1096
Time taken: 0.0565028190612793 seconds
Error: 

--------------------------------------------------
Filename: vrp-3-1-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 3, 1, 2, 0]
Optimal cost: 1096
Time taken: 0.04053497314453125 seconds
Error: 

--------------------------------------------------
Filename: vrp-3-1-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 3, 1, 2, 0]
Optimal cost: 1096
Time taken: 0.05306720733642578 seconds
Error: 

--------------------------------------------------
Filename: vrp-3-1-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 3, 1, 2, 0]
Optimal cost: 1096
Time taken: 0.045603275299072266 seconds
Error: 

--------------------------------------------------
Filename: vrp-3-1-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 3, 1, 2, 0]
Optimal cost: 1096
Time taken: 0.0791780948638916 seconds
Error: 

--------------------------------------------------
Filename: vrp-3-1-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 3, 1, 2, 0]
Optimal cost: 1096
Time taken: 0.04384303092956543 seconds
Error: 

--------------------------------------------------
Filename: vrp-3-2-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 1, 0]
[0, 2, 3, 0]
Optimal cost: 1442
Time taken: 0.08425068855285645 seconds
Error: 

--------------------------------------------------
Filename: vrp-3-2-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 1, 0]
[0, 2, 3, 0]
Optimal cost: 1442
Time taken: 0.07299590110778809 seconds
Error: 

--------------------------------------------------
Filename: vrp-3-2-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 1, 0]
[0, 2, 3, 0]
Optimal cost: 1442
Time taken: 0.08609151840209961 seconds
Error: 

--------------------------------------------------
Filename: vrp-3-2-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 1, 0]
[0, 2, 3, 0]
Optimal cost: 1442
Time taken: 0.0668478012084961 seconds
Error: 

--------------------------------------------------
Filename: vrp-3-2-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 1, 0]
[0, 2, 3, 0]
Optimal cost: 1442
Time taken: 0.10221195220947266 seconds
Error: 

--------------------------------------------------
Filename: vrp-3-2-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 1, 0]
[0, 2, 3, 0]
Optimal cost: 1442
Time taken: 0.08123445510864258 seconds
Error: 

--------------------------------------------------
Filename: vrp-4-3-3.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 2, 0]
[0, 3, 0]
[0, 1, 4, 0]
Optimal cost: 2241
Time taken: 0.0697331428527832 seconds
Error: 

--------------------------------------------------
Filename: vrp-4-3-3.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 1, 4, 0]
[0, 2, 0]
[0, 3, 0]
Optimal cost: 2241
Time taken: 0.07019472122192383 seconds
Error: 

--------------------------------------------------
Filename: vrp-4-3-3.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 3, 0]
[0, 2, 0]
[0, 1, 4, 0]
Optimal cost: 2241
Time taken: 0.07289433479309082 seconds
Error: 

--------------------------------------------------
Filename: vrp-4-3-3.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 1, 4, 0]
[0, 3, 0]
[0, 2, 0]
Optimal cost: 2241
Time taken: 0.07613539695739746 seconds
Error: 

--------------------------------------------------
Filename: vrp-4-3-3.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 3, 0]
[0, 1, 4, 0]
[0, 2, 0]
Optimal cost: 2241
Time taken: 0.07373356819152832 seconds
Error: 

--------------------------------------------------
Filename: vrp-4-3-3.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 3, 0]
[0, 1, 4, 0]
[0, 2, 0]
Optimal cost: 2241
Time taken: 0.07774138450622559 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-4-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 1, 0]
[0, 3, 0]
[0, 4, 0]
[0, 5, 2, 0]
Optimal cost: 2871
Time taken: 0.07848930358886719 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-4-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 1, 0]
[0, 3, 0]
[0, 4, 0]
[0, 5, 2, 0]
Optimal cost: 2871
Time taken: 0.09265708923339844 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-4-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 1, 0]
[0, 3, 0]
[0, 4, 0]
[0, 5, 2, 0]
Optimal cost: 2871
Time taken: 0.07935333251953125 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-4-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 1, 0]
[0, 3, 0]
[0, 4, 0]
[0, 5, 2, 0]
Optimal cost: 2871
Time taken: 0.11529397964477539 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-4-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 1, 0]
[0, 3, 0]
[0, 4, 0]
[0, 5, 2, 0]
Optimal cost: 2871
Time taken: 0.07532167434692383 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-4-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 1, 0]
[0, 3, 0]
[0, 4, 0]
[0, 5, 2, 0]
Optimal cost: 2871
Time taken: 0.07014608383178711 seconds
Error: 

--------------------------------------------------
Filename: vrp-4-1-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 3, 4, 2, 1, 0]
Optimal cost: 1003
Time taken: 0.07949948310852051 seconds
Error: 

--------------------------------------------------
Filename: vrp-4-1-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 3, 4, 2, 1, 0]
Optimal cost: 1003
Time taken: 0.07690715789794922 seconds
Error: 

--------------------------------------------------
Filename: vrp-4-1-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 3, 4, 2, 1, 0]
Optimal cost: 1003
Time taken: 0.06701016426086426 seconds
Error: 

--------------------------------------------------
Filename: vrp-4-1-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 3, 4, 2, 1, 0]
Optimal cost: 1003
Time taken: 0.06691408157348633 seconds
Error: 

--------------------------------------------------
Filename: vrp-4-1-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 3, 4, 2, 1, 0]
Optimal cost: 1003
Time taken: 0.08227801322937012 seconds
Error: 

--------------------------------------------------
Filename: vrp-4-1-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 3, 4, 2, 1, 0]
Optimal cost: 1003
Time taken: 0.08502674102783203 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-5-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 1, 0]
[0, 2, 0]
[0, 3, 0]
[0, 6, 0]
[0, 4, 5, 0]
Optimal cost: 1462
Time taken: 0.09496855735778809 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-5-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 1, 0]
[0, 2, 0]
[0, 3, 0]
[0, 6, 0]
[0, 4, 5, 0]
Optimal cost: 1462
Time taken: 0.0901181697845459 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-5-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 1, 0]
[0, 2, 0]
[0, 3, 0]
[0, 6, 0]
[0, 4, 5, 0]
Optimal cost: 1462
Time taken: 0.09012293815612793 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-5-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 1, 0]
[0, 2, 0]
[0, 3, 0]
[0, 6, 0]
[0, 4, 5, 0]
Optimal cost: 1462
Time taken: 0.07321429252624512 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-5-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 1, 0]
[0, 2, 0]
[0, 3, 0]
[0, 6, 0]
[0, 4, 5, 0]
Optimal cost: 1462
Time taken: 0.07686638832092285 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-5-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 1, 0]
[0, 2, 0]
[0, 3, 0]
[0, 6, 0]
[0, 4, 5, 0]
Optimal cost: 1462
Time taken: 0.0748906135559082 seconds
Error: 

--------------------------------------------------
Filename: vrp-4-2-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 1, 0]
[0, 4, 2, 3, 0]
Optimal cost: 1766
Time taken: 0.06733536720275879 seconds
Error: 

--------------------------------------------------
Filename: vrp-4-2-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 1, 0]
[0, 4, 2, 3, 0]
Optimal cost: 1766
Time taken: 0.06742358207702637 seconds
Error: 

--------------------------------------------------
Filename: vrp-4-2-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 4, 2, 3, 0]
[0, 1, 0]
Optimal cost: 1766
Time taken: 0.0672752857208252 seconds
Error: 

--------------------------------------------------
Filename: vrp-4-2-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 4, 2, 3, 0]
[0, 1, 0]
Optimal cost: 1766
Time taken: 0.08325958251953125 seconds
Error: 

--------------------------------------------------
Filename: vrp-4-2-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 4, 2, 3, 0]
[0, 1, 0]
Optimal cost: 1766
Time taken: 0.0858769416809082 seconds
Error: 

--------------------------------------------------
Filename: vrp-4-2-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 4, 2, 3, 0]
[0, 1, 0]
Optimal cost: 1766
Time taken: 0.08681535720825195 seconds
Error: 

--------------------------------------------------
Filename: vrp-7-6-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 1, 0]
[0, 2, 0]
[0, 3, 0]
[0, 4, 0]
[0, 7, 0]
[0, 5, 6, 0]
Optimal cost: 2925
Time taken: 0.1020963191986084 seconds
Error: 

--------------------------------------------------
Filename: vrp-7-6-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 1, 0]
[0, 2, 0]
[0, 3, 0]
[0, 4, 0]
[0, 7, 0]
[0, 5, 6, 0]
Optimal cost: 2925
Time taken: 0.10036683082580566 seconds
Error: 

--------------------------------------------------
Filename: vrp-7-6-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 1, 0]
[0, 2, 0]
[0, 3, 0]
[0, 4, 0]
[0, 7, 0]
[0, 5, 6, 0]
Optimal cost: 2925
Time taken: 0.10074210166931152 seconds
Error: 

--------------------------------------------------
Filename: vrp-7-6-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 1, 0]
[0, 2, 0]
[0, 3, 0]
[0, 4, 0]
[0, 7, 0]
[0, 5, 6, 0]
Optimal cost: 2925
Time taken: 0.09981107711791992 seconds
Error: 

--------------------------------------------------
Filename: vrp-7-6-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 1, 0]
[0, 2, 0]
[0, 3, 0]
[0, 4, 0]
[0, 7, 0]
[0, 5, 6, 0]
Optimal cost: 2925
Time taken: 0.09825992584228516 seconds
Error: 

--------------------------------------------------
Filename: vrp-7-6-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 1, 0]
[0, 2, 0]
[0, 3, 0]
[0, 4, 0]
[0, 7, 0]
[0, 5, 6, 0]
Optimal cost: 2925
Time taken: 0.10223174095153809 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-7-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 1, 0]
[0, 3, 0]
[0, 4, 0]
[0, 5, 0]
[0, 7, 0]
[0, 8, 0]
[0, 2, 6, 0]
Optimal cost: 3241
Time taken: 0.09924197196960449 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-7-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 1, 0]
[0, 3, 0]
[0, 4, 0]
[0, 5, 0]
[0, 7, 0]
[0, 8, 0]
[0, 2, 6, 0]
Optimal cost: 3241
Time taken: 0.08566093444824219 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-7-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 1, 0]
[0, 3, 0]
[0, 4, 0]
[0, 5, 0]
[0, 7, 0]
[0, 8, 0]
[0, 2, 6, 0]
Optimal cost: 3241
Time taken: 0.1038358211517334 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-7-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 1, 0]
[0, 3, 0]
[0, 4, 0]
[0, 5, 0]
[0, 7, 0]
[0, 8, 0]
[0, 2, 6, 0]
Optimal cost: 3241
Time taken: 0.088104248046875 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-7-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 1, 0]
[0, 3, 0]
[0, 4, 0]
[0, 5, 0]
[0, 7, 0]
[0, 8, 0]
[0, 2, 6, 0]
Optimal cost: 3241
Time taken: 0.10714197158813477 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-7-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 1, 0]
[0, 3, 0]
[0, 4, 0]
[0, 5, 0]
[0, 7, 0]
[0, 8, 0]
[0, 2, 6, 0]
Optimal cost: 3241
Time taken: 0.1029517650604248 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-3-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 4, 0]
[0, 2, 5, 1, 0]
[0, 3, 0]
Optimal cost: 1943
Time taken: 0.08807158470153809 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-3-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 3, 0]
[0, 2, 5, 1, 0]
[0, 4, 0]
Optimal cost: 1943
Time taken: 0.08248662948608398 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-3-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 3, 0]
[0, 4, 0]
[0, 2, 5, 1, 0]
Optimal cost: 1943
Time taken: 0.06977343559265137 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-3-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 3, 0]
[0, 4, 0]
[0, 2, 5, 1, 0]
Optimal cost: 1943
Time taken: 0.07058358192443848 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-3-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 3, 0]
[0, 4, 5, 1, 0]
[0, 2, 0]
Optimal cost: 2007
Time taken: 0.08128714561462402 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-3-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 3, 0]
[0, 2, 5, 1, 0]
[0, 4, 0]
Optimal cost: 1943
Time taken: 0.06868195533752441 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-1-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 1, 5, 2, 4, 3, 0]
Optimal cost: 1260
Time taken: 0.08375978469848633 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-1-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 1, 5, 2, 4, 3, 0]
Optimal cost: 1260
Time taken: 0.0905008316040039 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-1-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 1, 5, 2, 4, 3, 0]
Optimal cost: 1260
Time taken: 0.08536815643310547 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-1-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 1, 5, 2, 4, 3, 0]
Optimal cost: 1260
Time taken: 0.09263777732849121 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-1-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 1, 5, 2, 4, 3, 0]
Optimal cost: 1260
Time taken: 0.0823204517364502 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-1-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 1, 5, 2, 4, 3, 0]
Optimal cost: 1260
Time taken: 0.09101033210754395 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-8-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 3, 0]
[0, 7, 10, 1, 0]
[0, 5, 0]
[0, 8, 0]
[0, 4, 0]
[0, 9, 0]
[0, 2, 0]
[0, 6, 0]
Optimal cost: 4745
Time taken: 0.11676549911499023 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-8-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 3, 0]
[0, 4, 0]
[0, 5, 0]
[0, 2, 0]
[0, 8, 0]
[0, 7, 10, 0]
[0, 6, 1, 0]
[0, 9, 0]
Optimal cost: 4691
Time taken: 0.13075947761535645 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-8-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 3, 0]
[0, 4, 0]
[0, 5, 0]
[0, 6, 1, 0]
[0, 2, 0]
[0, 7, 10, 0]
[0, 8, 0]
[0, 9, 0]
Optimal cost: 4691
Time taken: 0.1417229175567627 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-8-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 3, 0]
[0, 4, 0]
[0, 5, 0]
[0, 2, 0]
[0, 6, 1, 0]
[0, 9, 0]
[0, 8, 0]
[0, 7, 10, 0]
Optimal cost: 4691
Time taken: 0.12226057052612305 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-8-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 9, 0]
[0, 2, 0]
[0, 5, 0]
[0, 6, 1, 0]
[0, 4, 0]
[0, 7, 10, 0]
[0, 3, 0]
[0, 8, 0]
Optimal cost: 4691
Time taken: 0.13946795463562012 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-8-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 3, 0]
[0, 4, 0]
[0, 5, 0]
[0, 2, 0]
[0, 9, 0]
[0, 6, 1, 0]
[0, 8, 0]
[0, 7, 10, 0]
Optimal cost: 4691
Time taken: 0.1335151195526123 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-2-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 4, 5, 0]
[0, 3, 2, 1, 0]
Optimal cost: 1409
Time taken: 0.09084558486938477 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-2-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 3, 2, 1, 0]
[0, 4, 5, 0]
Optimal cost: 1409
Time taken: 0.07859063148498535 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-2-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 4, 5, 0]
[0, 3, 2, 1, 0]
Optimal cost: 1409
Time taken: 0.11365127563476562 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-2-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 4, 5, 0]
[0, 3, 2, 1, 0]
Optimal cost: 1409
Time taken: 0.07972931861877441 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-2-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 3, 2, 1, 0]
[0, 4, 5, 0]
Optimal cost: 1409
Time taken: 0.09328389167785645 seconds
Error: 

--------------------------------------------------
Filename: vrp-5-2-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 3, 2, 1, 0]
[0, 4, 5, 0]
Optimal cost: 1409
Time taken: 0.09230208396911621 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-4-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 2, 0]
[0, 5, 0]
[0, 6, 0]
[0, 1, 4, 3, 0]
Optimal cost: 1747
Time taken: 0.07703471183776855 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-4-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 2, 0]
[0, 5, 0]
[0, 6, 0]
[0, 1, 4, 3, 0]
Optimal cost: 1747
Time taken: 0.07645082473754883 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-4-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 2, 0]
[0, 5, 0]
[0, 6, 0]
[0, 1, 4, 3, 0]
Optimal cost: 1747
Time taken: 0.08825349807739258 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-4-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 2, 0]
[0, 5, 0]
[0, 6, 0]
[0, 1, 4, 3, 0]
Optimal cost: 1747
Time taken: 0.12016820907592773 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-4-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 2, 0]
[0, 5, 0]
[0, 6, 0]
[0, 1, 4, 3, 0]
Optimal cost: 1747
Time taken: 0.09625625610351562 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-4-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 2, 0]
[0, 5, 0]
[0, 6, 0]
[0, 1, 4, 3, 0]
Optimal cost: 1747
Time taken: 0.09161210060119629 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-1-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 4, 2, 3, 6, 5, 1, 0]
Optimal cost: 1405
Time taken: 0.08204174041748047 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-1-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 4, 2, 3, 6, 5, 1, 0]
Optimal cost: 1405
Time taken: 0.0717003345489502 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-1-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 4, 2, 3, 6, 5, 1, 0]
Optimal cost: 1405
Time taken: 0.09264111518859863 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-1-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 4, 2, 3, 6, 5, 1, 0]
Optimal cost: 1405
Time taken: 0.09330248832702637 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-1-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 4, 2, 3, 6, 5, 1, 0]
Optimal cost: 1405
Time taken: 0.0823523998260498 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-1-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 4, 2, 3, 6, 5, 1, 0]
Optimal cost: 1405
Time taken: 0.09526658058166504 seconds
Error: 

--------------------------------------------------
Filename: vrp-7-5-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 2, 0]
[0, 4, 0]
[0, 5, 0]
[0, 6, 0]
[0, 3, 1, 7, 0]
Optimal cost: 1797
Time taken: 0.09786462783813477 seconds
Error: 

--------------------------------------------------
Filename: vrp-7-5-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 2, 0]
[0, 4, 0]
[0, 5, 0]
[0, 6, 0]
[0, 3, 1, 7, 0]
Optimal cost: 1797
Time taken: 0.10504937171936035 seconds
Error: 

--------------------------------------------------
Filename: vrp-7-5-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 2, 0]
[0, 4, 0]
[0, 5, 0]
[0, 6, 0]
[0, 3, 1, 7, 0]
Optimal cost: 1797
Time taken: 0.1014258861541748 seconds
Error: 

--------------------------------------------------
Filename: vrp-7-5-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 2, 0]
[0, 4, 0]
[0, 5, 0]
[0, 6, 0]
[0, 3, 1, 7, 0]
Optimal cost: 1797
Time taken: 0.10187339782714844 seconds
Error: 

--------------------------------------------------
Filename: vrp-7-5-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 2, 0]
[0, 4, 0]
[0, 5, 0]
[0, 6, 0]
[0, 3, 1, 7, 0]
Optimal cost: 1797
Time taken: 0.09999895095825195 seconds
Error: 

--------------------------------------------------
Filename: vrp-7-5-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 2, 0]
[0, 4, 0]
[0, 5, 0]
[0, 6, 0]
[0, 3, 1, 7, 0]
Optimal cost: 1797
Time taken: 0.10220551490783691 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-6-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 2, 0]
[0, 4, 0]
[0, 5, 0]
[0, 6, 0]
[0, 8, 0]
[0, 3, 1, 7, 0]
Optimal cost: 2005
Time taken: 0.10559391975402832 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-6-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 2, 0]
[0, 4, 0]
[0, 5, 0]
[0, 6, 0]
[0, 8, 0]
[0, 3, 1, 7, 0]
Optimal cost: 2005
Time taken: 0.10358548164367676 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-6-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 2, 0]
[0, 4, 0]
[0, 5, 0]
[0, 6, 0]
[0, 8, 0]
[0, 3, 1, 7, 0]
Optimal cost: 2005
Time taken: 0.10541796684265137 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-6-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 2, 0]
[0, 4, 0]
[0, 5, 0]
[0, 6, 0]
[0, 8, 0]
[0, 3, 1, 7, 0]
Optimal cost: 2005
Time taken: 0.10830426216125488 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-6-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 2, 0]
[0, 4, 0]
[0, 5, 0]
[0, 6, 0]
[0, 8, 0]
[0, 3, 1, 7, 0]
Optimal cost: 2005
Time taken: 0.10727643966674805 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-6-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 2, 0]
[0, 4, 0]
[0, 5, 0]
[0, 6, 0]
[0, 8, 0]
[0, 3, 1, 7, 0]
Optimal cost: 2005
Time taken: 0.08633184432983398 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-2-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 3, 6, 1, 0]
[0, 2, 5, 4, 0]
Optimal cost: 1320
Time taken: 0.09863448143005371 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-2-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 3, 6, 1, 0]
[0, 2, 5, 4, 0]
Optimal cost: 1320
Time taken: 0.07576704025268555 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-2-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 3, 6, 1, 0]
[0, 2, 5, 4, 0]
Optimal cost: 1320
Time taken: 0.0786447525024414 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-2-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 3, 6, 1, 0]
[0, 2, 5, 4, 0]
Optimal cost: 1320
Time taken: 0.09922647476196289 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-2-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 3, 6, 1, 0]
[0, 2, 5, 4, 0]
Optimal cost: 1320
Time taken: 0.08539032936096191 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-2-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 3, 6, 1, 0]
[0, 2, 5, 4, 0]
Optimal cost: 1320
Time taken: 0.07864785194396973 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-7-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 2, 0]
[0, 3, 0]
[0, 5, 0]
[0, 6, 0]
[0, 10, 0]
[0, 8, 9, 0]
[0, 4, 7, 1, 0]
Optimal cost: 2964
Time taken: 0.09608936309814453 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-7-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 2, 0]
[0, 3, 0]
[0, 5, 0]
[0, 6, 0]
[0, 10, 0]
[0, 8, 9, 0]
[0, 4, 7, 1, 0]
Optimal cost: 2964
Time taken: 0.09652280807495117 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-7-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 2, 0]
[0, 3, 0]
[0, 5, 0]
[0, 6, 0]
[0, 10, 0]
[0, 8, 9, 0]
[0, 4, 7, 1, 0]
Optimal cost: 2964
Time taken: 0.09835386276245117 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-7-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 2, 0]
[0, 3, 0]
[0, 5, 0]
[0, 6, 0]
[0, 10, 0]
[0, 8, 9, 0]
[0, 4, 7, 1, 0]
Optimal cost: 2964
Time taken: 0.09917068481445312 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-7-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 2, 0]
[0, 3, 0]
[0, 5, 0]
[0, 6, 0]
[0, 10, 0]
[0, 8, 9, 0]
[0, 4, 7, 1, 0]
Optimal cost: 2964
Time taken: 0.11667490005493164 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-7-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 2, 0]
[0, 3, 0]
[0, 5, 0]
[0, 6, 0]
[0, 10, 0]
[0, 8, 9, 0]
[0, 4, 7, 1, 0]
Optimal cost: 2964
Time taken: 0.11539220809936523 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-5-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 3, 0]
[0, 6, 0]
[0, 8, 0]
[0, 4, 5, 7, 0]
[0, 1, 2, 0]
Optimal cost: 1777
Time taken: 0.1334702968597412 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-5-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 3, 0]
[0, 6, 0]
[0, 8, 0]
[0, 4, 5, 7, 0]
[0, 1, 2, 0]
Optimal cost: 1777
Time taken: 0.10633563995361328 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-5-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 3, 0]
[0, 6, 0]
[0, 8, 0]
[0, 4, 5, 7, 0]
[0, 1, 2, 0]
Optimal cost: 1777
Time taken: 0.08863353729248047 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-5-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 3, 0]
[0, 6, 0]
[0, 8, 0]
[0, 4, 5, 7, 0]
[0, 1, 2, 0]
Optimal cost: 1777
Time taken: 0.10604619979858398 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-5-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 3, 0]
[0, 6, 0]
[0, 8, 0]
[0, 4, 5, 7, 0]
[0, 1, 2, 0]
Optimal cost: 1777
Time taken: 0.0971829891204834 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-5-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 3, 0]
[0, 6, 0]
[0, 8, 0]
[0, 4, 5, 7, 0]
[0, 1, 2, 0]
Optimal cost: 1777
Time taken: 0.09010195732116699 seconds
Error: 

--------------------------------------------------
Filename: vrp-7-4-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 4, 0]
[0, 5, 7, 0]
[0, 3, 6, 0]
[0, 1, 2, 0]
Optimal cost: 1206
Time taken: 0.09119153022766113 seconds
Error: 

--------------------------------------------------
Filename: vrp-7-4-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 7, 2, 0]
[0, 5, 3, 6, 0]
[0, 4, 0]
[0, 1, 0]
Optimal cost: 1173
Time taken: 0.09302449226379395 seconds
Error: 

--------------------------------------------------
Filename: vrp-7-4-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 4, 0]
[0, 7, 0]
[0, 1, 2, 0]
[0, 5, 3, 6, 0]
Optimal cost: 1079
Time taken: 0.09356021881103516 seconds
Error: 

--------------------------------------------------
Filename: vrp-7-4-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 3, 6, 0]
[0, 5, 0]
[0, 7, 0]
[0, 1, 2, 4, 0]
Optimal cost: 1289
Time taken: 0.08663368225097656 seconds
Error: 

--------------------------------------------------
Filename: vrp-7-4-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 3, 6, 0]
[0, 5, 7, 0]
[0, 1, 2, 0]
[0, 4, 0]
Optimal cost: 1206
Time taken: 0.08403611183166504 seconds
Error: 

--------------------------------------------------
Filename: vrp-7-4-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 7, 0]
[0, 4, 0]
[0, 5, 3, 6, 0]
[0, 1, 2, 0]
Optimal cost: 1079
Time taken: 0.08855628967285156 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-3-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 2, 0]
[0, 3, 0]
[0, 6, 4, 5, 1, 0]
Optimal cost: 890
Time taken: 0.07342338562011719 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-3-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 2, 0]
[0, 3, 0]
[0, 6, 4, 5, 1, 0]
Optimal cost: 890
Time taken: 0.0727996826171875 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-3-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 2, 0]
[0, 3, 0]
[0, 6, 4, 5, 1, 0]
Optimal cost: 890
Time taken: 0.07416057586669922 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-3-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 2, 0]
[0, 3, 0]
[0, 6, 4, 5, 1, 0]
Optimal cost: 890
Time taken: 0.08594512939453125 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-3-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 2, 0]
[0, 3, 0]
[0, 6, 4, 5, 1, 0]
Optimal cost: 890
Time taken: 0.08917903900146484 seconds
Error: 

--------------------------------------------------
Filename: vrp-6-3-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 2, 0]
[0, 3, 0]
[0, 6, 4, 5, 1, 0]
Optimal cost: 890
Time taken: 0.08912348747253418 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-1-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 5, 6, 1, 8, 3, 2, 7, 4, 0]
Optimal cost: 762
Time taken: 0.09794282913208008 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-1-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 5, 6, 1, 8, 3, 2, 7, 4, 0]
Optimal cost: 762
Time taken: 0.10338521003723145 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-1-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 5, 6, 1, 8, 3, 2, 7, 4, 0]
Optimal cost: 762
Time taken: 0.10018301010131836 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-1-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 5, 6, 1, 8, 3, 2, 7, 4, 0]
Optimal cost: 762
Time taken: 0.10097765922546387 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-1-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 5, 6, 1, 8, 3, 2, 7, 4, 0]
Optimal cost: 762
Time taken: 0.09847021102905273 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-1-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 5, 6, 1, 8, 3, 2, 7, 4, 0]
Optimal cost: 762
Time taken: 0.10301446914672852 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-4-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 2, 3, 0]
[0, 5, 0]
[0, 8, 0]
[0, 7, 6, 4, 1, 0]
Optimal cost: 876
Time taken: 0.10630202293395996 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-4-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 5, 0]
[0, 2, 3, 0]
[0, 7, 6, 4, 1, 0]
[0, 8, 0]
Optimal cost: 876
Time taken: 0.10739469528198242 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-4-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 2, 0]
[0, 5, 4, 3, 0]
[0, 8, 0]
[0, 7, 6, 1, 0]
Optimal cost: 1090
Time taken: 0.10748434066772461 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-4-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 5, 0]
[0, 2, 3, 0]
[0, 8, 0]
[0, 7, 6, 4, 1, 0]
Optimal cost: 876
Time taken: 0.10365939140319824 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-4-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 2, 0]
[0, 5, 0]
[0, 8, 3, 0]
[0, 7, 6, 4, 1, 0]
Optimal cost: 950
Time taken: 0.09491276741027832 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-4-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 7, 6, 0]
[0, 2, 3, 0]
[0, 8, 0]
[0, 5, 4, 1, 0]
Optimal cost: 915
Time taken: 0.10642504692077637 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-6-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 5, 0]
[0, 4, 0]
[0, 1, 0]
[0, 7, 0]
[0, 8, 6, 2, 9, 3, 0]
[0, 10, 0]
Optimal cost: 2159
Time taken: 0.1055598258972168 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-6-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 10, 0]
[0, 8, 6, 2, 9, 3, 0]
[0, 7, 0]
[0, 1, 0]
[0, 4, 0]
[0, 5, 0]
Optimal cost: 2159
Time taken: 0.11486339569091797 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-6-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 7, 0]
[0, 4, 0]
[0, 10, 0]
[0, 3, 9, 2, 6, 8, 0]
[0, 1, 0]
[0, 5, 0]
Optimal cost: 2159
Time taken: 0.1139993667602539 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-6-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 1, 0]
[0, 4, 0]
[0, 5, 0]
[0, 7, 0]
[0, 10, 0]
[0, 8, 6, 2, 9, 3, 0]
Optimal cost: 2159
Time taken: 0.09594368934631348 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-6-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 1, 0]
[0, 4, 0]
[0, 8, 6, 2, 9, 3, 0]
[0, 5, 0]
[0, 10, 0]
[0, 7, 0]
Optimal cost: 2159
Time taken: 0.0983734130859375 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-6-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 1, 0]
[0, 4, 0]
[0, 5, 0]
[0, 7, 0]
[0, 10, 0]
[0, 3, 8, 6, 2, 9, 0]
Optimal cost: 2178
Time taken: 0.09592056274414062 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-3-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 7, 0]
[0, 4, 1, 0]
[0, 3, 2, 6, 8, 5, 0]
Optimal cost: 1636
Time taken: 0.09000420570373535 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-3-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 4, 1, 0]
[0, 7, 0]
[0, 3, 2, 6, 8, 5, 0]
Optimal cost: 1636
Time taken: 0.10662317276000977 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-3-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 7, 0]
[0, 5, 8, 6, 2, 3, 0]
[0, 1, 4, 0]
Optimal cost: 1636
Time taken: 0.10515522956848145 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-3-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 5, 8, 6, 2, 3, 0]
[0, 1, 4, 0]
[0, 7, 0]
Optimal cost: 1636
Time taken: 0.10790681838989258 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-3-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 7, 0]
[0, 1, 4, 0]
[0, 3, 2, 6, 8, 5, 0]
Optimal cost: 1636
Time taken: 0.10553789138793945 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-3-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 7, 0]
[0, 3, 2, 6, 8, 5, 0]
[0, 1, 4, 0]
Optimal cost: 1636
Time taken: 0.14346909523010254 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-2-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 7, 6, 2, 3, 0]
[0, 8, 5, 4, 1, 0]
Optimal cost: 588
Time taken: 0.1339552402496338 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-2-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 5, 7, 8, 3, 0]
[0, 2, 6, 4, 1, 0]
Optimal cost: 482
Time taken: 0.10757970809936523 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-2-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 2, 7, 6, 5, 4, 1, 0]
[0, 8, 3, 0]
Optimal cost: 500
Time taken: 0.09833788871765137 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-2-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 8, 3, 0]
[0, 2, 5, 7, 6, 4, 1, 0]
Optimal cost: 486
Time taken: 0.10165119171142578 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-2-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 8, 3, 0]
[0, 2, 5, 7, 6, 4, 1, 0]
Optimal cost: 486
Time taken: 0.0993959903717041 seconds
Error: 

--------------------------------------------------
Filename: vrp-8-2-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 5, 7, 8, 3, 0]
[0, 2, 6, 4, 1, 0]
Optimal cost: 482
Time taken: 0.09889721870422363 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-5-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 5, 3, 0]
[0, 7, 0]
[0, 6, 10, 1, 0]
[0, 4, 8, 0]
[0, 9, 2, 0]
Optimal cost: 1627
Time taken: 0.11525774002075195 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-5-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 4, 1, 2, 8, 0]
[0, 10, 5, 3, 0]
[0, 6, 0]
[0, 9, 0]
[0, 7, 0]
Optimal cost: 2156
Time taken: 0.11362624168395996 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-5-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 4, 8, 0]
[0, 6, 10, 1, 0]
[0, 7, 2, 0]
[0, 9, 0]
[0, 5, 3, 0]
Optimal cost: 1886
Time taken: 0.11484289169311523 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-5-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 4, 0]
[0, 8, 2, 5, 3, 0]
[0, 7, 0]
[0, 9, 0]
[0, 6, 10, 1, 0]
Optimal cost: 2484
Time taken: 0.10314202308654785 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-5-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 9, 8, 0]
[0, 7, 0]
[0, 6, 0]
[0, 10, 5, 3, 0]
[0, 4, 1, 2, 0]
Optimal cost: 1731
Time taken: 0.1034843921661377 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-5-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 4, 8, 0]
[0, 7, 3, 0]
[0, 6, 0]
[0, 9, 5, 0]
[0, 10, 1, 2, 0]
Optimal cost: 1998
Time taken: 0.1172494888305664 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-1-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 5, 10, 2, 9, 4, 8, 6, 1, 3, 7, 0]
Optimal cost: 1523
Time taken: 0.10152554512023926 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-1-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 5, 10, 2, 9, 4, 8, 6, 1, 3, 7, 0]
Optimal cost: 1523
Time taken: 0.10484671592712402 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-1-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 7, 3, 1, 6, 8, 4, 9, 2, 10, 5, 0]
Optimal cost: 1523
Time taken: 0.08461642265319824 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-1-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 7, 3, 1, 6, 8, 4, 9, 2, 10, 5, 0]
Optimal cost: 1523
Time taken: 0.08415985107421875 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-1-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 6, 1, 3, 7, 5, 10, 2, 9, 4, 8, 0]
Optimal cost: 1526
Time taken: 0.0960838794708252 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-1-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 5, 10, 2, 9, 4, 8, 6, 1, 3, 7, 0]
Optimal cost: 1523
Time taken: 0.08308196067810059 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-4-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 4, 0]
[0, 10, 0]
[0, 5, 8, 0]
[0, 1, 2, 7, 6, 3, 9, 0]
Optimal cost: 1853
Time taken: 0.0946502685546875 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-4-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 4, 0]
[0, 10, 0]
[0, 5, 8, 0]
[0, 1, 2, 7, 6, 3, 9, 0]
Optimal cost: 1853
Time taken: 0.09496760368347168 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-4-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 4, 0]
[0, 10, 0]
[0, 5, 8, 0]
[0, 1, 2, 7, 6, 3, 9, 0]
Optimal cost: 1853
Time taken: 0.10860586166381836 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-4-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 4, 0]
[0, 10, 0]
[0, 5, 8, 0]
[0, 1, 2, 7, 6, 3, 9, 0]
Optimal cost: 1853
Time taken: 0.0913543701171875 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-4-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 4, 0]
[0, 10, 0]
[0, 5, 8, 0]
[0, 1, 2, 7, 6, 3, 9, 0]
Optimal cost: 1853
Time taken: 0.11039996147155762 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-4-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 4, 0]
[0, 10, 0]
[0, 5, 8, 0]
[0, 1, 2, 7, 6, 3, 9, 0]
Optimal cost: 1853
Time taken: 0.11409950256347656 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-3-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 3, 0]
[0, 2, 1, 4, 0]
[0, 8, 7, 6, 10, 5, 9, 0]
Optimal cost: 1231
Time taken: 0.13109183311462402 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-3-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 8, 7, 6, 10, 5, 4, 0]
[0, 2, 1, 0]
[0, 3, 9, 0]
Optimal cost: 1248
Time taken: 0.09330964088439941 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-3-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 5, 9, 0]
[0, 8, 7, 6, 10, 2, 1, 4, 0]
[0, 3, 0]
Optimal cost: 1232
Time taken: 0.09113931655883789 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-3-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 5, 9, 0]
[0, 8, 7, 6, 10, 2, 1, 3, 0]
[0, 4, 0]
Optimal cost: 1239
Time taken: 0.0942385196685791 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-3-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 3, 0]
[0, 5, 9, 0]
[0, 8, 7, 6, 10, 2, 1, 4, 0]
Optimal cost: 1232
Time taken: 0.09419751167297363 seconds
Error: 

--------------------------------------------------
Filename: vrp-10-3-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 5, 9, 1, 8, 7, 10, 3, 0]
[0, 4, 0]
[0, 2, 6, 0]
Optimal cost: 1290
Time taken: 0.09260678291320801 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-8-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 13, 0]
[0, 10, 0]
[0, 4, 0]
[0, 6, 15, 5, 11, 0]
[0, 14, 0]
[0, 2, 1, 9, 0]
[0, 12, 7, 8, 0]
[0, 3, 0]
Optimal cost: 2639
Time taken: 0.11531949043273926 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-8-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 3, 0]
[0, 13, 0]
[0, 4, 0]
[0, 8, 7, 12, 0]
[0, 10, 0]
[0, 2, 1, 9, 0]
[0, 14, 0]
[0, 6, 15, 5, 11, 0]
Optimal cost: 2639
Time taken: 0.11946392059326172 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-8-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 2, 1, 9, 5, 11, 15, 6, 0]
[0, 13, 0]
[0, 8, 0]
[0, 4, 0]
[0, 12, 7, 0]
[0, 14, 0]
[0, 3, 0]
[0, 10, 0]
Optimal cost: 2668
Time taken: 0.11570501327514648 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-8-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 4, 0]
[0, 10, 0]
[0, 8, 0]
[0, 3, 0]
[0, 12, 7, 0]
[0, 14, 0]
[0, 13, 0]
[0, 2, 1, 9, 5, 11, 15, 6, 0]
Optimal cost: 2668
Time taken: 0.11485171318054199 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-8-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 3, 0]
[0, 4, 0]
[0, 8, 0]
[0, 10, 0]
[0, 13, 0]
[0, 14, 0]
[0, 7, 12, 0]
[0, 11, 5, 15, 6, 9, 1, 2, 0]
Optimal cost: 2673
Time taken: 0.11752128601074219 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-8-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 3, 0]
[0, 4, 0]
[0, 8, 0]
[0, 10, 0]
[0, 13, 0]
[0, 14, 0]
[0, 7, 12, 0]
[0, 11, 5, 15, 6, 9, 1, 2, 0]
Optimal cost: 2673
Time taken: 0.11514449119567871 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-7-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 11, 6, 15, 0]
[0, 8, 0]
[0, 1, 0]
[0, 10, 0]
[0, 2, 14, 13, 3, 0]
[0, 12, 0]
[0, 9, 5, 4, 7, 0]
Optimal cost: 2010
Time taken: 0.11105751991271973 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-7-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 9, 5, 4, 15, 0]
[0, 8, 0]
[0, 11, 0]
[0, 10, 0]
[0, 13, 3, 0]
[0, 12, 0]
[0, 2, 14, 6, 1, 7, 0]
Optimal cost: 2209
Time taken: 0.10826301574707031 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-7-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 12, 0]
[0, 8, 0]
[0, 9, 6, 15, 1, 3, 0]
[0, 11, 0]
[0, 2, 14, 0]
[0, 10, 0]
[0, 13, 5, 4, 7, 0]
Optimal cost: 2539
Time taken: 0.11223292350769043 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-7-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 8, 0]
[0, 9, 0]
[0, 11, 14, 6, 15, 0]
[0, 10, 0]
[0, 12, 1, 7, 0]
[0, 13, 3, 0]
[0, 2, 4, 5, 0]
Optimal cost: 2142
Time taken: 0.1141660213470459 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-7-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 8, 14, 6, 15, 0]
[0, 2, 4, 0]
[0, 10, 0]
[0, 9, 5, 13, 3, 0]
[0, 11, 0]
[0, 1, 7, 0]
[0, 12, 0]
Optimal cost: 2492
Time taken: 0.11467480659484863 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-7-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 4, 5, 13, 3, 0]
[0, 8, 0]
[0, 9, 15, 0]
[0, 10, 0]
[0, 11, 0]
[0, 12, 0]
[0, 2, 14, 6, 1, 7, 0]
Optimal cost: 2187
Time taken: 0.11288261413574219 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-6-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 15, 0]
[0, 8, 0]
[0, 2, 0]
[0, 6, 13, 9, 12, 0]
[0, 7, 0]
[0, 5, 1, 10, 14, 4, 11, 3, 0]
Optimal cost: 2224
Time taken: 0.11176371574401855 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-6-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 2, 0]
[0, 7, 0]
[0, 8, 0]
[0, 15, 0]
[0, 6, 13, 9, 12, 0]
[0, 3, 1, 10, 14, 4, 11, 5, 0]
Optimal cost: 2272
Time taken: 0.11212420463562012 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-6-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 2, 0]
[0, 7, 0]
[0, 8, 0]
[0, 15, 0]
[0, 12, 9, 6, 13, 0]
[0, 5, 3, 1, 10, 14, 4, 11, 0]
Optimal cost: 2223
Time taken: 0.11320638656616211 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-6-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 6, 13, 9, 12, 0]
[0, 8, 0]
[0, 15, 0]
[0, 2, 0]
[0, 5, 1, 10, 3, 14, 4, 11, 0]
[0, 7, 0]
Optimal cost: 2244
Time taken: 0.11232972145080566 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-6-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 7, 0]
[0, 12, 9, 6, 13, 0]
[0, 15, 0]
[0, 5, 3, 1, 10, 14, 4, 11, 0]
[0, 2, 0]
[0, 8, 0]
Optimal cost: 2223
Time taken: 0.11042237281799316 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-6-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 8, 0]
[0, 2, 0]
[0, 15, 0]
[0, 7, 0]
[0, 11, 4, 14, 1, 10, 3, 5, 0]
[0, 12, 9, 13, 6, 0]
Optimal cost: 2244
Time taken: 0.11371493339538574 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-5-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 7, 0]
[0, 13, 0]
[0, 11, 3, 15, 12, 0]
[0, 1, 5, 9, 0]
[0, 2, 6, 4, 10, 8, 14, 0]
Optimal cost: 2826
Time taken: 0.1110236644744873 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-5-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 13, 0]
[0, 9, 5, 1, 0]
[0, 12, 15, 3, 11, 0]
[0, 7, 0]
[0, 14, 8, 2, 6, 4, 10, 0]
Optimal cost: 2803
Time taken: 0.1151430606842041 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-5-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 7, 9, 5, 1, 0]
[0, 11, 3, 15, 12, 0]
[0, 14, 0]
[0, 10, 4, 6, 2, 8, 0]
[0, 13, 0]
Optimal cost: 2817
Time taken: 0.11241340637207031 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-5-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 7, 0]
[0, 13, 0]
[0, 11, 3, 15, 12, 0]
[0, 1, 5, 9, 0]
[0, 2, 6, 4, 10, 8, 14, 0]
Optimal cost: 2826
Time taken: 0.10853862762451172 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-5-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 8, 2, 6, 4, 10, 0]
[0, 11, 3, 15, 12, 0]
[0, 13, 1, 5, 9, 0]
[0, 7, 0]
[0, 14, 0]
Optimal cost: 2808
Time taken: 0.11472487449645996 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-5-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 9, 5, 1, 0]
[0, 13, 0]
[0, 12, 15, 3, 11, 0]
[0, 7, 0]
[0, 10, 4, 6, 2, 8, 14, 0]
Optimal cost: 2803
Time taken: 0.11179018020629883 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-1-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 9, 8, 13, 2, 6, 11, 14, 3, 5, 4, 10, 12, 7, 15, 1, 0]
Optimal cost: 694
Time taken: 0.09433436393737793 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-1-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 9, 13, 2, 8, 15, 7, 6, 11, 14, 12, 10, 3, 5, 4, 1, 0]
Optimal cost: 864
Time taken: 0.09201478958129883 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-1-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 2, 5, 14, 12, 7, 15, 9, 8, 13, 11, 6, 4, 1, 10, 3, 0]
Optimal cost: 746
Time taken: 0.09414029121398926 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-1-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 2, 6, 13, 11, 14, 12, 7, 15, 5, 4, 9, 8, 1, 10, 3, 0]
Optimal cost: 874
Time taken: 0.09525609016418457 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-1-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 15, 1, 10, 12, 6, 11, 7, 8, 13, 2, 3, 5, 4, 9, 14, 0]
Optimal cost: 707
Time taken: 0.09478259086608887 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-1-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 12, 6, 11, 7, 13, 2, 5, 14, 4, 9, 8, 15, 1, 10, 3, 0]
Optimal cost: 758
Time taken: 0.09390544891357422 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-4-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 9, 3, 6, 1, 14, 8, 15, 4, 0]
[0, 11, 0]
[0, 2, 10, 12, 5, 13, 0]
[0, 7, 0]
Optimal cost: 1889
Time taken: 0.10873246192932129 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-4-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 7, 4, 15, 8, 3, 6, 14, 1, 0]
[0, 2, 10, 12, 5, 13, 0]
[0, 11, 0]
[0, 9, 0]
Optimal cost: 1879
Time taken: 0.1029500961303711 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-4-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 13, 5, 12, 10, 2, 0]
[0, 7, 1, 14, 3, 6, 8, 15, 4, 0]
[0, 11, 0]
[0, 9, 0]
Optimal cost: 1877
Time taken: 0.10695123672485352 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-4-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 5, 12, 10, 2, 0]
[0, 7, 0]
[0, 11, 0]
[0, 13, 4, 15, 8, 6, 14, 1, 3, 9, 0]
Optimal cost: 1917
Time taken: 0.10524559020996094 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-4-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 11, 0]
[0, 1, 14, 3, 6, 8, 15, 4, 7, 0]
[0, 2, 12, 10, 5, 13, 0]
[0, 9, 0]
Optimal cost: 1848
Time taken: 0.10809874534606934 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-4-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 3, 1, 14, 6, 8, 15, 4, 7, 0]
[0, 13, 5, 12, 10, 2, 0]
[0, 9, 0]
[0, 11, 0]
Optimal cost: 1849
Time taken: 0.10573911666870117 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-2-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 12, 13, 1, 4, 0]
[0, 8, 7, 11, 14, 3, 9, 2, 6, 10, 5, 15, 0]
Optimal cost: 900
Time taken: 0.10483050346374512 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-2-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 12, 8, 7, 11, 14, 3, 9, 1, 13, 2, 6, 10, 5, 15, 0]
[0, 4, 0]
Optimal cost: 629
Time taken: 0.10126399993896484 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-2-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 12, 8, 2, 6, 10, 5, 15, 0]
[0, 3, 9, 1, 13, 7, 11, 14, 4, 0]
Optimal cost: 808
Time taken: 0.1008749008178711 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-2-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 8, 7, 10, 3, 9, 1, 13, 11, 14, 4, 2, 6, 0]
[0, 12, 5, 15, 0]
Optimal cost: 1015
Time taken: 0.09929418563842773 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-2-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 12, 14, 3, 9, 1, 4, 0]
[0, 8, 7, 11, 13, 2, 6, 10, 5, 15, 0]
Optimal cost: 725
Time taken: 0.10180878639221191 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-2-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 12, 14, 9, 1, 8, 7, 3, 0]
[0, 6, 10, 5, 4, 11, 13, 2, 15, 0]
Optimal cost: 985
Time taken: 0.1012411117553711 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-3-1.txt
Algorithm: SA SP=1000.py
Run: 1
Output: Best solution:
[0, 3, 14, 12, 0]
[0, 9, 0]
[0, 7, 1, 10, 4, 6, 5, 8, 15, 13, 11, 2, 0]
Optimal cost: 1568
Time taken: 0.1018671989440918 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-3-1.txt
Algorithm: SA SP=1000.py
Run: 2
Output: Best solution:
[0, 3, 14, 12, 5, 6, 2, 0]
[0, 8, 15, 7, 0]
[0, 9, 4, 13, 11, 1, 10, 0]
Optimal cost: 1392
Time taken: 0.10922956466674805 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-3-1.txt
Algorithm: SA SP=1000.py
Run: 3
Output: Best solution:
[0, 1, 10, 0]
[0, 7, 0]
[0, 9, 3, 6, 5, 11, 14, 8, 15, 13, 2, 4, 12, 0]
Optimal cost: 1489
Time taken: 0.10039091110229492 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-3-1.txt
Algorithm: SA SP=1000.py
Run: 4
Output: Best solution:
[0, 9, 3, 14, 0]
[0, 1, 10, 0]
[0, 7, 11, 2, 4, 12, 6, 5, 8, 15, 13, 0]
Optimal cost: 1660
Time taken: 0.10540962219238281 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-3-1.txt
Algorithm: SA SP=1000.py
Run: 5
Output: Best solution:
[0, 10, 0]
[0, 9, 0]
[0, 7, 2, 4, 15, 13, 11, 1, 6, 5, 8, 3, 14, 12, 0]
Optimal cost: 1643
Time taken: 0.09805107116699219 seconds
Error: 

--------------------------------------------------
Filename: vrp-15-3-1.txt
Algorithm: SA SP=1000.py
Run: 6
Output: Best solution:
[0, 3, 6, 5, 13, 14, 8, 15, 7, 0]
[0, 1, 10, 4, 12, 0]
[0, 9, 11, 2, 0]
Optimal cost: 1521
Time taken: 0.10367536544799805 seconds
Error: 

--------------------------------------------------