Mohammad Zakaraia - Academia.edu (original) (raw)
Uploads
Papers by Mohammad Zakaraia
Elsevier, 2024
This paper presents a methodological approach to solving the fuzzy capacitated logistic distri- ... more This paper presents a methodological approach to solving the fuzzy capacitated logistic distri-
bution center problem, with a focus on the optimal selection of distribution centers to meet the
demands of multiple plants. The distribution centers are characterized by fixed costs and capaci-
ties, while plant demands are modeled using fuzzy triangular membership functions. The problem
is mathematically formulated by converting fuzzy demands into crisp values, providing a struc-
tured framework for addressing uncertainty in logistic planning. To support future research and
facilitate comparative analysis, 20 benchmark problems were generated, filling a gap in the ex-
isting literature. Three distinct artificial bee colony algorithm variants were hybridized with a
heuristic: one using the best solution per iteration, another incorporating chaotic mapping and
adaptive procedures, and the third employing convergence and diversity archives. An experi-
mental design based on Taguchi’s orthogonal arrays was employed for optimizing the algorithm
parameters, ensuring systematic exploration of the solution space. The developed methods offer
a comprehensive toolkit for addressing complex, uncertain demands in logistic distribution, with
code provided for reproducibility.
Key contributions include:
• Development of a fuzzy model for the selection of distribution centers with fixed costs and
capacities under uncertain plant demands.
• Generation of 20 benchmark problems to advance research in the fuzzy capacitated logistic
distribution center problem domain.
• Integration of a heuristic approach with three distinct ABC algorithm variants, each contribut-
ing unique methodological insights.
Informatica, Apr 22, 2024
This paper introduces a novel optimization problem termed the Fixed Charged Transshipment Problem... more This paper introduces a novel optimization problem termed the Fixed Charged Transshipment Problem (FCTP), which incorporates fixed charges for selected routes. A new formulation for this problem is presented, aiming to address the combinatorial nature of the challenge. The study further introduces a Modified Emperor Penguin Optimizer (EPO) algorithm designed to enhance the solution approach. To evaluate the performance of the Modified EPO, a comparative analysis is conducted against the classical EPO and Particle Swarm Optimization (PSO) algorithms. 19 problems, including various multi-modal test optimization functions, serve as the testing ground. Results demonstrate the efficacy of the Modified EPO, establishing its superiority over the classical EPO and PSO. Additionally, a heuristic procedure is proposed for solving the combinatorial aspect of the FCTP. This heuristic is hybridized with both the Modified EPO and PSO algorithms. 30 FCTP problems are generated using a code available at https://github.com/MZakaraia/EPO_Transshipment/. Taguchi's orthogonal arrays are employed to optimize parameter levels for both algorithms. The study concludes with the comparison of the Modified Hybrid EPO and Hybrid PSO in solving the 30 generated FCTP problems. Remarkably, the Modified Hybrid EPO algorithm outperforms the Hybrid PSO, showing its effectiveness in addressing the Fixed Charged Transshipment Problem in terms of means and robustness. Povzetek: Članek predstavlja spremenjeni algoritem cesarskega pingvina za reševanje problema s fiksnimi stroški prenosa, ki kaže premoč nad klasičnimi metodami z robustnostjo in učinkovitostjo rešitev.
International Journal of Industrial and Systems Engineering, Dec 31, 2022
This paper introduces a novel optimization problem termed the Fixed Charged Transshipment Problem... more This paper introduces a novel optimization problem termed the Fixed Charged Transshipment Problem (FCTP), which incorporates fixed charges for selected routes. A new formulation for this problem is presented, aiming to address the combinatorial nature of the challenge. The study further introduces a Modified Emperor Penguin Optimizer (EPO) algorithm designed to enhance the solution approach. To evaluate the performance of the Modified EPO, a comparative analysis is conducted against the classical EPO and Particle Swarm Optimization (PSO) algorithms. 19 problems, including various multi-modal test optimization functions, serve as the testing ground. Results demonstrate the efficacy of the Modified EPO, establishing its superiority over the classical EPO and PSO. Additionally, a heuristic procedure is proposed for solving the combinatorial aspect of the FCTP. This heuristic is hybridized with both the Modified EPO and PSO algorithms. 30 FCTP problems are generated using a code available at https://github.com/MZakaraia/EPO_Transshipment/. Taguchi's orthogonal arrays are employed to optimize parameter levels for both algorithms. The study concludes with the comparison of the Modified Hybrid EPO and Hybrid PSO in solving the 30 generated FCTP problems. Remarkably, the Modified Hybrid EPO algorithm outperforms the Hybrid PSO, showing its effectiveness in addressing the Fixed Charged Transshipment Problem in terms of means and robustness. Povzetek: Članek predstavlja spremenjeni algoritem cesarskega pingvina za reševanje problema s fiksnimi stroški prenosa, ki kaže premoč nad klasičnimi metodami z robustnostjo in učinkovitostjo rešitev.
International Journal of Applied Metaheuristic Computing, Jul 22, 2022
This paper discusses the U-shaped assembly line balancing problem in case of stochastic processin... more This paper discusses the U-shaped assembly line balancing problem in case of stochastic processing time. The problem is formulated using chance-constrained programming, and the greedy randomized adaptive search procedure is used to solve the problem. In order to prove the efficiency of the proposed algorithm, 71 problems taken from well-known benchmarks are solved and compared with the theoretical lower bound, and 13 of them were compared with another approach used to solve the same problem in another paper, which is beam search. The results show that 59 problems are the same as the theoretical aspiration lower bound. In addition, the results of 11 of 13 problems compared with beam search are the same, and the results of two problems are better than beam search. The t-test statistics is applied and showed that there is no significance difference between the proposed algorithm and the theoretical lower bound; thus, the proposed algorithm shows efficiency when compared with the aspired values of the theoretical lower bound.
Inderscience, 2023
In recent years, there has been an increasing interest in the multi-manned assembly line balancin... more In recent years, there has been an increasing interest in the multi-manned assembly line balancing problem (MALBP). It introduces the concept of assigning more operators at the same station to minimise the line length and to increase the production rate. Most of the previous works did not discuss such problems under uncertainty. Therefore, this paper presents a chance-constrained programming model that considers the processing times of the tasks as normally distributed random variables with known means and variances. The proposed algorithm for solving the problem is an artificial immune system algorithm. To get optimised results from the proposed algorithm, the parameters are tuned using a design of experiments. The computational results show the implementation of the proposed algorithm on 70 problems taken from well-known benchmarks in case that chance probability is equal to 0.95, 0.95, and 0.975.
International Journal of Applied Metaheuristic Computing, 2022
This paper discusses the U-shaped assembly line balancing problem in case of stochastic processin... more This paper discusses the U-shaped assembly line balancing problem in case of stochastic processing time. The problem is formulated using chance-constrained programming and the greedy randomized adaptive search procedure is used to solve the problem. In order to prove the efficiency of the proposed algorithm, 71 problems taken from well-known benchmarks are solved and compared with the theoretical lower bound and 13 of them were compared with another approach used to solve the same problem in another paper, which is beam search. The results show that 59 problems are the same as the theoretical aspiration lower bound. In addition, the results of 11 of 13 problems compared with beam search are the same and the results of 2 problems are better than beam search. The t-test statistics is applied and showed that there is no significance difference between the proposed algorithm and the theoretical lower bound thus, the proposed algorithm shows efficiency when compared with the aspired valu...
Journal of University of Shanghai for Science and Technology, 2021
The assembly line balancing problems have great importance in research and industry fields. They ... more The assembly line balancing problems have great importance in research and industry fields. They allow minimizing the learning aspects and guaranteeing a fixed number of products per day. This paper introduces a new problem that combines the multi-manned concept with the U-shaped lines with time and space constraints under uncertainty. The processing time of the tasks is considered as random variables with known means and variances. Therefore, chance-constraints appear in the cycle time constraints. In addition, each task has an associated area, where the assigned tasks per station are restricted by a total area. The proposed algorithm for solving the problem is a stochastic local search algorithm. The parameter levels of the proposed algorithm are optimized by the Taguchi method to cover the small, medium, and large-sized problems. Well-known benchmark problems have been adapted to cover the new model. The computational results showed the importance of the new problem and the effic...
International Journal of Production Management and Engineering, 2022
The U-shaped assembly lines help to have more flexibility than the straight assembly lines, where... more The U-shaped assembly lines help to have more flexibility than the straight assembly lines, where the operators can perform tasks in both sides of the line, the entrance and the exit sides. Having more than one operator in any station of the line can reduce the line length and thereby affects the number of produced products. This paper combines the U-shaped assembly line balancing problem with the multi-manned assembly line balancing problem in one problem. In addition, the processing times of the tasks are considered as stochastic, where they are represented as random variables with known means and variances. The problem is formulated as a mixed-integer linear programming and the cycle time constraints are formulated as chanceconstraints. The proposed algorithm for solving the problem is a differential evolution algorithm. The parameter of the algorithm is optimized using experimental design and the computational results are done on 71 adapted problems selected from wellknown benchmarks.
Elsevier, 2024
This paper presents a methodological approach to solving the fuzzy capacitated logistic distri- ... more This paper presents a methodological approach to solving the fuzzy capacitated logistic distri-
bution center problem, with a focus on the optimal selection of distribution centers to meet the
demands of multiple plants. The distribution centers are characterized by fixed costs and capaci-
ties, while plant demands are modeled using fuzzy triangular membership functions. The problem
is mathematically formulated by converting fuzzy demands into crisp values, providing a struc-
tured framework for addressing uncertainty in logistic planning. To support future research and
facilitate comparative analysis, 20 benchmark problems were generated, filling a gap in the ex-
isting literature. Three distinct artificial bee colony algorithm variants were hybridized with a
heuristic: one using the best solution per iteration, another incorporating chaotic mapping and
adaptive procedures, and the third employing convergence and diversity archives. An experi-
mental design based on Taguchi’s orthogonal arrays was employed for optimizing the algorithm
parameters, ensuring systematic exploration of the solution space. The developed methods offer
a comprehensive toolkit for addressing complex, uncertain demands in logistic distribution, with
code provided for reproducibility.
Key contributions include:
• Development of a fuzzy model for the selection of distribution centers with fixed costs and
capacities under uncertain plant demands.
• Generation of 20 benchmark problems to advance research in the fuzzy capacitated logistic
distribution center problem domain.
• Integration of a heuristic approach with three distinct ABC algorithm variants, each contribut-
ing unique methodological insights.
Informatica, Apr 22, 2024
This paper introduces a novel optimization problem termed the Fixed Charged Transshipment Problem... more This paper introduces a novel optimization problem termed the Fixed Charged Transshipment Problem (FCTP), which incorporates fixed charges for selected routes. A new formulation for this problem is presented, aiming to address the combinatorial nature of the challenge. The study further introduces a Modified Emperor Penguin Optimizer (EPO) algorithm designed to enhance the solution approach. To evaluate the performance of the Modified EPO, a comparative analysis is conducted against the classical EPO and Particle Swarm Optimization (PSO) algorithms. 19 problems, including various multi-modal test optimization functions, serve as the testing ground. Results demonstrate the efficacy of the Modified EPO, establishing its superiority over the classical EPO and PSO. Additionally, a heuristic procedure is proposed for solving the combinatorial aspect of the FCTP. This heuristic is hybridized with both the Modified EPO and PSO algorithms. 30 FCTP problems are generated using a code available at https://github.com/MZakaraia/EPO_Transshipment/. Taguchi's orthogonal arrays are employed to optimize parameter levels for both algorithms. The study concludes with the comparison of the Modified Hybrid EPO and Hybrid PSO in solving the 30 generated FCTP problems. Remarkably, the Modified Hybrid EPO algorithm outperforms the Hybrid PSO, showing its effectiveness in addressing the Fixed Charged Transshipment Problem in terms of means and robustness. Povzetek: Članek predstavlja spremenjeni algoritem cesarskega pingvina za reševanje problema s fiksnimi stroški prenosa, ki kaže premoč nad klasičnimi metodami z robustnostjo in učinkovitostjo rešitev.
International Journal of Industrial and Systems Engineering, Dec 31, 2022
This paper introduces a novel optimization problem termed the Fixed Charged Transshipment Problem... more This paper introduces a novel optimization problem termed the Fixed Charged Transshipment Problem (FCTP), which incorporates fixed charges for selected routes. A new formulation for this problem is presented, aiming to address the combinatorial nature of the challenge. The study further introduces a Modified Emperor Penguin Optimizer (EPO) algorithm designed to enhance the solution approach. To evaluate the performance of the Modified EPO, a comparative analysis is conducted against the classical EPO and Particle Swarm Optimization (PSO) algorithms. 19 problems, including various multi-modal test optimization functions, serve as the testing ground. Results demonstrate the efficacy of the Modified EPO, establishing its superiority over the classical EPO and PSO. Additionally, a heuristic procedure is proposed for solving the combinatorial aspect of the FCTP. This heuristic is hybridized with both the Modified EPO and PSO algorithms. 30 FCTP problems are generated using a code available at https://github.com/MZakaraia/EPO_Transshipment/. Taguchi's orthogonal arrays are employed to optimize parameter levels for both algorithms. The study concludes with the comparison of the Modified Hybrid EPO and Hybrid PSO in solving the 30 generated FCTP problems. Remarkably, the Modified Hybrid EPO algorithm outperforms the Hybrid PSO, showing its effectiveness in addressing the Fixed Charged Transshipment Problem in terms of means and robustness. Povzetek: Članek predstavlja spremenjeni algoritem cesarskega pingvina za reševanje problema s fiksnimi stroški prenosa, ki kaže premoč nad klasičnimi metodami z robustnostjo in učinkovitostjo rešitev.
International Journal of Applied Metaheuristic Computing, Jul 22, 2022
This paper discusses the U-shaped assembly line balancing problem in case of stochastic processin... more This paper discusses the U-shaped assembly line balancing problem in case of stochastic processing time. The problem is formulated using chance-constrained programming, and the greedy randomized adaptive search procedure is used to solve the problem. In order to prove the efficiency of the proposed algorithm, 71 problems taken from well-known benchmarks are solved and compared with the theoretical lower bound, and 13 of them were compared with another approach used to solve the same problem in another paper, which is beam search. The results show that 59 problems are the same as the theoretical aspiration lower bound. In addition, the results of 11 of 13 problems compared with beam search are the same, and the results of two problems are better than beam search. The t-test statistics is applied and showed that there is no significance difference between the proposed algorithm and the theoretical lower bound; thus, the proposed algorithm shows efficiency when compared with the aspired values of the theoretical lower bound.
Inderscience, 2023
In recent years, there has been an increasing interest in the multi-manned assembly line balancin... more In recent years, there has been an increasing interest in the multi-manned assembly line balancing problem (MALBP). It introduces the concept of assigning more operators at the same station to minimise the line length and to increase the production rate. Most of the previous works did not discuss such problems under uncertainty. Therefore, this paper presents a chance-constrained programming model that considers the processing times of the tasks as normally distributed random variables with known means and variances. The proposed algorithm for solving the problem is an artificial immune system algorithm. To get optimised results from the proposed algorithm, the parameters are tuned using a design of experiments. The computational results show the implementation of the proposed algorithm on 70 problems taken from well-known benchmarks in case that chance probability is equal to 0.95, 0.95, and 0.975.
International Journal of Applied Metaheuristic Computing, 2022
This paper discusses the U-shaped assembly line balancing problem in case of stochastic processin... more This paper discusses the U-shaped assembly line balancing problem in case of stochastic processing time. The problem is formulated using chance-constrained programming and the greedy randomized adaptive search procedure is used to solve the problem. In order to prove the efficiency of the proposed algorithm, 71 problems taken from well-known benchmarks are solved and compared with the theoretical lower bound and 13 of them were compared with another approach used to solve the same problem in another paper, which is beam search. The results show that 59 problems are the same as the theoretical aspiration lower bound. In addition, the results of 11 of 13 problems compared with beam search are the same and the results of 2 problems are better than beam search. The t-test statistics is applied and showed that there is no significance difference between the proposed algorithm and the theoretical lower bound thus, the proposed algorithm shows efficiency when compared with the aspired valu...
Journal of University of Shanghai for Science and Technology, 2021
The assembly line balancing problems have great importance in research and industry fields. They ... more The assembly line balancing problems have great importance in research and industry fields. They allow minimizing the learning aspects and guaranteeing a fixed number of products per day. This paper introduces a new problem that combines the multi-manned concept with the U-shaped lines with time and space constraints under uncertainty. The processing time of the tasks is considered as random variables with known means and variances. Therefore, chance-constraints appear in the cycle time constraints. In addition, each task has an associated area, where the assigned tasks per station are restricted by a total area. The proposed algorithm for solving the problem is a stochastic local search algorithm. The parameter levels of the proposed algorithm are optimized by the Taguchi method to cover the small, medium, and large-sized problems. Well-known benchmark problems have been adapted to cover the new model. The computational results showed the importance of the new problem and the effic...
International Journal of Production Management and Engineering, 2022
The U-shaped assembly lines help to have more flexibility than the straight assembly lines, where... more The U-shaped assembly lines help to have more flexibility than the straight assembly lines, where the operators can perform tasks in both sides of the line, the entrance and the exit sides. Having more than one operator in any station of the line can reduce the line length and thereby affects the number of produced products. This paper combines the U-shaped assembly line balancing problem with the multi-manned assembly line balancing problem in one problem. In addition, the processing times of the tasks are considered as stochastic, where they are represented as random variables with known means and variances. The problem is formulated as a mixed-integer linear programming and the cycle time constraints are formulated as chanceconstraints. The proposed algorithm for solving the problem is a differential evolution algorithm. The parameter of the algorithm is optimized using experimental design and the computational results are done on 71 adapted problems selected from wellknown benchmarks.