Abstract
This paper presents comparisons of some recent improving strategies on multi-objective particle swarm optimization (MOPSO) algorithm which is based on Pareto dominance for handling multiple objective in continuous review stochastic inventory control system. The complexity of considering conflict objectives such as cost minimization and service level maximization in the real-world inventory control problem needs to employ more exact optimizers generating more diverse and better non-dominated solutions of a reorder point and order size system. At first, we apply the original MOPSO employed for the multi-objective inventory control problem. Then we incorporate the mutation operator to maintain diversity in the swarm and explore all the search space into the MOPSO. Next we change the leader selection strategy used that called geographically-based system (Grids) and instead of that, crowding distance factor is also applied to select the global optimal particle as a leader. Also we use ε-dominance concept to bound archive size and maintain more diversity and convergence in the MOPSO for optimizing the inventory control problem. Finally, the MOPSO algorithms created using these strategies are evaluated and compared with each other in terms of some performance metrics taken from the literature. The results indicate that these strategies have significant influences on computational time, convergence, and diversity of generated Pareto optimal solutions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.