The full text of this article

 

A new hybrid genetic algorithm to solve more realistic mixed-model assembly line balancing problem
by Ibrahim Kucukkoc; Ramazan Yaman
International Journal of Logistics Systems and Management (IJLSM), Vol. 14, No. 4, 2013

 

Abstract: Continuous and unexpected changes in demands of customised products force companies to produce various types of products, concurrently. One of the intelligent methods to satisfy various customer demands and compete with rivals in today's business environment is to assemble diverse models on the same assembly line, simultaneously. So, mixed-model assembly line balancing problem with parallel workstations and zoning constraints is studied in this paper. Firstly, relevant studies in the literature were presented in a summary. Then, solutions have been sought with hybrid genetic algorithm that is obtained from the combination of modified Comsoal method and genetic algorithm. Computational experiments were carried out on 20 benchmark problems to demonstrate the superiority of the proposed algorithm. The obtained results were compared with the results of pure genetic algorithm and other previous researches. Obviously, it has been observed that proposed algorithm has promising solution capacity especially on large-sized mixed-model assembly line balancing problems.

Online publication date: Thu, 21-Mar-2013

 

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 Logistics Systems and Management (IJLSM):
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