Abstract
This paper presents a comparative study of evolutionary algorithms which are considered to be effective in solving the multilevel lot-sizing problem in material requirement planning (MRP) systems. Three evolutionary algorithms (simulated annealing (SA), particle swarm optimization (PSO) and genetic algorithm (GA)) are provided. For evaluating the performances of algorithms, the distribution of total cost (objective function) and the average computational time are compared. As a result, both GA and PSO have better cost performances with lower average total costs and smaller standard deviations. When the scale of the multilevel lot-sizing problem becomes larger, PSO is of a shorter computational time.
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.