Optimization of continuous-time production planning using hybrid genetic algorithms-simulated annealing

Evolutionary algorithms are stochastic search methods that mimic the principles of natural biological evolution to produce better and better approximations to a solution and have been used widely for optimization problems. A general problem of continuous-time aggregate production planning for a given total number of changes in production rate over the total planning horizon is considered. It is very important to identify and solve the problem of continuous-time production planning horizon with varying production rates over the interval of the planning period horizon. Some of the researchers have proposed global search methods for the continuous-time aggregate production-planning problem. So far, less work is reported to solve the problem of continuous-time production planning using local search methods like genetic algorithms (GA) and simulated annealing (SA). So in this work, we propose a modified single objective evolutionary program approach, namely GA, SA, and hybrid genetic algorithms-simulated annealing (GA-SA) for continuous-time production plan problems. The results are compared with each other and it was found that the hybrid algorithm performs better.

[1]  Chen-Hua Chung,et al.  Integrating maintenance and production decisions in a hierarchical production planning environment , 1999, Comput. Oper. Res..

[2]  George R. Wilson,et al.  An on-line controller for production systems with seasonal demands , 1994 .

[3]  Reay-Chen Wang,et al.  Aggregate production planning with multiple objectives in a fuzzy environment , 2001, Eur. J. Oper. Res..

[4]  Shu-Cherng Fang,et al.  A genetics-based approach for aggregated production planning in a fuzzy environment , 1997, IEEE Trans. Syst. Man Cybern. Part A.

[5]  Glen E. Johnson,et al.  Optimal tolerance allotment using a genetic algorithm and truncated Monte Carlo simulation , 1993, Comput. Aided Des..

[6]  David B. Fogel,et al.  An introduction to simulated evolutionary optimization , 1994, IEEE Trans. Neural Networks.

[7]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[8]  Konstantin Kogan,et al.  Balancing facilities in aggregate production planning: Make-to-order and make-to-stock environments , 1998 .

[9]  S. Nahmias,et al.  A continuous review model for an inventory system with two supply modes , 1988 .

[10]  Konstantin Kogan,et al.  An optimal control method for aggregate production planning in large-scale manufacturing systems with capacity expansion and deterioration , 1995 .

[11]  Liming Liu,et al.  (s, S) continuous review models for inventory with random lifetimes , 1990 .

[12]  Fayez F. Boctor,et al.  The impact of sequencing decisions on multi-item lot sizing and scheduling in flow shops , 1999 .

[13]  Hanan Luss,et al.  Operations Research and Capacity Expansion Problems: A Survey , 1982, Oper. Res..

[14]  Awi Federgruen,et al.  Technical Note - Cost Formulas for Continuous Review Inventory Models with Fixed Delivery Lags , 1983, Oper. Res..

[15]  Abdelhakim Artiba,et al.  Aggregate planning in hybrid flowshops , 1998 .

[16]  D J Stockton,et al.  Aggregate Production Planning Using Genetic Algorithms , 1995 .

[17]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[18]  P N Bloom.  Effective marketing for professional services. , 1984, Harvard business review.