Mostafa Hajiaghaei-Keshteli Articles List

List of Articles Mostafa Hajiaghaei-Keshteli

Open Access Article
- Abstract Page
- Full-Text
1 - Optimization of Multi-period Three-echelon Citrus Supply Chain Problem
Navid Sahebjamnia Fariba Goodarzian Mostafa Hajiaghaei-Keshteli
10.22094/joie.2017.728.1463

20.1001.1.22519904.2020.13.1.4.8

In this paper, a new multi-objective integer non-linear programming model is developed for designing citrus three-echelon supply chain network. Short harvest period, product specifications, high perished rate, and special storing and distributing conditions make the mod More

In this paper, a new multi-objective integer non-linear programming model is developed for designing citrus three-echelon supply chain network. Short harvest period, product specifications, high perished rate, and special storing and distributing conditions make the modeling of citrus supply chain more complicated than other ones. The proposed model aims to minimize network costs including waste cost, transportation cost, and inventory holding cost, and to maximize network’s profits. To solve the model, firstly the model is converted to a linear programming model. Then three multi-objective meta-heuristic algorithms are used including MOPSO, MOICA, and NSGA-II for finding efficient solutions. The strengths and weaknesses of MOPSO, MOICA, and NSGA-II for solving the proposed model are discussed. The results of the algorithms have been compared by several criteria consisting of number of Pareto solution, maximum spread, mean ideal distance, and diversification metric.Computational results show that MOPSO algorithm finds competitive solutions in compare with NSGA-II and MOICA. Manuscript profile
Open Access Article
- Abstract Page
- Full-Text
2 - Solving the Fixed Charge Transportation Problem by New Heuristic Approach
Komeil Yousefi Ahmad J. Afshari Mostafa Hajiaghaei-Keshteli
10.22094/joie.2017.738.1469

20.1001.1.22519904.2019.12.1.5.2

The fixed charge transportation problem (FCTP) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. Since the problem is c More

The fixed charge transportation problem (FCTP) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. Since the problem is considered as an NP-hard, the computational time grows exponentially as the size of the problem increases. In this paper, we propose a new heuristic along with well-known metaheuristic like Geneticalgorithm (GA), simulated annealing (SA) and recently developed one, Keshtel algorithm (KA) to solve the FCTP. Contrary to previous works, we develop a simple and strong heuristic according to the nature of the problem and compare the result with metaheuristics. In addition, since the researchers recently used the priority-based representation to encode the transportation graphs and achievedverygood results, we consider this representation in metaheuristics and compare the results with the proposed heuristic. Furthermore, we apply the Taguchi experimental design method to set the proper values of algorithms in order to improve their performances. Finally, computational results of heuristic and metaheuristics with different encoding approaches, both in terms of the solution quality and computation time, are studied in different problem sizes. Manuscript profile

Current Issue

Published Issues

Menu

Browse

List of Articles Mostafa Hajiaghaei-Keshteli