generate initial solution concode_field_sep double antFactor concode_elem_sep double beta concode_elem_sep double evaporation concode_elem_sep int currentIndex concode_elem_sep double bestTourLength concode_elem_sep Random random concode_elem_sep double alpha concode_elem_sep int numberOfCities concode_elem_sep double probabilities[] concode_elem_sep double c concode_elem_sep int numberOfAnts concode_elem_sep double Q concode_elem_sep List<Ant> ants concode_elem_sep int maxIterations concode_elem_sep double trails[][] concode_elem_sep double randomFactor concode_elem_sep int[] bestTourOrder concode_elem_sep double graph[][] concode_field_sep void startAntOptimization concode_elem_sep void moveAnts concode_elem_sep void updateTrails concode_elem_sep void calculateProbabilities concode_elem_sep int[] solve concode_elem_sep void updateBest concode_elem_sep void clearTrails concode_elem_sep int selectNextCity concode_elem_sep void setupAnts
double [ ] [ ] function ( int arg0 ) { double [ ] [ ] loc0 = new double [ arg0 ] [ arg0 ] ; IntStream . range ( 0 , arg0 ) . forEach ( i -> IntStream . range ( 0 , arg0 ) . forEach ( j -> loc0 [ i ] [ j ] = Math . abs ( random . nextInt ( 100 ) + 1 ) ) ) ; return loc0 ; }