================================================================ reLOC 0.08-osaka : Multirobot Solution solver (C) Copyright 2011-2013 Pavel Surynek ---------------------------------------------------------------- Reading graph... Reading initial arrangement... Reading goal arrangement... Solving layer: 2 Solving layer: 3 Solving layer: 4 Solving layer: 5 Solving layer: 6 Solving layer: 7 Solving layer: 8 Solving layer: 9 Solving layer: 10 Solving layer: 11 Solving layer: 12 Solving layer: 13 Solving layer: 14 Solving layer: 15 Solving layer: 16 Computed optimal makespan:15 Makespan optimal solution: Mulirobot solution: (|moves| = 192, paralellism = 12.800) [ Step 0: 6#4->3 7#18->21 8#15->19 9#1->7 11#5->12 13#23->24 16#27->34 17#37->30 19#9->16 Step 1: 1#10->4 3#32->31 6#3->9 7#21->28 8#19->23 11#12->11 12#0->1 13#24->25 14#36->37 15#8->2 16#34->33 17#30->29 18#13->18 19#16->15 Step 2: 3#31->32 4#14->13 5#6->0 6#9->16 7#28->35 8#23->24 9#7->8 11#11->10 13#25->26 14#37->38 15#2->3 16#33->40 18#18->21 19#15->19 Step 3: 3#32->33 4#13->6 8#24->25 9#8->15 11#10->9 12#1->7 13#26->27 14#38->31 16#40->39 17#29->28 19#19->23 Step 4: 1#4->10 3#33->40 5#0->1 8#25->26 9#15->19 11#9->8 12#7->14 13#27->34 14#31->32 16#39->38 18#21->18 19#23->30 Step 5: 1#10->9 3#40->39 4#6->0 9#19->23 10#20->25 11#8->7 12#14->15 13#34->27 14#32->33 15#3->2 16#38->37 17#28->21 18#18->13 19#30->29 Step 6: 1#9->8 3#39->38 7#35->28 9#23->30 10#25->32 11#7->14 12#15->19 14#33->34 16#37->36 17#21->18 18#13->6 Step 7: 1#8->9 2#22->21 3#38->37 6#16->15 9#30->31 10#32->39 12#19->23 14#34->33 15#2->3 16#36->35 17#18->13 18#6->7 Step 8: 1#9->16 2#21->18 3#37->30 5#1->2 6#15->19 8#26->25 9#31->32 12#23->24 13#27->34 14#33->40 16#35->36 17#13->6 18#7->8 Step 9: 1#16->15 2#18->13 3#30->37 5#2->1 6#19->23 7#28->21 9#32->33 12#24->31 13#34->27 16#36->35 17#6->7 18#8->9 19#29->22 Step 10: 1#15->19 2#13->6 3#37->36 6#23->24 7#21->18 8#25->20 9#33->34 10#39->38 12#31->32 13#27->26 15#3->4 16#35->28 17#7->8 18#9->10 19#22->29 Step 11: 1#19->23 2#6->7 5#1->2 6#24->31 7#18->13 9#34->27 10#38->37 11#14->15 12#32->39 13#26->25 14#40->33 16#28->21 17#8->9 18#10->11 Step 12: 1#23->22 2#7->6 4#0->1 5#2->8 6#31->32 7#13->14 9#27->26 10#37->30 12#39->38 13#25->24 14#33->40 15#4->3 16#21->18 17#9->10 18#11->17 19#29->28 Step 13: 1#22->21 3#36->37 4#1->2 6#32->33 7#14->7 9#26->25 10#30->29 11#15->19 12#38->39 13#24->31 15#3->9 16#18->13 17#10->11 19#28->35 Step 14: 1#21->18 2#6->0 5#8->15 6#33->34 7#7->1 10#29->28 11#19->23 13#31->24 17#11->12 19#35->36 ] Multirobot solution analysis: ( total makespan = 15 total distance = 101 total trajectory = 192 average parallelism = 12.800 average distance = 5.316 average trajectory = 10.105 parallelism distribution = [ 0 0 0 0 0 0 0 0 1 1 2 2 2 5 1 1 ] distance distribution = [ 2 0 3 2 2 2 2 2 1 1 1 ] trajectory distribution = [ 0 0 0 0 1 0 4 1 0 3 4 2 3 1 ] ) Phase statistics (current phase = 'SAT') [ Phase (name = 'root_phase') [ Total SAT solver calls = 0 Satisfiable SAT solver calls = 0 Unsatisfiable SAT solver calls = 0 Indeterminate SAT solver calls = 0 Move executions = 0 Produced CNF variables = 0 Produced CNF clauses = 0 Search steps = 0 Wall clock TIME (seconds) = 17.603 CPU/machine TIME (seconds) = 17.600 ] Sub-phases { Phase (name = 'SAT') [ Total SAT solver calls = 15 Satisfiable SAT solver calls = 1 Unsatisfiable SAT solver calls = 14 Indeterminate SAT solver calls = 0 Move executions = 192 Produced CNF variables = 666199 Produced CNF clauses = 524710 Search steps = 0 Wall clock TIME (seconds) = 627.802 CPU/machine TIME (seconds) = 628.000 ] } ] ----------------------------------------------------------------