================================================================ 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 Computed optimal makespan:14 Makespan optimal solution: Mulirobot solution: (|moves| = 188, paralellism = 13.429) [ Step 0: 1#14->13 2#22->23 3#20->16 4#35->36 5#7->8 6#25->26 9#43->44 10#9->10 11#11->12 12#38->30 14#40->39 15#5->6 16#2->1 Step 1: 1#13->5 2#23->24 4#36->28 5#8->9 6#26->27 7#3->4 8#15->7 9#44->49 10#10->11 11#12->18 12#30->31 13#33->25 14#39->38 15#6->14 Step 2: 2#24->19 3#16->15 4#28->29 5#9->2 6#27->35 7#4->3 8#7->0 10#11->12 11#18->22 12#31->32 13#25->26 14#38->37 15#14->13 16#1->8 Step 3: 2#19->14 3#15->7 4#29->21 6#35->27 7#3->10 8#0->1 10#12->18 11#22->30 14#37->36 16#8->16 Step 4: 1#5->6 3#7->0 4#21->29 6#27->28 7#10->17 8#1->8 9#49->48 10#18->22 11#30->38 12#32->31 13#26->34 14#36->35 15#13->12 16#16->20 Step 5: 2#14->13 3#0->1 4#29->30 5#2->9 7#17->10 8#8->16 9#48->49 10#22->23 11#38->43 12#31->39 13#34->41 14#35->42 16#20->26 Step 6: 1#6->14 4#30->22 5#9->8 6#28->29 7#10->3 8#16->20 9#49->48 10#23->24 11#43->44 12#39->38 14#42->46 15#12->11 16#26->34 Step 7: 1#14->19 2#13->12 3#1->0 5#8->16 6#29->21 7#3->2 8#20->26 9#48->43 10#24->32 11#44->39 12#38->37 14#46->42 15#11->4 16#34->35 Step 8: 1#19->24 2#12->11 3#0->7 4#22->18 5#16->20 7#2->9 8#26->27 9#43->44 10#32->40 11#39->31 12#37->29 13#41->34 15#4->3 16#35->36 Step 9: 1#24->23 2#11->4 3#7->8 4#18->12 5#20->26 7#9->10 8#27->35 9#44->43 10#40->39 11#31->32 12#29->28 13#34->33 14#42->46 15#3->2 16#36->37 Step 10: 1#23->31 3#8->9 4#12->11 5#26->34 6#21->22 7#10->3 8#35->36 9#43->48 10#39->44 11#32->40 12#28->27 13#33->25 14#46->42 15#2->1 16#37->38 Step 11: 1#31->30 4#11->10 5#34->41 6#22->18 7#3->2 8#36->37 9#48->43 10#44->49 11#40->32 12#27->26 13#25->33 14#42->35 15#1->8 16#38->39 Step 12: 1#30->29 2#4->3 4#10->17 5#41->42 6#18->12 7#2->1 8#37->38 10#49->48 11#32->31 12#26->20 13#33->25 14#35->34 15#8->7 16#39->44 Step 13: 1#29->28 2#3->2 3#9->10 5#42->46 6#12->13 8#38->39 11#31->30 13#25->26 14#34->33 15#7->8 16#44->49 ] Multirobot solution analysis: ( total makespan = 14 total distance = 87 total trajectory = 188 average parallelism = 13.429 average distance = 5.438 average trajectory = 11.750 parallelism distribution = [ 0 0 0 0 0 0 0 0 0 1 1 0 3 7 2 ] distance distribution = [ 1 0 2 0 2 0 3 2 2 3 ] trajectory distribution = [ 0 0 0 0 0 0 0 0 0 4 2 5 4 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) = 42.544 CPU/machine TIME (seconds) = 42.540 ] Sub-phases { Phase (name = 'SAT') [ Total SAT solver calls = 14 Satisfiable SAT solver calls = 1 Unsatisfiable SAT solver calls = 13 Indeterminate SAT solver calls = 0 Move executions = 188 Produced CNF variables = 415092 Produced CNF clauses = 361582 Search steps = 0 Wall clock TIME (seconds) = 139.540 CPU/machine TIME (seconds) = 139.660 ] } ] ----------------------------------------------------------------