A hybrid binary particle swarm optimization for large capacitated multi item multi level lot sizing (CMIMLLS) problem

International Conference on Advances in Materials and Manufacturing Applications 2016

Mishra, S.K.^1 ; Sahithi, V.V.D.^1 ; Rao, C.S.P.^1

Department of Mechanical Engineering, National Institute of Technology, Warangal

Telangana

506004, India^1

关键词: Binary particle swarm optimization;    Capacity restriction;    Hybrid mechanisms;    Iterative improvements;    Lot sizing problems;    Multi-level lot sizing;    Optimal order quantity;    Quality of solution;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/149/1/012040/pdf
DOI  :  10.1088/1757-899X/149/1/012040

来源: IOP

【 摘 要 】

The lot sizing problem deals with finding optimal order quantities which minimizes the ordering and holding cost of product mix. when multiple items at multiple levels with all capacity restrictions are considered, the lot sizing problem become NP hard. Many heuristics were developed in the past have inevitably failed due to size, computational complexity and time. However the authors were successful in the development of PSO based technique namely iterative improvement binary particles swarm technique to address very large capacitated multi-item multi level lot sizing (CMIMLLS) problem. First binary particle Swarm Optimization algorithm is used to find a solution in a reasonable time and iterative improvement local search mechanism is employed to improvise the solution obtained by BPSO algorithm. This hybrid mechanism of using local search on the global solution is found to improve the quality of solutions with respect to time thus IIBPSO method is found best and show excellent results.