Large neighbourhood search algorithm for type-II assembly line balancing problem

40929

This paper proposes a large neighbourhood search (LNS) algorithm for type-II simple assembly line balancing problem (SALBP-II). The LNS algorithm was initially developed for solving vehicle routing problem and its later implementations were used to solve scheduling problems. The reported results about these two problems indicate that LNS algorithm is a powerful method. Vehicle routing problem has the main objective to find the optimal match between a certain number of routes and a certain number of customers, while SALBP-II is trying to find the optimal match between a certain number of workstations and a certain number of assembly operations. To our point of view, LNS algorithm would also be a powerful method for solving SALBP-II due to the structural similarity between these two problems. Within this context, a LNS algorithm is developed to tackle SALBP-II and the performance of the proposed algorithm is tested on a set of benchmark instances. Computational results indicate the satisfactory performance of LNS algorithm in solving SALBP-II.

444

Large neighbourhood search algorithm , Assembly line balancing , Maximizing production rate , Meta , heuristic

Pamukkale University Journal Of Engineering Sciences

450

Pamukkale University Journal Of Engineering Sciences