• XML

    isc pubmed crossref medra doaj doaj
  • List of Articles


      • Open Access Article

        1 - Analysing Price, Quality and Lead Time Decisions with the Hybrid Solution Method of Fuzzy Logic and Genetic Algorithm
        amin mahmoudi hassan shavandi khashayar nouhi
        In this paper, the problem of determining the quality level, lead time for order delivery and price of a product produced by a manufactureris considered. In this problem the demand for the product is influenced by all three decision variables: price, lead time and quali More
        In this paper, the problem of determining the quality level, lead time for order delivery and price of a product produced by a manufactureris considered. In this problem the demand for the product is influenced by all three decision variables: price, lead time and quality level. Toformulate the demand function, a fuzzy rule base that estimates the demand value based on the three decision variables is developed. To doso, the linguistic knowledge of experts in the form of if-then rules is used to establish the fuzzy system. Moreover, in order to solve theproblem, a genetic algorithm integrating the fuzzy rule base is proposed. Finally, to support the validity of the proposed solution, anumerical study is provided. Manuscript profile
      • Open Access Article

        2 - An Integrated Model of Project Scheduling and Material Ordering: A Hybrid Simulated Annealing and Genetic Algorithm
        Nima Zoraghi Amir Abbas Najafi سید تقی اخوان نیاکی
        This study aims to deal with a more realistic combined problem of project scheduling and material ordering. The goal is to minimize thetotal material holding and ordering costs by determining the starting time of activities along with material ordering schedules subject More
        This study aims to deal with a more realistic combined problem of project scheduling and material ordering. The goal is to minimize thetotal material holding and ordering costs by determining the starting time of activities along with material ordering schedules subject tosome constraints. The problem is first mathematically modelled. Then a hybrid simulated annealing and genetic algorithm is proposed tosolve it. In addition, some experiments are designed and the Taguchi method is employed to both tune the parameters of the proposedalgorithm and to evaluate its performance. The results of the performance analysis show the efficiency of the proposed methodology. Manuscript profile
      • Open Access Article

        3 - A Neural Network Model Based on Support Vector Machine for Conceptual Cost Estimation in Construction Projects
        Behnam Vahdani Seyed Meysam Mousavi Morteza Mousakhani Mani Sharifi Hassan Hashemi
        Estimation of the conceptual costs in construction projects can be regarded as an important issue in feasibility studies. This estimation has amajor impact on the success of construction projects. Indeed, this estimation supports the required information that can be emp More
        Estimation of the conceptual costs in construction projects can be regarded as an important issue in feasibility studies. This estimation has amajor impact on the success of construction projects. Indeed, this estimation supports the required information that can be employed in costmanagement and budgeting of these projects. The purpose of this paper is to introduce an intelligent model to improve the conceptual costaccuracy during the early phases of the life cycle of projects in construction industry. A computationally efficient model, namely supportvector machine model, is developed to estimate the conceptual costs of construction projects. The proposed neural network model is trainedby a cross validation technique in order to produce the reliable estimations. To demonstrate the performance of the proposed model, twopowerful intelligent techniques, namely nonlinear regression and back-propagation neural networks (BPNNs), are provided. Their resultsare compared on the basis of the available dataset from the related literature in construction industry. The computational results illustratethat the presented intelligent model performs better than the other two powerful techniques. Manuscript profile
      • Open Access Article

        4 - Sensitivity Analysis in the QUALIFLEX and VIKOR Methods
        Alireza Alinezhad Nima Esfandiari
        The sensitivity analysis for multi-attribute decision making (MADM) problems is important for two reasons: First, the decision matrix asthe source of the results of a decision problem is inaccurate because it sorts the alternatives in each criterion inaccurately. Second More
        The sensitivity analysis for multi-attribute decision making (MADM) problems is important for two reasons: First, the decision matrix asthe source of the results of a decision problem is inaccurate because it sorts the alternatives in each criterion inaccurately. Second, thedecision maker may change his opinions in a time period because of changes in the importance of the criteria and in the policy of theorganization over time. This in turn makes problem solving really time-consuming. Therefore, the best solution is to do sensitivity analysis.In this regard, this paper considers a sensitivity analysis in the QUALIFLEX method which is a compromise ranking method used formulti-criteria decision making (MCDM). Manuscript profile
      • Open Access Article

        5 - Design of a Mathematical Model for Logistic Network in a Multi-Stage Multi-Product Supply Chain Network and Developing a Metaheuristic Algorithm
        Esmaeil Mehdizadeh Fariborz Afrabandpei
        Logistic network design is one of the most important strategic decisions in supply chain management that has recently attracted theattention of many researchers. Transportation network design is then one of the most important fields of logistic network. This study iscon More
        Logistic network design is one of the most important strategic decisions in supply chain management that has recently attracted theattention of many researchers. Transportation network design is then one of the most important fields of logistic network. This study isconcerned with designing a multi-stage and multi-product logistic network. At first, a mixed integer nonlinear programming model(MINLP) is formulated that minimizes transportation and holding costs. Then, a hybrid priority-based Genetic Algorithm (pb-GA) andsimulated annealing algorithm (SA) is developed in two phases to find the optimal solution. The solution is represented by a matrix and avector. Response Surface Methodology (RSM) is also used to adjust the significant parameters of the algorithm. Finally, several testproblems are generated which show that the proposed metaheuristic algorithm can find good solutions in reasonable time spans. Manuscript profile
      • Open Access Article

        6 - A Mathematical Model and a Solution Method for Hybrid Flow Shop Scheduling
        Esmaeil Najafi Bahman Naderi Hassan Sadeghi Mehdi Yazdani
        This paper studies the hybrid flow shop scheduling where the optimization criterion is the minimization of total tardiness. First, theproblem is formulated as a mixed integer linear programming model. Then, to solve large problem sizes, an artificial immune algorithmhyb More
        This paper studies the hybrid flow shop scheduling where the optimization criterion is the minimization of total tardiness. First, theproblem is formulated as a mixed integer linear programming model. Then, to solve large problem sizes, an artificial immune algorithmhybridized with a simple local search in form of simulated annealing is proposed. Two experiments are carried out to evaluate the modeland the algorithm. In the first one, the general performance of the model and the proposed algorithm is experimented. In the next one, thepresented algorithm is compared against some other algorithms. The results support high performance of the proposed algorithm. Manuscript profile
      • Open Access Article

        7 - A Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-AllocationProblem
        Ragheb Rahmaniani abdosalam Ghaderi Mohammad Saidi Mehrabad
        In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty ischaracterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs oftransportat More
        In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty ischaracterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs oftransportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an efficienthybrid solution algorithm based on several meta-heuristics and an exact algorithm is put forward. This algorithm generates neighborhoodsby combining the main concepts of variable neighborhood search, simulated annealing, and tabu search and finds the local optima by usingan algorithm that uses an exact method in its framework. Finally, to test the algorithms’ performance, we apply numerical experiments onboth randomly generated and standard test problems. Computational experiments show that our algorithm is more effective and efficient interm of CPU time and solutions quality in comparison with CPLEX solver. Manuscript profile
      • Open Access Article

        8 - An Exact Algorithm for the Mode Identity Project Scheduling Problem
        Behrouz Afshar Nadjafi Amir Rahimi Hamid Karimi
        In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) withmode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to bep More
        In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) withmode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to beprocessed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project scheduling problemwith mode identity. The proposed algorithm is extended with some bounding rules to reduce the size of branch and bound tree. Finally,some test problems are solved and their computational results are reported. Manuscript profile