Due to the important environmental effects on human life and the conflict between the mining process and environmental factors, the enactment of protectionist environmental laws in the mineral industry has received extensive attention especially in countries with high mining potential. In this regard, using an extended fuzzy TOPSIS method, this study develops a novel conceptual framework to identify the key protection laws in Iran by considering the mineral successful laws and regulations in mineral-developed countries such as Australia, Chile, India, Turkey, Canada, South Africa, and China. This helps to apply the experiences of the abovementioned countries in resolving similar conflicts in Iran’s mineral industry. The key protection laws are selected based on their national and international environmental treaties, mines’ environmental protection laws, conflict solution methods, social responsibilities in mining activity, and laws for the abandoned mines. The proposed framework demonstrates that Iran’s mineral laws require revision and more transparency to avoid ambiguity and conflict with mineral property laws and governmental rights.

Community detection has gained much attention during the past few decades. So many algorithms have been developed to tackle this problem. In previous related works the weight of the edges and directionality were not considered at the same time in the models. Considering weights and directionality makes the models more realistic and prevents the loss of information in the network. In this article, we propose an overlapping community detection algorithm for networks with weighted and directed edges. We used the concept of information flows among the vertices i.e. the more flows exist in a community, the stronger the community. We implemented the concept of flow using weighted closed flows starting from a given node and ending to the same node. By using the mentioned assumption we developed a new modularity measure called weighted flow modularity (WFM) based on M function modularity. In addition, we developed an overlapping score criteria which considers overlap in vertices and edges at the same time and is much faster in the terms of run time. We compared the community detection results in terms of accuracy and running time with Order statistics local optimization method (OSLOM) on 74 LFR benchmark networks using normalized mutual information score. We also implemented the community detection process using LCFE on real world datasets and evaluated the community detection results using EQ measure. The experimental analysis results show that the LCFE is more accurate in most cases and is competitive in other cases with OSLOM.

One of the most important solutions for dimensionality reduction in data preprocessing, and improving classification performance is gene selection in microarray data since they usually have several thousand genes with very few samples. Because of these characteristics, the complexity of classification models increases and their efficiency decreases. The gene selection problem inherently pursues two goals: reducing the number of genes and increasing the classification efficiency. Therefore, this paper presents a novel hybrid filter-wrapper solution based on the Fisher-score method and Multi-Objective Forest Optimization Algorithm (MOFOA). In the proposed method, as a preprocessing step, the Fisher-score method selects 500 discriminative genes by removing redundant/irrelevant genes. Then, MOFOA searches to find the subset of optimal genes using concepts such as repository, crowding-distance, and binary tournament selection. Moreover, the proposed method solves the gene selection problem and, at the same time, optimizes the kernel parameters in the SVM classification model. Six microarray datasets were used to evaluate the performance of the proposed method. Afterward, a comparison was made between its results and those of the four multi-objective hybrid methods presented in the literature in terms of classification performance, the number of selected genes, running time, and hypervolume criteria. According to the results, in addition to selecting fewer genes, the proposed solution has achieved greater classification accuracy in most cases and has been able to obtain a performance similar to or better than that of other multi-objective gene selection approaches.

Social networks can provide sellers across the world with invaluable information about the structure of possible influences among different members of a network, whether positive or negative, and can be used to maximize diffusion in the network. Here, a novel mathematical monopoly product pricing model is introduced for maximization of market share in noncompetitive environment. In the proposed model, a customer’s decision to buy a product is not only based on the price, quality and need time for the product but also on the positive and negative influences of his/her neighbors. Therefore, customers are considered heterogeneous and a referral bonus is granted to every customer whose neighbors also buy the product. Here, the degree of influence is directly related to the intensity of the customers’ relationships. Finally, using the proposed model for a real case study, the optimal policy for product sales that is the ratio of product sale price in comparison with its cost and also the optimal amounts of referral bonus per customer is achieved.

In this paper, a weighted transfer point location problem is developed in which demand points have probabilistic coordinates. The proposed model is formulated as a probabilistic unconstrained nonlinear programming and the optimum values of decision variables are obtained in the form of probability distribution functions. Because of the complexity in solving the developed model by using the traditional solution approaches, a new stochastic inference method called Probabilistic Role Base (PRB) is developed based on the derived optimum probability distribution functions of the decision variables. This method is used to infer the optimum or near optimum values of all decision variables without solving nonlinear programming model, directly. Finally, to demonstrate the efficiency of the developed algorithm, a numerical example is presented and the results are compared with the optimum solution.

Product mix problem is one of the most important decisions made in production systems. Several algorithms have been developed to determine the product mix. Most of the previous works assume that all resources can perform, simultaneously and independently, which may lead to infeasibility of the schedule. In this paper, product mix problem and scheduling are considered, simultaneously. A new mixed-integer programming (MIP) model is proposed to formulate this problem. The proposed model differentiates between process batch size and transfer batch size. Therefore, it is possible to have overlapped operations. The numerical example is used to demonstrate the implementation of the proposed model. In addition, the proposed model is examined using some instances previously cited in the literature. The preliminary computational results show that the proposed model can generate higher performance than conventional product mix model.