Genetic Algorithm Modelling and Solution of Inspection Path Planning on a Coordinate Measuring Machine (CMM)
暂无分享,去创建一个
A multiple component inspection path planning problem (MCIPP) can be formulated as an optimisation problem, referred to as a non-deterministic polynomial complete problem (NP). An MCIPP consists of testing points, which will be visited by a CMM probe only once, and dummy points which are set to avoid collision and may be visited by a CMM probe more than once. This paper considers the application of genetic algorithms (GAs) acting as optimisers for optimal inspection path planning systems. The paper explores the techniques used in the GA optimal inspection path planning system. The paper also discusses the comparison of integer programming models and genetic models.
[1] J. K. Lenstra,et al. Complexity of vehicle routing and scheduling problems , 1981, Networks.
[2] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .