Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

An Integrated Approach to Optimal Three Dimensional Layout and Routing

Published

Author(s)

Simon Szykman, J Cagan, P Weisser

Abstract

This paper describes the combination of previously-developed component placement and routing algorithms into an integrated computational approach to product layout optimization. Previous work introduced simulated annealing-based algorithms for optimal component packing (Szykman and Cagan, 1995), con strained layout (Szykman and Cagan, 1997), and routing (Szyk man and Cagan, 1996). These problems exhibit ill-behaved (multi-modal and discontinuous) objective function spaces, which were optimized with a simulated annealing-based algo rithm (Kirkpatrick et al., 1983). The utility of these algorithms has been demonstrated on a variety of problems, including the layout of electronic switching systems (Szykman, 1995), a cordless power drill (Szykman and Cagan, 1997) and components for a wearable computer (Camp bell et al., 1995), as well as routing of a chemical production plant (Szykman and Cagan, 1996). The broad spectrum of prod uct layout tasks in engineering includes other applications such as layout of HVAC equipment, automobile engine compart ments, mechanical and electromechanical assemblies, and aero space applications.
Citation
Journal of Mechanical Design-Transactions of the ASME
Volume
Vol. 120, No. 3

Keywords

dimensional layout, integrated approach, optimal

Citation

Szykman, S. , Cagan, J. and Weisser, P. (1998), An Integrated Approach to Optimal Three Dimensional Layout and Routing, Journal of Mechanical Design-Transactions of the ASME, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=821540 (Accessed March 28, 2024)
Created January 1, 1998, Updated February 19, 2017