Applying genetic algorithms to dynamic lot sizing with batch ordering

Authors:
Lotfi Gaafar
Affiliations:
The American University in Cairo, 113 Kasr el Aini Street, P.O. Box 2511, Cairo 11511, Egypt
Venue:
Computers and Industrial Engineering
Year:
2006

Citing 8
Cited 4

Approximation formulations for the single-product capacitated lot size problem

Operations Research
A simple procedure for solving single level lot sizing problems

Computers and Industrial Engineering
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
A genetic algorithm for solving economic lot size scheduling problem

Computers and Industrial Engineering - 26th International conference on computers and industrial engineering
Improved Rolling Schedules for the Dynamic Single-Level Lot-Sizing Problem

Management Science
Design and Analysis of Experiments

Design and Analysis of Experiments
Dynamic Lot Sizing with Batch Ordering and Truckload Discounts

Operations Research
Recent developments in evolutionary computation for manufacturingoptimization: problems, solutions, and comparisons

IEEE Transactions on Evolutionary Computation

A comparative study of heuristic algorithms on Economic Lot Scheduling Problem

Computers and Industrial Engineering
A parameter-tuned genetic algorithm for multi-product economic production quantity model with space constraint, discrete delivery orders and shortages

Advances in Engineering Software
A Stackelberg single-period supply chain inventory model with weighted possibilistic mean values under fuzzy environment

Applied Soft Computing
Multi-product sequencing and lot-sizing under uncertainties: A memetic algorithm

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, genetic algorithms are applied to the deterministic time-varying lot sizing problem with batch ordering and backorders. Batch ordering requires orders that are integer multiples of a fixed quantity that is larger than one. The developed genetic algorithm (GA) utilizes a new '012' coding scheme that is designed specifically for the batch ordering policy. The performance of the developed GA is compared to that of a modified Silver-Meal (MSM) heuristic based on the frequency of obtaining the optimum solution and the average percentage deviation from the optimum solution. In addition, the effect of five factors on the performance of the GA and the MSM is investigated in a fractional factorial experiment. Results indicate that the GA outperforms the MSM in both responses, with a more robust performance. Significant factors and interactions are identified and the best conditions for applying each approach are pointed out.