• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.6
• /
• pp.1034-1039
• /
• 1987

In this paper, an automatic routing algorithm using Fringe is described. The concept of the Fringe is very simple, but it provides a powerful and flexible tool for doing single layer routing. The automatic routing program is coded using C language, and implemented on a VAX11/750 and IBM -PC AT computer. The usefulness of the routing algorithms is shown by the execution of the program on some examples.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.5 no.3
• /
• pp.468-477
• /
• 2013

An automatic pipe routing system is proposed and implemented. Generally, the pipe routing design as a part of the shipbuilding process requires a considerable number of man hours due to the complexity which comes from physical and operational constraints and the crucial influence on outfitting construction productivity. Therefore, the automation of pipe routing design operations and processes has always been one of the most important goals for improvements in shipbuilding design. The proposed system is applied to a pipe routing design in the engine room space of a commercial ship. The effectiveness of this system is verified as a reasonable form of support for pipe routing design jobs. The automatic routing result of this system can serve as a good basis model in the initial stages of pipe routing design, allowing the designer to reduce their design lead time significantly. As a result, the design productivity overall can be improved with this automatic pipe routing system.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.4
• /
• pp.81-86
• /
• 2003

Current growth of VLSI design depends critically on the research and development of automatic layout tool. Automatic layout is composed of placement assigning a specific shape to a block and arranging the block on the layout surface and routing finding the interconnection of all the nets. Algorithms performing placement and routing impact on performance and area of VLSI design. Switchbox routing is a problem interconnecting each terminals on all four sides of the region, unlike channel routing. In this paper we propose a genetic algorithm searching solution space for switchbox routing problem. We compare the performance of proposed genetic algorithm(GA) for switchbox routing with that of other switchbox routing algorithm by analyzing the results of each implementation. Consequently experimental results show that out proposed algorithm reduce routing length and number of the via over the other switchbox routing algorithms.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.4
• /
• pp.592-602
• /
• 1995

Non-grid and grid method are used for modeling the routing region of the automatic routing system. In this study, we develop the automatic routing system by mixing the methods of non-grid and grid to improve the speed of routing. Grid method has a demerit which decreases the automatic routing speed because it is required a lot of memory by the limitation of the size of board and grid, although the electrical and physical elements are insufficient on the PCB, But non-grid is spent gurite less memory than grid method by using a shape-based patterns. Therefore, we used the methods of non-grid and grid altogether in this paper, In the former method, it is attributed to the improvement of speed, the latter one is applied only the connection of the failed routing in the former one, and it performs the complete automatic routing. This system was developed with C＋＋language under the Windows NT environment of IBM 486DX2-66 Computer.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.5
• /
• pp.572-579
• /
• 1988

In this paper, a system of automatic placement and routing for gate array layout design is proposed. In the placement stage, the circuit is partitioned and using the concept of min-cut slicing, and each partitioned module is placed, so that the routing density over the entire chip be uniformized and the total wiring length be minimized. In the global routing stage, the concept of the probabilistic routing density is introduced to unify the wiring congestions in each channel. In the detailed routing stage, the multi-terminal nets are partitioned into the two-terminal nets. The ordered channel graph is proposed which implies the vertical and the horizontal constranint graphs simultaneously. And using the ordered channel graph, the proposed routing algorithm assigns the signal nets to the tracks. Also the proposed placement and routing algorithms are implimented on IBM/PC-AT to construct PC-level gate array layout system.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2009.06a
• /
• pp.149-150
• /
• 2009

The problem of vehicle routing problem(VRP) with pair operations of pick up and delivery are well-known in real applications in logistics networks, as in planning the routes for automatic guided vehicles(AGVs) in an automatic container terminal(ACT), warehouses or in some just-in-time services. This paper will present a formulation to modeling the problem mathematically which can be used to generate optimal routes of carried vehicles in the field to reduce the incurred cost of moving goods. This selected model could be used in (semi-)automatic short-term planning systems for vehicle fleet working in ACT, or in modern warehouses which the long list of requests is parted and sorted in preprocessing orders systems.

• International conference on construction engineering and project management
• /
• 2022.06a
• /
• pp.776-783
• /
• 2022

Since Mechanical, Electrical, and Plumbing(MEP) routing is a repetitive and experience-centered process that requires considerable time and human resources, if automated, design errors can be prevented and the previously required time and human resources can be reduced. Although research on automatic routing has been conducted in many industries, the MEP routing in AEC projects has yet to be identified due to the complexity of system configuration, distributed expertise, and various constraints. Therefore, the purpose of this study is to identify the target subjects for MEP routing automation and the constraints of each subject. The MEP design checklist provided by a CM company and existing literature review were conducted, and target subjects and constraints were identified through process observation and in-depth expert interviews for five days by visiting a MEP design company. The target subjects were largely divided into six categories: air conditioning plumbing, air conditioning duct, restroom sanitary plumbing, heating plumbing, and diagram. The findings from interviews show that work reduction and error reduction has the greatest effect on air conditioning plumbing while the level of difficulty is the highest in air conditioning duct and restroom sanitary plumbing. Major constraints for each subject include preventing cold drafts on air conditioning pipes, deviation in ventilation volume in air conditioning ducts, routing order on restroom sanitary plumbing, and separation distance from the wall on heating plumbing. In this way, subjects and constraints identified in this study can be used for MEP automatic routing.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.1
• /
• pp.64-70
• /
• 2003

Current growth of VLSI design depends critically on the research and development (If automatic layout tool. Automatic layout is composed of placement assigning a specific shape to a block and arranging the block on the layout surface and routing finding the interconnection of all the nets. Algorithms Performing placement and routing impact on Performance and area of VLSI design. Channel routing is a problem assigning each net to a track after global routing and minimizing the track that assigned each net. In this paper we propose a genetic algorithm searching solution space for the netlist partitioning problem for 4-layer channel routing. We compare the performance of proposed genetic algorithm(GA) for channel routing with that of simulated annealing(SA) algorithm by analyzing the results which are the solution of given problems. Consequently experimental results show that out proposed algorithm reduce area over the SA algorithm.

• The KIPS Transactions:PartA
• /
• v.11A no.4
• /
• pp.267-276
• /
• 2004

The modeling methods of routing region used in the automatic placement/routing system are a grid and non-grid. Because the gird method is curbed by its size and a board if the electrical and physical elements on PCB are of small quantity, it has many memories. Therefore, it has demerit which decreases the speed of automatic placement/routing. The Shape-based type, non-grid method, makes the shapes exist as an in dividual element in a memory by using a region-processing method. Each individual element needs very small memory since it has its unique data size. Therefore, this paper aimed to develope the automatic placement/routing system which can automatically place and route the PCB without dissipation of memory at a high speed. To this aim, the auction algorithm method was applied which can make the memories be most rapidly reached from the original point to various destinations. Also, this system was developed by the Visual C++ in the Widows environment of IBM Pentium computer in order to use it in an individual PC system.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1609-1612
• /
• 2004

Ad hoc network is a kind of new wireless network paradigm for mobile hosts. Ad Hoc wireless networks consist of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. Mobile hosts rely on each other to keep the network connected. Each host is not only mobile hosts but also router. So how to design a routing protocol is the most important problem. Dynamic source routing is a kind of routing protocol. In this paper we suggest a new automatic route shortening method and an energy-aware routing mechanism based on DSR.