Affiliation:
1. Iran University of Science and Technology, Iran
2. Tecnológico de Monterrey, México
Abstract
The hybrid metaheuristics algorithms (HMHAs) have gained a considerable attention for their capability to solve difficult problems in different fields of science. This chapter introduces some applications of HMHAs in solving inventory theory problems. Three basic inventory problems, joint replenishment EOQ problem, newsboy problem, and stochastic review problem, in certain and uncertain environments such as stochastic, rough, and fuzzy environments with six different applications, are considered. Several HMHAs such as genetic algorithm (GA), simulated annealing (SA), particle swarm optimization (PSO), harmony search (HS), variable neighborhood search (VNS), and bees colony optimization (BCO) methods are used to solve the inventory problems. The proposed metaheuristics algorithms also are combined with fuzzy simulation, rough simulation, Pareto selecting and goal programming approaches. The computational performance of all of them, on solving these three optimization problems, is compared together.
Reference67 articles.
1. Aarts, E. H. L., & Korst, J. H. M. (1989). Simulated annealing and Boltzmann machine: A stochastic approach to computing. Chichester, UK: John Wiley and Sons.
2. Separating capacity constraints in the CVRP using tabu search
3. Blum, C., Blesa Aguilera, M. J., Roli, A., & Sampels, M. (2008). Hybrid meta-heuristics – An emerging approach to optimization (Vol. 114). Springer Studies in Computational Intelligence.
4. Hybrid metaheuristics in combinatorial optimization: A survey
5. Metaheuristics in combinatorial optimization
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献