Abstract
In rough milling of sculptured surface parts, decisions on process parameters concern feedrate, spindle speed, cutting speed, width of cut, raster pattern angle and number of machining slices of variable thickness. In this paper three rough milling objectives are considered: minimum machining time, maximum removed material and maximum uniformity of the remaining volume at the end of roughing. Owing to the complexity of the modelled problem and the large number of parameters, typical genetic algorithms cannot achieve global optima without defining case-dependent constraints. Therefore, to achieve generality, a hierarchical game similar to a Stackelberg game is implemented in which a typical Genetic Algorithm functions as the leader and micro-Genetic Algorithms as followers. In this game, one of the leader’s parameters is responsible for creating a follower’s population and for triggering the optimisation. After properly weighing the three objectives, the follower performs single-objective optimization in steps and feeds the leader back with the objective values as they appear prior to weighing. Micro-Genetic Algorithm (follower) chromosome consists of the distribution of machining slice thickness, while the typical Genetic Algorithm (leader) consists of the milling parameters. The methodology is tested on sculptured surface parts with different properties, and a representative case is presented here.
Similar content being viewed by others
References
Abu-Lebdeh G., Benekohal R.F. (1999) Convergence variability and population sizing in micro-genetic algorithms. Computer-Aided Civil and Infrastructure Engineering 14: 321–334
Agrawal R.K., Pratihar D.K., Choudhury A.R. (2006) Optimization of CNC isoscallop free form surface machining using a genetic algorithm. International Journal of Machine Tools & Manufacture 46: 811–819
Ahn C.W., Ramakrishna R.S. (2003) Elitism-based compact genetic algorithms. IEEE Transactions on Evolutionary Computation 7(4): 367–385
Briceno J.F., El-Mounayri H., Mukhopadhyay S. (2002) Selecting an artificial neural network for efficient modeling and accurate simulation of the milling process. International Journal of Machine Tools & Manufacture 42: 663–674
Cakir M.C., Gürarda A. (2000) Optimization of machining conditions for multi-tool milling operations. International Journal of Production Research 38(15): 3537–3552
Cus F., Balic J. (2003) Optimization of cutting process by GA approach. Robotics and Computer Integrated Manufacturing 19: 113–121
El-Mounayri H., Kishawy H., Tandon V. (2002) Optimized CNC end-milling: A practical approach. International Journal Computer Integrated Manufacturing 15(5): 453–470
Giannakoglou K.C., Giotis A.P., Karakasis M.K. (2001) Low-cost genetic optimization based on inexact pre-evaluations and the sensitivity analysis of design parameters. Inverse Problems in Engineering 9: 389–412
Goldberg, D. E. (1989a). Genetic algorithms in search, optimisation and machine learning. Addison Wesley Publishing Company.
Goldberg, D. E. (1989b). Sizing populations for serial and parallel genetic algorithms. In Proceedings of 3rd International Conference on Genetic Algorithms and their applications (pp. 70–79).
Krimpenis, A., & Vosniakos, G. C. (2007). Hierarchical games combining standard and micro-genetic algorithms in multi-objective optimization. Engineering Applications of Artificial Intelligence, submitted for publication.
Lin T.R. (2002) Optimization technique for face milling stainless steel with multiple performance characteristics. International Journal of Advanced Manufacturing Technology 19: 330–335
Lin J.C., Tai C.C. (1999) Accuracy optimization for mould surface profile milling. International Journal of Advanced Manufacturing Technology 15: 15–25
Liu Y., Wang C. (1999) A modified genetic algorithm based optimisation of milling parameters. International Journal of Advanced Manufacturing Technology 15(11): 796–799
Nash J.F. (1951) Non-cooperative games. Annals of Mathematics 54: 286–295
NIST/SEMATECH. (2003). e-Handbook of statistical methods. National Institute of Standards and Technology, U.S.A., www.itl.nist.gov.
Onwubolu G.C. (2006) Performance-based optimization of multi-pass face milling operations using Tribes. International Journal of Machine Tools & Manufacture 46: 717–727
Ozcelik B., Oktem H., Kurtaran H. (2005) Optimum surface roughness in end milling Inconel 718 by coupling neural network model and genetic algorithm. International Journal Advanced Manufacturing Technology 27: 234–241
Park B.-T., Park M.-W., Kim S.-K. (2001) Generation and evolutionary learning of cutting conditions for milling operations. International Journal of Advanced Manufacturing Technology 17: 870–880
Roughgarden, T. (2004) Stackelberg scheduling strategies. SIAM Journal on Computing 33(2): 332–350
Seco Tools. (2006). Electronic catalogue. http://www.ecat.secotools.com.
Shunmugam M.S., Bhaskara Reddy S.V., Narendran T.T. (2000) Selection of optimal conditions in multi-pass face-milling using a genetic algorithm. International Journal of Machine Tools & Manufacture 40: 401–414
Sönmez A.İ., Baykasoğlu A., Dereli T., Filiz I.H. (1999) Dynamic optimization of multipass milling operations via geometric programming. International Journal of Machine Tools & Manufacture 39: 297–320
Tandon V., El-Mounayri H., Kishawy H. (2002) NC end milling optimization using evolutionary computation. International Journal of Advanced Manufacturing Technology 42: 595–605
Tansel I.N., Ozcelik B., Bao W.Y., Chen P., Rincon D., Yang S.Y., Yenilmez A. (2006) Selection of optimal cutting conditions by using GONNS. International Journal of Machine Tools & Manufacture 46: 26–35
Wang Z.G., Rahman M., Wong Y.S., Sun J. (2005) Optimization of multi-pass milling using parallel genetic algorithm and parallel genetic simulated annealing. International Journal of Machine Tools & Manufacture 45: 1726–1734
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Krimpenis, A., Vosniakos, GC. Rough milling optimisation for parts with sculptured surfaces using genetic algorithms in a Stackelberg game. J Intell Manuf 20, 447–461 (2009). https://doi.org/10.1007/s10845-008-0147-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10845-008-0147-8