function that calculates the cost of a given solution in matrix representation concode_field_sep int STR_EXCHANGE concode_elem_sep int ALWAYS_PERFORM concode_elem_sep int BEST concode_elem_sep int PERFORM_ON_IMPROVE concode_elem_sep int nv concode_elem_sep Tsp tspp concode_elem_sep double capacity concode_elem_sep int STR_CROSS concode_elem_sep int[] sol concode_elem_sep int FIRST concode_elem_sep int nc concode_elem_sep double[] demands concode_elem_sep int STR_RELOC concode_field_sep void setNumberClients concode_elem_sep double excess_demand concode_elem_sep double excess_demand concode_elem_sep int[] routes_to_array concode_elem_sep void main concode_elem_sep int[] improve_routes_2opt concode_elem_sep void improve_routes_2opt concode_elem_sep void setSol concode_elem_sep void setTsp concode_elem_sep int getNumberClients concode_elem_sep void insert_min_cost concode_elem_sep double[] getDemands concode_elem_sep int[] getSol concode_elem_sep int[][] routes_from_order concode_elem_sep int[][] routes_from_order concode_elem_sep void setDemands concode_elem_sep Tsp getTsp concode_elem_sep int[][] get_routes concode_elem_sep int getNumberVehicles concode_elem_sep void print_routes concode_elem_sep void print_routes concode_elem_sep int[] routes_to_order concode_elem_sep void setNumberVehicles concode_elem_sep void setCapacity concode_elem_sep double excess_demand_route concode_elem_sep void setDemand concode_elem_sep double getCapacity concode_elem_sep double getDemand
double function ( int [ ] [ ] arg0 ) { double loc0 = 0 ; int loc1 = arg0 . length ; for ( int loc2 = 0 ; loc2 < loc1 ; loc2 ++ ) { double loc3 = 0 ; loc0 += tspp . loc0 ( arg0 [ loc2 ] ) ; } return loc0 ; }