Fardin Ahmadizar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Fardin Ahmadizar has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
Jamal Arkat
3 shared publications- Leila Hosseini
Department of Industrial Engineering, University of Kurdistan, Sanandaj, Iran
3 shared publications Ahmad Rabanimotlagh
Department of Industrial Engineering, University of Kurdistan, Pasdaran Boulevard, Sanandaj, Iran
2 shared publicationsJ. Arkat
Department of Industrial Engineering, University of Kurdistan, Sanandaj, Iran
2 shared publications- Ahmad Rabanimotlagh
Department of Industrial Engineering, University of Kurdistan, Sanandaj, Iran
1 shared publication - Alireza Zarei
Department of Industrial Engineering, University of Kurdistan, Sanandaj, Iran
1 shared publication
Latest Publications
- Open Access
- 1 January 2027
- Published by International Digital Organization for Scientific Information (IDOSI) in International Journal of Engineering
- Vol. 40 (2) , 454-467
An Efficient Branch-and-Bound Algorithm for Exact Clustering via Relational Decisions
Clustering is a fundamental technique in data analysis. Its main goal is grouping observations into distinct subsets based on similarities. However, algorithm complexity has encouraged researchers to seek new approaches for modeling and solving clustering problems. Pairwise Clustering refers to the set of decisions that determine whether two observations are assigned to the same cluster. Cluster assignment, in contrast, refers to assigning data to specific clusters. This paper proposes an innovative branch-and-bound method to solve the clustering problem. It utilizes the Pairwise Clustering concept to efficiently explore the solution space, helping to identify and prevent duplicate solutions. As a result, the number of implicitly computed solutions is greatly reduced, and algorithm speed increases. Unlike traditional methods, the proposed solution reduces the solution space by maintaining a constant number of observations while increasing the number of clusters. This feature allows the algorithm to perform well in problems with many clusters. The Iris dataset is used to evaluate the proposed algorithm. Computational experiments indicate that it achieves optimal clustering results while substantially reducing computational effort. The results show that the algorithm exhibits an inverse sensitivity to the number of clusters, achieving greater efficiency as the cluster count increases relative to conventional methods.
- 1 January 2027
- Published by International Digital Organization for Scientific Information (IDOSI) in International Journal of Engineering
- Vol. 40 (2) , 454-467
Open AccessAn Efficient Branch-and-Bound Algorithm for Exact Clustering via Relational Decisions
Clustering is a fundamental technique in data analysis. Its main goal is grouping observations into distinct subsets based on similarities. However, algorithm complexity has encouraged researchers to seek new approaches for modeling and solving clustering problems. Pairwise Clustering refers to the set of decisions that determine whether two observations are assigned to the same cluster. Cluster assignment, in contrast, refers to assigning data to specific clusters. This paper proposes an innovative branch-and-bound method to solve the clustering problem. It utilizes the Pairwise Clustering concept to efficiently explore the solution space, helping to identify and prevent duplicate solutions. As a result, the number of implicitly computed solutions is greatly reduced, and algorithm speed increases. Unlike traditional methods, the proposed solution reduces the solution space by maintaining a constant number of observations while increasing the number of clusters. This feature allows the algorithm to perform well in problems with many clusters. The Iris dataset is used to evaluate the proposed algorithm. Computational experiments indicate that it achieves optimal clustering results while substantially reducing computational effort. The results show that the algorithm exhibits an inverse sensitivity to the number of clusters, achieving greater efficiency as the cluster count increases relative to conventional methods.
- Open Access
- 1 January 2024
- Published by International Digital Organization for Scientific Information (IDOSI) in International Journal of Engineering
- Vol. 37 (7) , 1443-1465
Energy-Conscious Common Operation Scheduling in an Identical Parallel Machine Environment
The relentless growth of global energy consumption poses a multitude of complex challenges, including the depletion of finite energy resources and the exacerbation of greenhouse gas emissions, which contribute to climate change. In the face of these pressing environmental concerns, the manufacturing sector, a significant energy consumer, is under immense pressure to adopt sustainable practices. The critical intersection of energy consumption management and production operation scheduling emerges as a pivotal domain for addressing these challenges. The scheduling of common operations, exemplified by the cutting stock problem in industries like furniture and apparel, represents a prevalent challenge in production environments. For the first time, this paper pioneers an investigation into an identical parallel machine scheduling problem, taking into account common operations to minimize total energy consumption and total completion time concurrently. For this purpose, two bi-objective mixed integer linear programming models are presented, and an augmented ε – constraint method is used to obtain the Pareto optimal front for small-scale instances. Considering the NP-hardness of this problem, a non-dominated sorting genetic algorithm (NSGA-II) and a hybrid non-dominated sorting genetic algorithm with particle swarm optimization (HNSGAII-PSO) are developed to solve medium- and large-scale instances to achieve good approximate Pareto fronts. The performance of the proposed algorithms is assessed by conducting computational experiments on test problems. The results demonstrate that the proposed HNSGAII-PSO performs better than the suggested NSGA-II in solving the test problems.
- 1 January 2024
- Published by International Digital Organization for Scientific Information (IDOSI) in International Journal of Engineering
- Vol. 37 (7) , 1443-1465
Open AccessEnergy-Conscious Common Operation Scheduling in an Identical Parallel Machine Environment
The relentless growth of global energy consumption poses a multitude of complex challenges, including the depletion of finite energy resources and the exacerbation of greenhouse gas emissions, which contribute to climate change. In the face of these pressing environmental concerns, the manufacturing sector, a significant energy consumer, is under immense pressure to adopt sustainable practices. The critical intersection of energy consumption management and production operation scheduling emerges as a pivotal domain for addressing these challenges. The scheduling of common operations, exemplified by the cutting stock problem in industries like furniture and apparel, represents a prevalent challenge in production environments. For the first time, this paper pioneers an investigation into an identical parallel machine scheduling problem, taking into account common operations to minimize total energy consumption and total completion time concurrently. For this purpose, two bi-objective mixed integer linear programming models are presented, and an augmented ε – constraint method is used to obtain the Pareto optimal front for small-scale instances. Considering the NP-hardness of this problem, a non-dominated sorting genetic algorithm (NSGA-II) and a hybrid non-dominated sorting genetic algorithm with particle swarm optimization (HNSGAII-PSO) are developed to solve medium- and large-scale instances to achieve good approximate Pareto fronts. The performance of the proposed algorithms is assessed by conducting computational experiments on test problems. The results demonstrate that the proposed HNSGAII-PSO performs better than the suggested NSGA-II in solving the test problems.
- 15 December 2023
- Published by Elsevier in Applied Soft Computing
- Vol. 151
A bi-objective workflow scheduling in virtualized fog-cloud computing using NSGA-II with semi-greedy initialization
- 15 December 2023
- Published by Elsevier in Applied Soft Computing
- Vol. 151
A bi-objective workflow scheduling in virtualized fog-cloud computing using NSGA-II with semi-greedy initialization
- 2 August 2023
- Published by Taylor & Francis in Engineering Optimization
- Vol. 56 (8) , 1255-1277
One-step production and two-step assembly scheduling in identical factories
- 2 August 2023
- Published by Taylor & Francis in Engineering Optimization
- Vol. 56 (8) , 1255-1277
One-step production and two-step assembly scheduling in identical factories
- 7 June 2022
- Published by Springer Nature in Journal of Ambient Intelligence and Humanized Computing
- Vol. 14 (11) , 14695-14719
An equitable and accessible vaccine supply chain network in the epidemic outbreak of COVID-19 under uncertainty
Vaccination is one of the most efficient ways to restrict and control the spread of epidemic outbreaks such as COVID-19. Due to the limited COVID-19 vaccine supply, an equitable and accessible plan should be prepared to cope with. This research focuses on designing a vaccine supply chain while aiming to achieve an equitable and accessible network. We present a novel mathematical formulation that helps to optimize vaccine distribution to inoculate people with various priority levels to achieve an equitable plan. The transshipment strategy is also incorporated into the model to enhance the accessibility of COVID-19 vaccine types between health facilities. The nature of COVID-19 is dynamic over time due to mutations, and the protection level of each vaccine type against this disease is not exact. Besides, complete information about the demand for different vaccine types is not available. Hence, we use Multi-Stage Stochastic Programming as a reliable strategy that is organized to manage stochastic data in a dynamic environment for the first time in the vaccine supply chain network. The scenarios in this approach are generated using a Monte Carlo simulation method, and then a forward scenario reduction technique is conducted to construct a suitable scenario tree. The practicality and capability of the model are shown in a real-life case of Iran. The results show that the performance of the Multi-Stage Stochastic Programming is significantly improved compared with the two-stage stochastic programming regarding the total cost of the vaccine supply chain and the number of the shortage units.
- 7 June 2022
- Published by Springer Nature in Journal of Ambient Intelligence and Humanized Computing
- Vol. 14 (11) , 14695-14719
An equitable and accessible vaccine supply chain network in the epidemic outbreak of COVID-19 under uncertainty
Vaccination is one of the most efficient ways to restrict and control the spread of epidemic outbreaks such as COVID-19. Due to the limited COVID-19 vaccine supply, an equitable and accessible plan should be prepared to cope with. This research focuses on designing a vaccine supply chain while aiming to achieve an equitable and accessible network. We present a novel mathematical formulation that helps to optimize vaccine distribution to inoculate people with various priority levels to achieve an equitable plan. The transshipment strategy is also incorporated into the model to enhance the accessibility of COVID-19 vaccine types between health facilities. The nature of COVID-19 is dynamic over time due to mutations, and the protection level of each vaccine type against this disease is not exact. Besides, complete information about the demand for different vaccine types is not available. Hence, we use Multi-Stage Stochastic Programming as a reliable strategy that is organized to manage stochastic data in a dynamic environment for the first time in the vaccine supply chain network. The scenarios in this approach are generated using a Monte Carlo simulation method, and then a forward scenario reduction technique is conducted to construct a suitable scenario tree. The practicality and capability of the model are shown in a real-life case of Iran. The results show that the performance of the Multi-Stage Stochastic Programming is significantly improved compared with the two-stage stochastic programming regarding the total cost of the vaccine supply chain and the number of the shortage units.
- 1 January 2022
- Published by International Digital Organization for Scientific Information (IDOSI) in International Journal of Engineering
- Vol. 35 (5) , 1037-1055
Distributed Production Assembly Scheduling with Hybrid Flowshop in Assembly Stage
A new three stage production-assembly problem is considered in this paper. To the best of our knowledge, considering parallel machines in the third stage, identical parallel factories including the three stage production-assembly system and identical parallel factories with parallel machines in the third stage of the production-assembly system, has been specifically investigated in this paper. To minimize the maximum completion time (Makespan) of all jobs in the all factories, jobs assignment to factories and their processing sequence should be done properly. A Mixed Integer Linear Programming (MILP) model is presented to solve small size problem by using cplex solver. According to the problem computational complexity, large size of problem is not possible to solve using the cplex, so to solve it and to control the computational complexity, a new improved genetic algorithm (GA) is proposed by combining GA and Longest Proseccing Time (LPT) method that is called Hybrid Genetic Algorithm Longest Proseccing Time (HGALPT). The problem parameters values are determined using one-way analysis of variance (ANOVA). Finally, in order to evaluate the efficiency and effectiveness of the proposed algorithm, and to specify each parameter impact on the objective function, sensitivity analysis is performed on the problem parameters.
- 1 January 2022
- Published by International Digital Organization for Scientific Information (IDOSI) in International Journal of Engineering
- Vol. 35 (5) , 1037-1055
Distributed Production Assembly Scheduling with Hybrid Flowshop in Assembly Stage
A new three stage production-assembly problem is considered in this paper. To the best of our knowledge, considering parallel machines in the third stage, identical parallel factories including the three stage production-assembly system and identical parallel factories with parallel machines in the third stage of the production-assembly system, has been specifically investigated in this paper. To minimize the maximum completion time (Makespan) of all jobs in the all factories, jobs assignment to factories and their processing sequence should be done properly. A Mixed Integer Linear Programming (MILP) model is presented to solve small size problem by using cplex solver. According to the problem computational complexity, large size of problem is not possible to solve using the cplex, so to solve it and to control the computational complexity, a new improved genetic algorithm (GA) is proposed by combining GA and Longest Proseccing Time (LPT) method that is called Hybrid Genetic Algorithm Longest Proseccing Time (HGALPT). The problem parameters values are determined using one-way analysis of variance (ANOVA). Finally, in order to evaluate the efficiency and effectiveness of the proposed algorithm, and to specify each parameter impact on the objective function, sensitivity analysis is performed on the problem parameters.
- Open Access
- 1 November 2020
- Published by International Digital Organization for Scientific Information (IDOSI) in International Journal of Engineering
- Vol. 33 (11) , 2285-2298
A Hybrid Genetic Algorithm for Integrated Production and Distribution Scheduling Problem with Outsourcing Allowed
In this paper, we studied a new integrated production scheduling, vehicle routing, inventory and outsourcing problem. The production phase considers parallel machine scheduling including setup times with outsourcing allowed and the distribution phase considered batch delivery by a fleet of homogenous vehicles with respect to holding cost of completed jobs. The objective of the Mixed Integer Linear Programming (MILP) formulated model is to minimize the total costs including production, outsourcing, holding, tardiness and distribution fixed and variable costs. Due to the nondeterministic polynomial time (Np)-hardness of the problem, we derive a number of dominance properties for the optimal solution and combine them with a Genetic Algorithm (GA) to solve the problem. To assess the efficiency and effectiveness of the proposed hybrid algorithm, we conduct the computational study on randomly generated instances. Sensitivity analyses showed the impacts of the parameters on the objective function were incorporated. In order to evaluate the significance of the differences among the results obtained by GA and GADP one-tailed paired t tests were performed and interval plots were depicted.
- 1 November 2020
- Published by International Digital Organization for Scientific Information (IDOSI) in International Journal of Engineering
- Vol. 33 (11) , 2285-2298
Open AccessA Hybrid Genetic Algorithm for Integrated Production and Distribution Scheduling Problem with Outsourcing Allowed
In this paper, we studied a new integrated production scheduling, vehicle routing, inventory and outsourcing problem. The production phase considers parallel machine scheduling including setup times with outsourcing allowed and the distribution phase considered batch delivery by a fleet of homogenous vehicles with respect to holding cost of completed jobs. The objective of the Mixed Integer Linear Programming (MILP) formulated model is to minimize the total costs including production, outsourcing, holding, tardiness and distribution fixed and variable costs. Due to the nondeterministic polynomial time (Np)-hardness of the problem, we derive a number of dominance properties for the optimal solution and combine them with a Genetic Algorithm (GA) to solve the problem. To assess the efficiency and effectiveness of the proposed hybrid algorithm, we conduct the computational study on randomly generated instances. Sensitivity analyses showed the impacts of the parameters on the objective function were incorporated. In order to evaluate the significance of the differences among the results obtained by GA and GADP one-tailed paired t tests were performed and interval plots were depicted.
- 1 January 2019
- Vol. 53 (1) , 495-507
Unrelated parallel machine scheduling with processing constraints and sequence dependent setup times
- 1 January 2019
- Vol. 53 (1) , 495-507
Unrelated parallel machine scheduling with processing constraints and sequence dependent setup times
- 31 July 2017
- Published by SAGE Publications in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
- Vol. 33 (4) , 2075-2084
Stochastic group shop scheduling with fuzzy due dates
The group shop scheduling (GSS) problem is a general formulation that includes the job shop and the open shop scheduling problems. This paper is the first dealing with a GSS problem with random release and processing times and fuzzy due dates. While release and processing times are assumed to be random variables with known distributions, as in many real-world situations, job due dates are considered to be fuzzy tolerating a certain amount of delay. The objective is to maximize the expected total degree of satisfaction with respect to the fuzzy due dates. The problem is formulated as a stochastic disjunctive program and then two solution approaches are developed for it, both of which act within an ant colony optimization (ACO) framework. In the first approach, to estimate the performance of a constructed schedule, each random variable is replaced by its expectation, whereas in the other approach following a simulation optimization procedure, a discrete event simulation model is employed to estimate the performance of a schedule. The proposed approaches are then compared through computational experiments.
- 31 July 2017
- Published by SAGE Publications in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
- Vol. 33 (4) , 2075-2084
Stochastic group shop scheduling with fuzzy due dates
The group shop scheduling (GSS) problem is a general formulation that includes the job shop and the open shop scheduling problems. This paper is the first dealing with a GSS problem with random release and processing times and fuzzy due dates. While release and processing times are assumed to be random variables with known distributions, as in many real-world situations, job due dates are considered to be fuzzy tolerating a certain amount of delay. The objective is to maximize the expected total degree of satisfaction with respect to the fuzzy due dates. The problem is formulated as a stochastic disjunctive program and then two solution approaches are developed for it, both of which act within an ant colony optimization (ACO) framework. In the first approach, to estimate the performance of a constructed schedule, each random variable is replaced by its expectation, whereas in the other approach following a simulation optimization procedure, a discrete event simulation model is employed to estimate the performance of a schedule. The proposed approaches are then compared through computational experiments.