A Hybrid Discrete Differential Evolution Algorithm for Economic Lot Scheduling Problem with Time Variant Lot Sizing
This article presents an efficient Hybrid Discrete Differential Evolution (HDDE) model to solve the Economic Lot Scheduling Problem (ELSP) using a time variant lot sizing approach. This proposed method introduces a novel Greedy Reordering Local Search (GRLS) operator as well as a novel Discrete DE scheme for solving the problem. The economic lot-scheduling problem (ELSP) is an important production scheduling problem that has been intensively studied. In this problem, several products compete for the use of a single machine, which is very similar to the real-life industrial scenario, in particular in the field of remanufacturing. The experimental results indicate that the proposed algorithm outperforms several previously used heuristic algorithms under the time-varying lot sizing approach.
KeywordsLot scheduling time-varying lot-sizes approach discrete differential evolution cyclic crossover simple inversion mutation greedy reordering local search remanufacturing
Unable to display preview. Download preview PDF.
- 4.Tasgeterin, M.F., Bulut, O., Fadiloglu, M.M.: A discrete artificial bee colony for the economic lot scheduling problem. In: IEEE Congress on Evolutionary Computing (CEC), New Orleans, USA, pp. 347–353 (2012)Google Scholar
- 13.Grefenstette, J.J.: Incorporating problem specific knowledge into genetic algorithms. In: Davis, L. (ed.) Genetic Algorithms and Simulated Annealing, pp. 42–60. Morgan Kaufmann, Los Altos (1987)Google Scholar
- 19.Ouyang, H., Zhu, X.: An economic lot scheduling problem for manufacturing and remanufacturing. In: IEEE Conference on Cybernetics and Intelligent Systems, Chengdu, pp. 1171–1175 (2008)Google Scholar