جستجوی مقالات مرتبط با کلیدواژه « exact methods » در نشریات گروه « صنایع »

Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs produced by a computer to solve big problems require more time, so, this paper suggests an algorithm that can be useful in better performance of the known algorithms such as Branch and Bound. The proposed study aims to improve the performance of the branch and bound (BB) algorithm in solving QAP problems. The findings show that the proposed method enables the BB algorithm to produce an optimal solution in the minimum amount of time.

Increased pressure on natural resources, rising production costs, and multiple disposal challenges resulted in a growing global demand for integrated closed sustainable supply chain networks. In this paper, a bi-objective mixed integer linear programming model is developed to minimize the overall cost and maximize the use of eco-friendly materials and clean technology. The paper evaluates the exact, heuristic, and metaheuristic methods in solving the proposed model in both small and large sizes. The sensitivity analysis was conducted on LP-metric method as it outperformed the other two exact methods in solving the small size problems. The evaluation of LP-metric, modified ε-constraint, and TH as the exact methods, and Lagrange relaxation algorithm as the heuristic method in terms of solution value and CPU time revealed the inability of exact methods in solving the large size problems. The best combination of effective parameters for meta-heuristic algorithms were determined using the Taguchi method. The evaluation of MOPSO, NSGA-II, SPEA-II, and MOEA/D as the metaheuristic methods by means of Number of Pareto Solutions (NPS), Mean Ideal Distance (MID), The Spread of Non-dominance Solutions (SNS), and CPU Time revealed the performance of these methods in solving the proposed model in a large size. The implementation of VIKOR technique identified the SPEA-II as the best method among the meta-heuristic methods. This study provides a holistic view regarding the importance of selecting an appropriate solution methodology based on the problem dimension to ensure obtaining the optimum and accurate solution within the reasonable processing time.

Multi-criteria sequence dependent setup times scheduling problems exist almost everywhere in real modern manufacturing world environments. Among them, Sequence Dependent Setup Times-Multi-Objective Hybrid Flowshop Scheduling Problem (SDST-MOHFSP) has been an intensifying attention of researchers and practitioners in the last three decades. In this paper, we briefly summarized and classified the current standing of SDST-MOHFSP. All publications are categorized regarding the solution methods, as well as the structure of the hybrid flowshop which helps researcher and practitioner to use/modify proper solution algorithm for solving their specific problem. Furthermore, based on the review of the existing papers, the need for future research is recognized. Accordingly, by recognizing the research gaps, a large number of recommendations for further study have been proposed.