Abstract
In many industries, inspection data is determined to merely serve for verification and validation purposes. It is rarely used to directly enhance the product quality because of the lack of approaches and difficulties of doing so. Given that a batch of subassembly items have been inspected, it is sometimes more profitable to exploit the data of the measured features of the subassemblies in order to further reduce the variation in the final assemblies so the rolled yield throughput is maximized. This can be achieved by selectively and dynamically assembling the subassemblies so we can maximize the throughput of the final assemblies. In this paper, we introduce and solve the dynamic throughput maximization (DTM) problem. The problem is found to have grown substantially by increasing the size of the assembly (number of subassembly groups and number of items in each group). Therefore, we resort to five algorithms: simple greedy sorting algorithm, two simulated annealing (SA) algorithms and two ant colony optimization (ACO) algorithms. Numerical examples have been solved to compare the performances of the proposed algorithms. We found that our ACO algorithms generally outperform the other algorithms.
Similar content being viewed by others
References
Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE T Syst Man Cy B 26(1):29–41
Dorigo M, Stützle T (2004) Ant colony optimization. The MIT Press, Cambridge, USA
Kannan SM, Jayabalan V, Jeevanantham K (2003) Genetic algorithm for minimizing assembly variation in selective assembly. Int J Prod Res 41(14):3301–3313
Musa R, Chen FF, Ghoniem AS (2006) Dynamic variation reduction technique in assembly lines after batch inspection. In: Industrial engineering research conference (IERC) proceedings, Orlando, FL
Musa R, Chen FF, Sturges RH (2006) Simple rules to achieve variation reduction based on optimal subassembly part mating. Presented at the international symposium on flexible manufacturing (ISFA), Osaka, Japan
Musa R, Sturges RH, Chen FF (2006) Agile inspection planning using CAD data. Comput-Aided Des Appl 3(1–4):69–78
Pugh GA (1992) Selective assembly with components of dissimilar variance. Comput Ind Eng 23(1–4):487–491
Pugh GA (1986) Partitioning for selective assembly. Comput Ind Eng 11:175–179
Tovey CA (2002) Tutorial on computational complexity. Interfaces 32(3):30–61
Whitney DE (2004) Mechanical assemblies. University Press, Oxford, UK
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Musa, R., Chen, F.F. Simulated annealing and ant colony optimization algorithms for the dynamic throughput maximization problem. Int J Adv Manuf Technol 37, 837–850 (2008). https://doi.org/10.1007/s00170-007-1005-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-007-1005-0