Layout of functional modules and routing for preliminary design of automatic teller machines

• Autorzy: Inoue K. , Masuyama T. , Osaki H. , Ito T.
• Języki publikacji: EN

Abstrakty

EN

In this study we address the preliminary design for the module layout and bill conveyance routes of automatic teller machines (ATMs). We determine a two-dimensional layout for the modules as below that are approximately rectangular if the ATM is viewed from the side. ATMs require the compact placement of modules within the chassis and conveyance routes that smoothly circulate bills. However, the intersection and overlapping of routes by which the bills are conveyed in opposite directions are not allowed. Applying the bottom-left method and route-design-oriented packing method to the layout of the modules and the direction-oriented maze routing expediting branching and interflow of routes to the bill conveyance route, the application orders are optimized simultaneously using genetic algorithms (GAs). Results show that suitable designs for the ATM including the case when modules are selected as well as placed are achievable using the above simultaneous optimization. The design intention is expressible by changing the weights associated with chassis dimensions, route lengths and the number of route bends, which compose the objective function. The proposed method is useful for efficiently advancing the preliminary design of ATMs. Finally, if island models pursuing individual targets are used along with a GA, the design becomes even more efficient.

Słowa kluczowe

EN

Module Layout; routing; simultaneous optimization; genetic algorithms; Design Intention; island model

• Wydawca: Łukasiewicz Industrial Research Institute for Automation and Measurements PIAP
• Czasopismo: Journal of Automation Mobile Robotics and Intelligent Systems
• Rocznik: 2007
• Tom: Vol. 1, No. 4
• Strony: 30--40
• Opis fizyczny: Bibliogr. 14 poz., rys.

Twórcy

autor

Inoue K.

autor

Masuyama T.

autor

Osaki H.

autor

Ito T.

• Department of Mechanical Engineering, Tsuruoka National College of Technology, Japan,

Bibliografia

• [1] Sessomboon W., Nakano H., Irohara T. and Yoshimoto, K., “A Technique to Solve Dynamic Layout Problem with Fixed and Rectangular Departments”; Transactions of the Japan Society of Mechanical Engineers, Series C, vol. 63-615, 1997, pp. 4050-4056. (in Japanese)
• [2] Sessomboon W., Murofushi T., Irohara T. and Yoshimoto K., “A Layout Technique for Unequal Area and Shape Departments Considering Main Aisle”; Transactions of the Japan Society of Mechanical Engineers, Series C, vol. 63-615, 1997, pp. 4057-4064. (in Japanese)
• [3] Sessomboon W., Sugiyama M., Irohara T. and Yoshimoto K., “A Design Technique of AGF Flow Path by Considering Machine Layout”; Transactions of the Japan Society of Mechanical Engineers, Series C, vol. 64-617, 1998, pp. 370-376.(in Japanese)
• [4] Shirai Y. and Matsumoto N., “Simultaneous Optimization of Floor and Aisle Planning for Facility Layout Problems”; Transactions of the Japan Society of Mechanical Engineers, Series C, vol. 65-632, 1999, pp. 1593-1600. (in Japanese)
• [5] Masuyama T., Kobayashi T., Fukatsu K., Yamanaka M. and Inoue K., “Layout Design of Functional Modules and Connecting Routes (Tuning of Weight in GA-based Design of Automated Teller Machine)”; Journal of Japan Society for Design Engineering, vol. 36, no. 4, 2001, pp. 157-163. (in Japanese)
• [6] Inoue K., Osaki H., Masuyama T. and Fukatsu K., “Layout Design of Functional Modules and Routing for Their Connection Considering the Route Divergence and Confl uence (Layout Design of Modules and Routing for Automatic Teller Machine)”; Transactions of the Japan Society of Mechanical Engineers, Series C, vol. 68-655, 2002, pp. 331-338. (in Japanese)
• [7] Koopmans T.C. and Beckmann M.J., “Assignment Programs and Location of Economic Activities”; Econometrica, 1957, vol. 25, 1957, pp. 53.
• [8] Lee R.C. and Moore J.M., “Computerized Relationship Layout Planning”; Journal of Industrial Engineering, vol. 18, no. 3, 1967, pp. 194-200.
• [9] Tate D.M. and Smith A.E., “Unequal-area Facility Layout by Genetic Search”; IIE Transactions, vol. 27, no. 4, 1995, pp. 465-472.
• [10] Stefan J., “On Genetic Algorithm for the Packing of Polygons”; European Journal of Operational Research, vol. 88, no. 1, 1996, pp. 165-181.
• [11] Kimura M., Shiraishi Y., Himeno F., Hanaki, S. and Kusaoke M., “A Grid-Free Maze Router”; The Institute of Electronics, Information and Communication Engineers Transactions, Series A, vol. J74-A-8, 1991, pp. 1294-1301. (in Japanese)
• [12] Lee C.Y., “An Algorithm for Path Connections and Its Application”; IRE Transactions Electronic Computers, vol. EC-10, 1961, pp. 346-365.
• [13] Goldberg D.E., “Genetic Algorithms in Search, Optimization and Machine Learning”, 1989, Addison Wesley.
• [14] Inoue K., Fueki H., Ohmachi T. and Kato M., “An application of Genetic Algorithms to Design of Stiffened Plates”. In: Proc. International Conference on Engineering Design, International Society for the Science of Engineering Design, 1995, pp. 1369-1377.