Inventory optimization is a significant problem that is tied directly to financial gains. Its complexity has led to the development of new inventory models and optimization techniques. Evolutionary algorithms, particularly Pareto based evolutionary algorithms have been proven to be reliable for solving such problems. However, these evolutionary algorithms concentrate mostly on global search and have limited local search abilities. This leads to a poor convergence to the Pareto front. Among these algorithms the most studied are non-dominated sorting genetic algorithm-II and strength Pareto evolutionary algorithm2. This paper proposes a novel method that increases their convergence. The novelty is based on three techniques: Firstly, a time-based fitness assignment that favours solutions from previous generations is employed. Secondly, before the crossover process, the mating pool is updated with a positive bias towards better solutions. Finally, a more disruptive mutation scheme is used to prevent premature convergence. The novel algorithms were tested on a benchmark problem suite and two inventory problems. The performance of the algorithms is measured using hypervolume, generational distance and spacing metrics. The results illustrated by graphics indicate that the novel algorithms can obtain better convergence without increasing the time complexity.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.