A simulation based harmony search algorithm for part routing optimization problem
Ayşe Tuğba Dosdoğru Aslı Boru Mustafa Göçken
AbstractIn production systems, one of the main part routing problems is the determining the best process sequence and the best machine-operation pairing. In real world systems, flexibility is important to provide alternative part routings. The system is considered flexible when certain operation of a part can be processed on more than one machine. However, flexibility increases the complexity of system. This paper deals with assignment of operations to a machine and determining the best process plan for each part under flexible environment. We used a harmony search algorithm to cope with highly complex and nonlinear problem in which makespan is considered as the objective function and evaluated by using a simulation model.