• Title/Summary/Keyword: layout problem

Search Result 350, Processing Time 0.021 seconds

Spatial Scheduling in Shipbuilding Industry

  • Duck Young Yoon;Varghese Ranjan;Koo Chung Kon
    • Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
    • /
    • 2004.05a
    • /
    • pp.106-110
    • /
    • 2004
  • In any large heavy industry like that of ship building, there exist a lot of complications for the arrangement of building blocks optimally for the minimal space consumption. The major problem arises at yard because of laxity in space for arranging the building blocks of ship under construction. A standardized erection sequence diagram is generally available to provide the prioritised erection sequence. This erection sequence diagram serves as the frame work. In order to make a timely erection of the blocks a post plan has to be developed so that the blocks lie in the nearest possible vicinity of the material handling devices while keeping the priority of erection. Therefore, the blocks are arranged in the pre-erection area. This kind of readiness of blocks leads to a very complex problem of space. This arises due to the least available space leading to an urgent need of an availability of intelligent spatial schedule without compromising the rate of production. There exists two critical problems ahead namely, the spatial occupation layout of pre-erection area and the emptying pattern in the spatial vicinity. The block shape is assumed be rectangular. The related input data's are the dates of erection (earliest as well as the latest), geometrical parameters of block available on pre-erection area, slack time and the like.

  • PDF

Development of a software based calibration system for automobile assembly system oriented AR (자동차 조립시스템 지향 AR을 위한 소프트웨어 기반의 캘리브레이션 시스템 개발)

  • Park, Jin-Woo;Park, Hong-Seok
    • Korean Journal of Computational Design and Engineering
    • /
    • v.17 no.1
    • /
    • pp.35-44
    • /
    • 2012
  • Many automobile manufacturers are doing experiment on manufacturing environments by using an augmented reality technology. However, system layout and process simulation by using the virtual reality technology have been performed actively more than by using the augmented reality technology in practical use so far. Existing automobile assembly by using the augmented reality requires the precise calibrating work after setting the robot because the existing augmented reality system for the automobile assembly system configuration does not include the end tip deflection and the robot joints deflection due to the heavy weight of product and gripper. Because the robot is used mostly at the automobile assembly, the deflection problem of the robot joint and the product in the existing augmented reality system need to be improved. Moreover camera lens calibration has to be performed precisely to use augmented reality. In order to improve this problem, this paper introduces a method of the software based calibration to apply the augmented reality effectively to the automobile assembly system. On the other hand, the camera lens calibration module and the direct compensation module of the virtual object displacement for the augmented reality were designed and implemented. Furthermore, the developed automobile assembly system oriented AR-system was verified by the practical test.

Minimum Crosstalk Layer Assignment for Three Layers Gridded Channel Routing (삼층 그리드 채널 배선을 위한 최소 혼신 배선 층 할당 방법)

  • Jhang, Kyoung-Son
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.8
    • /
    • pp.2143-2151
    • /
    • 1997
  • As inter-wire spacing on a VLSI chip becomes smaller with the evolution of VLSI fabrication technology, coupling capacitance between adjacent wires is increasing rapidly over ground capacitance. Therefore, it becomes necessary to take into account the crosstalk caused mainly by coupling capacitance during the layout design of VLSI systems. This paper deals with layer assignment problem to minimize crosstalk in three layers gridded channel routing. The problem is formulated in 0/1 integer linear programming style. Upper bound for cost function is estimated for the fast termination. Experiment shows the effectiveness of our approach to minimize crosstalk.

  • PDF

A Simulation Study of Urban Public Transport Transfer Station Based on Anylogic

  • Liu, Weiwei;Wang, Fu;Zhang, Chennan;Zhang, Jingyu;Wang, Lei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.4
    • /
    • pp.1216-1231
    • /
    • 2021
  • With the increase in the population of our cities and the rapid increase in the number of private cars, urban traffic has become more and more congested. At this stage, urban public transportation has become one of the main ways to improve urban traffic congestion. Aiming at the problem of how to improve the basic capacity of buses in multi-line transfer stations, this paper conducts simulation research based on anylogic software. Through micro-simulation analysis of vehicles entering, stopping, and exiting the station, combined with the delay model theory, the vehicle is given Stop organization optimization and station layout improvement methods, so that vehicles can run in the station more stably, smoothly and safely. Case analysis shows that applying this method to the roadside parking problem, the main and auxiliary bus stations have a significant improvement in operating capacity compared with the conventional tandem double bus stations, and the service level of the main and auxiliary bus stations has been significantly improved.

Controller Backup and Replication for Reliable Multi-domain SDN

  • Mao, Junli;Chen, Lishui;Li, Jiacong;Ge, Yi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.12
    • /
    • pp.4725-4747
    • /
    • 2020
  • Software defined networking (SDN) is considered to be one of the most promising paradigms in the future. To solve the scalability and performance problem that a single and centralized controller suffers from, the distributed multi-controller architecture is adopted, thus forms multi-domain SDN. In a multi-domain SDN network, it is of great importance to ensure a reliable control plane. In this paper, we focus on the reliability problem of multi-domain SDN against controller failure from perspectives of backup controller deployment and controller replication. We firstly propose a placement algorithm for backup controllers, which considers both the reliability and the cost factors. Then a controller replication mechanism based on shared data storage is proposed to solve the inconsistency between the active and standby controllers. We also propose a shared data storage layout method that considers both reliability and performance. Besides, a fault recovery and repair process is designed based on the controller backup and shared data storage mechanism. Simulations show that our approach can recover and repair controller failure. Evaluation results also show that the proposed backup controller placement approach is more effective than other methods.

Optimal 3-D Packing using 2-D Slice Data for Multiple Parts Layout in Rapid Prototyping (신속시작작업에서 2차원 단면데이터를 이용한 3차원 물체의 최적자동배치를 위한 알고리즘의 개발)

  • 허정훈;이건우;안재홍
    • Korean Journal of Computational Design and Engineering
    • /
    • v.2 no.3
    • /
    • pp.195-210
    • /
    • 1997
  • In Rapid Prototyping process, the time required to build multiple prototype parts can be reduced by packing several parts optimally in a work volume. Interactive arrangement of the multiple parts is a tedious process and does not guarantee the optimal placement of all the parts. In this case, packing is a kind of 3-D nesting problem because parts are represented by STL files with 3-D information. 3-D nesting is well known to be a problem requiring an intense computation and an efficient algorithm to solve the problem is still under investigation. This paper proposes that packing 3-D parts can be simplified into a 2-D irregular polygon nesting problem by using the characteristic of rapid prototyping process that the process uses 2-dimensional slicing data of the parts and that slice of the STL parts are composed of polygons. Our algorithm uses no-fit-polygon (NFP) to place each slice without overlapping other slices in the same z-level. The allowable position of one part at a fixed orientation for given parts already packed can be determined by obtaining the union of all NFP's that are obtained from each slice of the part. Genetic algorithm is used to determine the order of parts to be placed and orientations of each part for the optimal packing. Optimal orientation of a part is determined while rotating it about the axis normal to the slice by finite angles and flipping upside down. This algorithm can be applied to any rapid prototyping process that does not need support structures.

  • PDF

Teaching the Comprehension of Word Problems through Their Mathematical Structure in Elementary School Mathematics (초등수학에서 문장제의 수학적 구조 파악을 통한 문장제 이해 지도 방안)

  • Ra, Woo-Seong;Paik, Suck-Yoon
    • Journal of Elementary Mathematics Education in Korea
    • /
    • v.13 no.2
    • /
    • pp.247-268
    • /
    • 2009
  • The purpose of this study was to examine the mathematical components of word problems and the structure of the components, to examine the characteristics of the understanding of mathematics high achievers about word problems, and ultimately to devise a teaching method geared toward facilitating learner understanding of the word problems. Given the findings of the study, the following conclusion was reached: First, word problems could be categorized according to their mathematical components, namely the mathematical structure of multiple variables provided to learners for their problem solving. And learner's reaction might hinge on the type of word problems. Second, the mathematics high achievers relied on diverse strategies to understand the mathematical components of word problems to solve the problems. The use of diverse strategies made it possible for them to succeed in problem solving. Third, identifying the characteristics of the understanding of the mathematics high achievers about word problems made it possible to layout successful lesson plans that stressed understanding of the mathematical structure of word problems. And the teaching plans enabled the learners to get a better understanding of the given word problems.

  • PDF

Macro-model for Estimation of Maximum Power Dissipation of CMOS Digital Gates (CMOS 디지털 게이트의 최대소모전력 예측 매크로 모델)

  • Kim, Dong-Wook
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.10
    • /
    • pp.1317-1326
    • /
    • 1999
  • As the integration ratio and operation speed increase, it has become an important problem to estimate the dissipated power during the design procedure as a method to reduce the TTM(time to market). This paper proposed a prediction model to estimate the maximum dissipated power of a CMOS logic gate. This model uses a calculational method. It was formed by including the characteristics of MOSFETs of which a CMOS gate consists, the operational characteristics of the gate, and the characteristics of the input signals. As the modeling process, a maximum power estimation model for CMOS inverter was formed first, and then a conversion model to convert a multiple input CMOS gate into a corresponding CMOS inverter was proposed. Finally, the power model for inverter was applied to the converted result so that the model could be applied to a general CMOS gate. For experiment, several CMOS gates were designed in layout level by $0.6{\mu}m$ layout design rule. The result by comparing the calculated results with those from HSPICE simulations for the gates showed that the gate conversion model has within 5% of the relative error rate to the SPICE and the maximum power estimation model has within 10% of the relative error rate. Thus, the proposed models have sufficient accuracies. Also in calculation time, the proposed models was more than 30 times faster than SPICE simulation. Consequently, it can be said that the proposed model could be used efficiently to estimate the maximum dissipated power of a CMOS logic gate during the design procedure.

  • PDF

A Location-based Service on Smartphone Combining with Mirror World (미러월드 연계를 통한 스마트폰에서의 위치기반 서비스)

  • Oh, Gyu-Hwan;Kim, Jae-Won;Bae, Kyoung-Woo
    • Journal of Korea Game Society
    • /
    • v.11 no.1
    • /
    • pp.47-57
    • /
    • 2011
  • Mobile based location-based service can normally be classified into four categories according to their dimensions of their screen layout: map-based, bird-eye view based, photo-based, and video-based. Specifically, video-based layout system combining AR technology has a appealing factor to users through the reality-based presence but normally requires sophisticated real-time image matching algorithms to represent the system. This paper provides a new location-based service by introducing mirror world to resolve the problem and implements its prototype. The proposed service does not need such algorithm and will effectively be useful for users to get the reality of the presence for any locations which is regardless of a user's real location.

Integrated Decision-making for Sequencing and Storage Location of Export Containers at a Receiving Operation in the Container Terminal with a Perpendicular Layout (수직 배치형 컨테이너 터미널 반입작업에서 수출 컨테이너의 작업순서와 장치위치 통합 의사결정)

  • Bae, Jong-Wook;Park, Young-Man
    • Journal of Navigation and Port Research
    • /
    • v.35 no.8
    • /
    • pp.657-665
    • /
    • 2011
  • This study deals with an integrated problem for deciding sequencing and storage location of export containers together at its receiving operation in the container terminal with a perpendicular layout. The preferred storage location of an export container varies with the priority of the corresponding loading operation and the waiting time of an external truck depends on its storage time. This paper proposes the mixed integer programming model considering the expected arrival time and expected finish time of an external truck and the preferred storage location for its loading operation. And we suggest the heuristic algorithm based on a simulated annealing algorithm for real world adaption. We compare the heuristic algorithm with the optimum model in terms of the computation times and total cost and the performance of the heuristic algorithm is analyzed through a numerical experiment.