Sharif University of TechnologyScientia Iranica1026-309831620240401Application of a novel quadratic polynomial discrete grey model to forecast energy consumption of China4694802337610.24200/sci.2023.53774.3405ENX.Ma- School of Science, Southwest University of Science and Technology, 621010, Mianyang, China
- State Key Laboratory of Oil and Gas Reservoir Geology and Exploitation, Southwest Petroleum University, 610500, Chengdu,
ChinaW.Wu- School of Science, Southwest University of Science and Technology, 621010, Mianyang, China
- V.C. & V.R. Key Lab of Sichuan Province, Sichuan Normal University, 610068, Chengdu, ChinaY.ZhangSchool of Science, Southwest University of Science and Technology, 621010, Mianyang, ChinaJournal Article20190613The discrete grey modelling technique is a novel methodology of grey prediction<br />models, which is effective to improve the effectiveness and applicability of grey<br />models. In order to build a more general and effective univariate grey prediction<br />model, the discrete grey modelling technique is utilised in this paper to build<br />a quadratic polynomial discrete grey model, abbreviated as the QPDGM. The<br />properties of the QPDGM model have been discussed, which indicate that the<br />new model can be regarded as an extension of the conventional discrete grey<br />model and nonhomogeneous grey model, and it is also coincidence with three<br />classes of exponential sequences. The QPDGM model is finally applied to predict<br />the energy consumption of China, including the electric power, crude oil and<br />natural gas consumptions. The results have been compared to some commonly<br />used univariate grey prediction models, which indicates the QPDGM model is<br />generally more accurate than other models.https://scientiairanica.sharif.edu/article_23376_f075e4558069906b51a24c1f8fdf4af9.pdfSharif University of TechnologyScientia Iranica1026-309831620240401Joint production-planning and distribution optimization of perishable products under a combined shipment structure: A new hybrid policy-based approach4814992242110.24200/sci.2021.55464.4234ENS.RezaeiDepartment of Industrial Engineering, Faculty of Engineering, Bu-Ali Sina University, Hamedan, IranA.KheirkhahDepartment of Industrial Engineering, Faculty of Engineering, Bu-Ali Sina University, Hamedan, IranJournal Article20200302Following the need for joint optimization of decisions in supply chains, this paper newly provides an integrated framework to efficiently fulfill a production-planning-routing problem (PPRP). In such integrated scheme, a set of perishable family-products are manufactured on a single batch-processing machine. These products are dispatched to the customers by a third-party logistics service provider with only two types of licensed eco-friendly transportation facilities. In order to efficiently deliver the manufactured products before they become unusable, we propose a combined shipment structure. To accomplish this, we formulate the problem in the context of a MILP model. In particular, we aim to establish two manufacturing policies based on both increasing and decreasing rates of production and also two delivery policies expressing distinct preferences in fulfilling the customers’ demands. In this regards, we investigate the cost structures obtained from the established integrated planning and the resulting distribution configurations as well. Further, four heuristic algorithms are developed for solving the problem with respect to each hybrid production/distribution scheme derived from the former policies. Finally, to compare the mentioned procedures, it is conducted a numerical study illustrating the preferable efficiency of the plan gained according to the hybrid of the increasing-production-rate and decreasing-delivery-distance policies.https://scientiairanica.sharif.edu/article_22421_fc11f8330a600c027f7d17eabeab13a0.pdfSharif University of TechnologyScientia Iranica1026-309831620240401A new mathematical formulation and a hybrid evolutionary algorithm for re-entrant flow-shop problem with release date5005172243010.24200/sci.2021.56555.4787ENR.BehmaneshDepartment of Industrial Engineering, Naghshejahan Higher Education Institute, Isfahan 8144167984, IranK.KianfarFaculty of Engineering, University of Isfahan, Isfahan 81746-73441, IranJournal Article20200822In this paper, we address the weighted multi-objective re-entrant flow-shop scheduling problem considering release dates in order to minimize makespan, total completion time, total tardiness, maximum idle time, and number of tardy jobs. Each job is taken into account with deterministic processing times, and release dates. The flow-shop comprised of two workshops in whose jobs are entered to the main workshop and after the first part of the processing, they are transferred to the second workshop and after this stage, the jobs are returned to the main workshop for the last part of the processing. We model the problem by a new mixed integer programming based on formulating sum of idle time as a new concept. Moreover, a hybrid evolutionary algorithm is proposed based on some dispatching rules, ant colony optimization, and genetic algorithm. The performance of the proposed algorithm on some test instances is compared to the mixed integer linear programming model as well as the state-of-the-art algorithms called genetic algorithm, tabu search, bio-geography based optimization, and artificial bee colony. The computational experiments show that our proposed approach outperforms other algorithms and the results indicate efficiency and capability of the proposed algorithm in comparison with the traditional algorithms.https://scientiairanica.sharif.edu/article_22430_f7d827c69e423591c7737bcbdd8303ff.pdfSharif University of TechnologyScientia Iranica1026-309831620240401Decompositions of soft sets and soft matrices with applications in group decision making5185342242810.24200/sci.2021.58119.5575ENA. O.AtagunDepartment of Mathematics, Kirsehir Ahi Evran University, Kirsehir, TurkeyH.KamaciDepartment of Mathematics, Faculty of Science and Arts, Yozgat Bozok University, Yozgat, TurkeyJournal Article20210416The decompositions of soft sets and soft matrices are important tools for theoretical and practical studies. In this paper, firstly, we study the decomposition of soft sets in detail. Later, we introduce the concepts of $\alpha$-upper, $\alpha$-lower, $\alpha$-intersection and $\alpha$-union for soft matrices and present some decomposition theorems. Some of these operations are set-restricted types of existing operations of soft sets/matrices, others are $\alpha$-oriented operations that provide functionality in some cases. Moreover, some relations of decompositions of soft sets and soft matrices are investigated and the newfound relations are supported with numerical examples. Finally, two new group decision making algorithms based on soft sets/matrices are constructed, and then their efficiency and practicality are demonstrated by dealing with real life problems and comparison analysis. By using these proposed approaches, solutions can be presented to soft set-based multi-criteria decision making problems, both ordinary and involving primary assessments. These allow to handle soft set-based multi-criteria decision making from different perspectives.https://scientiairanica.sharif.edu/article_22428_23d318ffb484075f816c7f2adaf2b0a1.pdfSharif University of TechnologyScientia Iranica1026-309831620240401A very fast method for guaranteed generation of one facet for 0-1 knapsack polyhedron5355392266810.24200/sci.2022.54438.4026ENF.KianfarDepartment of Industrial Engineering, Sharif University of Technology, Tehran, IranK.KianfarDepartment of Industrial and Systems Engineering, Texas A&M University, College Station, TX, 77843-3131M.RafieeDepartment of Industrial Engineering, Sharif University of Technology, Tehran, Iran0000-0002-0406-9465Journal Article20200104The 0-1 knapsack polyhedron as the most basic relaxation of a 0-1 integer program has attracted attention of many researchers over the years.We present a very fast method that is guaranteed to generate one facet for the 0-1 knapsack polyhedron. Unlike lifting of cover inequlities, our method does not require an initial minimal cover or a predetermined lifting sequencing, and its worst-case complexity is linear in number of variables. Therefore, it is suitable for incorporation into mixed interger programming(MIP) solvers, in order to generate, with negligible computational burden, one strong cut based on any 0-1 knapsack relaxation of a general MIP.https://scientiairanica.sharif.edu/article_22668_76b9726f4f758571e342f8bb1eccdc5c.pdf