摘要
The purpose of this paper is to develop and test three meta-heuristic algorithms to solve large size multi-objective supply chain network design problems. The algorithms are based on tabu search, genetic algorithm, and simulated annealing to find near-optimal global solutions. The three algorithms are designed, coded, and tested, and their parameters are fine tuned. The exact epsilon-constraint algorithm embedded in the General Algebraic Modeling System is used to validate the results of the three algorithms. The algorithms are compared using a typical multi-objective supply chain model utilizing several performance measures. The measures include the mean ideal distance, diversification metric, and percent of domination, inverted generational distance, and computation time. The results show that the tabu search algorithm outperformed the other two algorithms in terms of the percent of domination and computation time. On the other hand, the simulated annealing solutions are the best in terms of their diversity. The work in this paper is expected to help managers to solve large-scale supply chain problems that arise in oil and gas, petrochemical, and food supply chains.
学科与关键词
- A tabu search based algorithm for the optimal design of multi-objective multi-product supply chain networksMohammed, Awsan M.; Duffuaa, Salih O.*EXPERT SYSTEMS WITH APPLICATIONS, 2020, 140: 112808.被引 45
- A hybrid algorithm based on tabu search and generalized network algorithm for designing multi-objective supply chain networksMohammed, Awsan*; Duffuaa, Salih O.NEURAL COMPUTING & APPLICATIONS, 2022, 34(23): 20973-20992.被引 1
- Mathematical programming and three metaheuristic algorithms for a bi-objective supply chain scheduling problemZarei, Hamid; Rasti-Barzoki, Morteza*NEURAL COMPUTING & APPLICATIONS, 2019, 31(12): 9073-9093.被引 12
