Abstract
This paper presents a new model inspired from DNA bio-chemical procedures to rearrange a robot in a flexible manufacturing system to assemble different products. In a bio-chemical wet laboratory, DNA process can provide powerful massive parallelism with energy efficiency in overall search of all possible solutions. These characteristics are useful especially when dealing with a complex calculation e.g. an NP hard problem such as to a scheduling task in production line. We present a detailed algorithm and illustrate how the essential procedure for scheduling problem is realized through a DNA computing mechanism. Some experiments were conducted to show the performance of the proposed approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Browne, J., Harhen, J., Shivnan, J.: Production management systems. Addison-Wesley, New York (1996)
Logendran, R., Srikandarajah, C.: Sequencing of robot activities and parts in two-machines robotic cells. Internet. Journal of Production Research 34, 3447–3463 (1996)
Lopez-Juarez, I., Corona-Castuera, J., Pena-Cabrera, M., Ordaz-Hernandez, K.: On the design of intelligent robotic agents for assembly. International Journal of Information Sciences 171, 377–402 (2005)
Adleman, L.: Moleculer Computational of solutions to combinatorial problems. Science 226, 1021–1024 (1994)
Akbarimajd, A., Mehdizadeh, K., Nekoi, M.A., Sabahi, K.: A modified DNA-computing algorithm to solve TSP. In: Proceeding of 2006 IEEE International Conference on Mechatronic, pp. 65–68. IEEE, Los Alamitos (2006)
Wang, Z., Xiao, D., Li, W., He, L.: A DNA procedure for solving the shortest path problem. Journal of Applied Mathematics and Computation 183(1), 79–84 (2006)
Han, A., Zhu, D.: DNA computing model for minimum spanning tree problem. In: Proceeding of Symbolic and numeric Algorithms for Scientific Computing, SYNAC ’06, Eight International Symposium on, pp. 372–377 (September 2006)
Yin, Z., Cui, J., Yan, Y., Ma, Y.: Job shop scheduling problem based on DNA computing. Journal of Systems Engineering and Electronics 17(3), 645–659 (2006)
Tsaftaris, S.A., Katsaggelos, A.K., Pappas, T.N., Popoutsakis, E.T: How can DNA computing be applied to digital signal processing? Signal Processing Magazine 21(6), 57–61 (2006)
Jeng, D.J.-F., Kim, I., Watada, J.: Bio-Soft computing with fixed-lenght DNA to a group control optimization problem. Soft Computing (forthcoming)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abu Bakar, R.B., Watada, J. (2007). A Bio-soft Computing Approach to Re-arrange a Flexible Manufacturing Robot. In: Apolloni, B., Howlett, R.J., Jain, L. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2007. Lecture Notes in Computer Science(), vol 4694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74829-8_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-74829-8_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74828-1
Online ISBN: 978-3-540-74829-8
eBook Packages: Computer ScienceComputer Science (R0)