Handling constraints for manufacturing process optimisation using genetic algorithms
by Jing Ying Zhang, John B. Morehouse, Steven Y. Liang, Jun Yao, Xiaoqin Zhou
International Journal of Computer Applications in Technology (IJCAT), Vol. 28, No. 1, 2007

Abstract: Handling constraints is a common challenge to all optimisation methods. To no exception is the planning and optimisation of manufacturing processes that often involves a number of constraints reflecting the complicated reality of manufacturing to which the pursuit of the best operation condition is subject. Mathematical models describing today's manufacturing processes are generally discontinuous, non-explicit, and not analytically differentiable; all of which renders traditional optimisation methods difficult to apply. Genetic Algorithm (GA) is known to provide an optimisation platform method capable of treating highly nonlinear and ill-behaved complex problems, thereby making it an appealing candidate. However, several issues in regard to the handling constraints must be rigorously addressed in order for GA to become a viable and effective method for manufacturing optimisation. In this paper, a new constraint handling strategy combined with (α,μ)-population initialisation is proposed. Twelve numerical test cases and one surface grinding process optimisation are presented to evaluate its optimisation performance.

Online publication date: Tue, 06-Feb-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com