Modeling and solving mixed-model assembly line balancing problem with setups. Part II: A multiple colony hybrid bees algorithm

This paper is the second one of the two papers entitled Modeling and Solving Mixed-Model Assembly Line Balancing Problem with Setups, which deals with the mixed-model assembly line balancing problem of type I (MMALBP-I) with some particular features of the real world problems such as parallel workstations, zoning constraints and sequence dependent setup times between tasks. Due to the complex nature of the problem, we tackled the problem with bees algorithm (BA), which is a relatively new member of swarm intelligence based meta-heuristics and tries to simulate the group behavior of real honey bees. However, the basic BA simulates the group behavior of real honey bees in a single colony; we aim at developing a new BA, which simulates the group behavior of honey bees in a single colony and between multiple colonies. The multiple colony type of BA is more realistic than the single colony type because of the multiple colony structure of the real honey bees; each colony represents the honey bees living in a different hive and is generated with a different heuristic rule. The performance of the proposed multiple colony algorithm is tested on 36 representatives MMALBP-I extended by adding low, medium and high variability of setup times. The results are compared with single colony algorithms in terms of solution quality and computational times. Computational results indicate that the proposed multiple colony algorithm has superior performance. Part II of the paper also presents optimal solutions of some problems provided by MILP model developed in Part I. (C) 2014 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.