• Title/Summary/Keyword: 제약성 최적화

Search Result 365, Processing Time 0.029 seconds

Optimization of Dispatching Strategies for Stacking Cranes Including Remarshaling Jobs (재정돈을 포함한 장치장 크레인의 작업 할당 전략 최적화)

  • Kim, Taekwang;Yang, Youngjee;Bae, Aekyoung;Ryu, Kwang Ryul
    • Journal of Navigation and Port Research
    • /
    • v.38 no.2
    • /
    • pp.155-162
    • /
    • 2014
  • In container terminals, stacking yard is the place where import and export containers are temporarily stored before being loaded onto or after being discharged from a ship. Since all the containers go through the stacking yard in their logistic flow, the productivity of the terminal critically depends on efficient operation of stacking yard, which again depends on how well the stacking locations of the incoming containers are determined. However, a good location for stacking an incoming container later can turn out to be a bad one when that container is to be fetched out of the stacking yard, especially if some rehandling is required. This means that good locations for the containers are changing over time. Therefore, in most container terminals, the so-called remarshaling is done to move the containers from bad location to good locations. Although there are many previous works on remarshaling, they all assume that the remarshaling can be done separately from the main jobs when the cranes are idle for rather a long period of time. However, in reality, cranes are hardly available for a period long enough for remarshaling. This paper proposes a crane dispatching strategy that allows remarshaling jobs to be mixed together with the main jobs whenever an opportunity is detected. Experimental results by simulation reveals that the proposed method effectively contributes to the improvement of terminal productivity.

Optimizing Similarity Threshold and Coverage of CBR (사례기반추론의 유사 임계치 및 커버리지 최적화)

  • Ahn, Hyunchul
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.8
    • /
    • pp.535-542
    • /
    • 2013
  • Since case-based reasoning(CBR) has many advantages, it has been used for supporting decision making in various areas including medical checkup, production planning, customer classification, and so on. However, there are several factors to be set by heuristics when designing effective CBR systems. Among these factors, this study addresses the issue of selecting appropriate neighbors in case retrieval step. As the criterion for selecting appropriate neighbors, conventional studies have used the preset number of neighbors to combine(i.e. k of k-nearest neighbor), or the relative portion of the maximum similarity. However, this study proposes to use the absolute similarity threshold varying from 0 to 1, as the criterion for selecting appropriate neighbors to combine. In this case, too small similarity threshold value may make the model rarely produce the solution. To avoid this, we propose to adopt the coverage, which implies the ratio of the cases in which solutions are produced over the total number of the training cases, and to set it as the constraint when optimizing the similarity threshold. To validate the usefulness of the proposed model, we applied it to a real-world target marketing case of an online shopping mall in Korea. As a result, we found that the proposed model might significantly improve the performance of CBR.

Optimum Design of Two Hinged Steel Arches with I Sectional Type (SUMT법(法)에 의(依)한 2골절(滑節) I형(形) 강재(鋼材) 아치의 최적설계(最適設計))

  • Jung, Young Chae
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.12 no.3
    • /
    • pp.65-79
    • /
    • 1992
  • This study is concerned with the optimal design of two hinged steel arches with I cross sectional type and aimed at the exact analysis of the arches and the safe and economic design of structure. The analyzing method of arches which introduces the finite difference method considering the displacements of structure in analyzing process is used to eliminate the error of analysis and to determine the sectional force of structure. The optimizing problems of arches formulate with the objective functions and the constraints which take the sectional dimensions(B, D, $t_f$, $t_w$) as the design variables. The object functions are formulated as the total weight of arch and the constraints are derived by using the criteria with respect to the working stress, the minimum dimension of flange and web based on the part of steel bridge in the Korea standard code of road bridge and including the economic depth constraint of the I sectional type, the upper limit dimension of the depth of web and the lower limit dimension of the breadth of flange. The SUMT method using the modified Newton Raphson direction method is introduced to solve the formulated nonlinear programming problems which developed in this study and tested out throught the numerical examples. The developed optimal design programming of arch is tested out and examined throught the numerical examples for the various arches. And their results are compared and analyzed to examine the possibility of optimization, the applicablity, the convergency of this algorithm and with the results of numerical examples using the reference(30). The correlative equations between the optimal sectional areas and inertia moments are introduced from the various numerical optimal design results in this study.

  • PDF

Forecasting Air Freight Demand in Air forces by Time Series Analysis and Optimizing Air Routing Problem with One Depot (군 항공화물수요 시계열 추정과 수송기 최적화 노선배정)

  • Jung, Byung-Ho;Kim, Ik-Ki
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.5
    • /
    • pp.89-97
    • /
    • 2004
  • The Korea Air Force(KAF) has operated freight flights based on the prefixed time and route schedule, which is adjusted once in a month. The major purpose of the operation of freight flights in the KAF is to distribute necessary supplies from the home air base to other air bases. The secondary purpose is to train the young pilots to get more experiences in navigation. Each freight flight starts from and returned to the home air base everyday except holidays, while it visits several other air bases to accomplish its missions. The study aims to forecast freight demand at each base by using time series analysis, and then it tried to optimize the cost of operating flights by solving vehicle routing problem. For more specifically, first, several constraints in operating cargos were defined by reviewing the Korea Air Force manuals and regulation. With such constraints, an integer programming problem was formulated for this specific routing problem allowing several visits in a tour with limitation of maximum number of visits. Then, an algorithm to solve the routing problem was developed. Second, the time series analysis method was applied to find out the freight demand at each air base from the mother air base in the next month. With the forecasted demands and the developed solution algorithm, the oprimum routes are calculated for each flight. Finally, the study compared the solved routing system by the developed algorithm with the existing routing system of the Korea Air Force. Through this comparison, the study proved that the proposed method can provide more (economically) efficient routing system than the existing system in terms of computing and monetary cost. In summary, the study suggested objective criteria for air routing plan in the KAF. It also developed the methods which could forecast properly the freight demands at each bases by using time series analysis and which could find the optimum routing which minimizes number of cargo needed. Finally, the study showed the economical savings with the optimized routing system by using real case example.

File System Support for Multimedia Streaming in Internet Home Appliances (인터넷 홈서버를 위한 스트리밍 전용 파일 시스템)

  • 박진연;송승호;진종현;원유집;박승민;김정기
    • Journal of Broadcast Engineering
    • /
    • v.6 no.3
    • /
    • pp.246-259
    • /
    • 2001
  • Due to recent rapid deployment of Internet streaming service and digital broadcasting service, the issue of how to efficiently support streaming workload in so called "Internet Home Appliance" receives prime interests from industry as well as academia. The underlying dilemma is that it may not be feasible to put cutting edge CPU, boards, disks and other peripherals into that type of device. The primary reason is its cost. Usually, Internet Home Appliances has its dedicated usage, e.g. Internet Radio, and thus it does not require high-end CPU nor high-end Va subsystem. The same reasoning applies to I/O subsystem. In Internet Home Appliances dedicated to handle compressed moving picture, it is not equipped with high end SCSI disk with fast rotational speed. Thus, it is mandatory to devise elaborate software algorithm to exploit the available hardware resources and maximize the efficiency of the system. This paper presents our experiences in the design and implementation of a new multimedia file system which can efficiently deliver the required disk bandwidth for a periodic I/O workload. We have implemented the file system on the Linux operating system, and examined itsperformance under streaming I/O workload. The results of the study show that the proposed file system exhibits superior performance than the Linux Ext2 file system under streaming I/O workload. The result of this work not only contribute to advance the state f art file system technology for multimedia streaming but also put forth the software which is readily available and can be deployed. deployed.

  • PDF

Fast and Accurate Performance Estimation of Bus Matrix for Multi-Processor System-on-Chip (MPSoC) (멀티 프로세서 시스템-온-칩(MPSoC)을 위한 버스 매트릭스 구조의 빠르고 정확한 성능 예측 기법)

  • Kim, Sung-Chan;Ha, Soon-Hoi
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.11
    • /
    • pp.527-539
    • /
    • 2008
  • This paper presents a performance estimation technique based on queuing analysis for on-chip bus matrix architectures of Multi-Processor System-on-Chips(MPSoCs). Previous works relying on time-consuming simulation are not able to explore the vast design space to cope with increasing time-to-market pressure. The proposed technique gives accurate estimation results while achieving faster estimation time than cycle -accurate simulation by order of magnitude. We consider the followings for the modeling of practical memory subsystem: (1) the service time with the general distribution instead of the exponential distribution and (2) multiple-outstanding transactions to achieve high performance. The experimental results show that the proposed analysis technique has the accuracy of 94% on average and much shorter runtime ($10^5$ times faster at least) compared to simulation for the various examples: the synthetic traces and real-time application, 4-channel DVR.

Transistor Sizing and Buffer Insertion Algorithms for Optimum Area under Delay Constraint (지연 제약 하에서 면적의 최적화를 위한 트랜지스터 사이징과 버퍼 삽입 알고리즘)

  • Lee, Sung-Kun;Kim, Ju-Ho
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.7
    • /
    • pp.684-694
    • /
    • 2000
  • For designing circuits for low power systems, the capacitance is an important factor for the power dissipation. Since the capacitance of a gate is proportional to the area of the gate, we can reduce the total power consumption of a circuit by reducing the total area of gates, where total area is a simple sum of all gate areas in the circuit. To reduce the total area, transistor resizing can be used. While resizing transistors, inserting buffer in the proper position can help reduce the total area. In this paper we propose two methods for concurrent transistor sizing and buffer insertion. One method uses template window simulation and the other uses extrapolation. Experimental results show that concurrent transistor sizing with buffer insertion achieved 10-20% more reduction of the total area than when it was done without buffer insertion and template window simulation is more efficient than extrapolation.

  • PDF

Adaptive Multi-level Streaming Service using Fuzzy Similarity in Wireless Mobile Networks (무선 모바일 네트워크상에서 퍼지 유사도를 이용한 적응형 멀티-레벨 스트리밍 서비스)

  • Lee, Chong-Deuk
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.9
    • /
    • pp.3502-3509
    • /
    • 2010
  • Streaming service in the wireless mobile network environment has been a very challenging issue due to the dynamic uncertain nature of the channels. Overhead such as congestion, latency, and jitter lead to the problem of performance degradation of an adaptive multi-streaming service. This paper proposes a AMSS (Adaptive Multi-level Streaming Service) mechanism to reduce the performance degradation due to overhead such as variable network bandwidth, mobility and limited resources of the wireless mobile network. The proposed AMSS optimizes streaming services by: 1) use of fuzzy similarity metric, 2) minimization of packet loss due to buffer overflow and resource waste, and 3) minimization of packet loss due to congestion and delay. The simulation result shows that the proposed method has better performance in congestion control and packet loss ratio than the other existing methods of TCP-based method, UDP-based method and VBM-based method. The proposed method showed improvement of 10% in congestion control ratio and 8% in packet loss ratio compared with VBM-based method which is one of the best method.

Back Analysis of the Earth Wall in Multi-layered Subgrade (다층지반에 근입된 흙막이 벽의 역해석에 관한 연구)

  • 이승훈;김종민;김수일;장범수
    • Journal of the Korean Geotechnical Society
    • /
    • v.18 no.1
    • /
    • pp.71-78
    • /
    • 2002
  • This paper presents a back-calculation technique leer the prediction of the behavior of earth wall inserted in multi-layered soil deposit. The soil properties are back-calculated from the measured displacement at each construction stage and the behavior of earth wall far the next construction stage is predicted using back-calculated soil properties. For multi-layered soil deposit, the back-calculation would be very difficult due to the increase in the number of variables. In this study, to solve this difficulty, the back-calculation was performed successively from the lowest layer to the upper layers. An efficient elasto-plastic beam-column analysis was used for forward analysis to minimize the computation time of iterative back-calculation procedure. The coefficients of subgrade reaction and lateral earth pressure necessary for the formation of p-y curve were selected as back calculation variables, and to minimize the effect of abnormal behavior of the wall which might be caused by any unexpected action during construction, the difference between measured displacement increment and computed displacement increment at each construction stages is used as the objective function of optimization. The constrained sequential linear programming was used for the optimization technique to found values of variables minimizing the objective function. The proposed method in this study was verified using numerically generated data and measured field data.

Optimization of Position of Lightening Hole in 2D Structures through MLS basede Overset Metheod along with Genetic Algorithm (이동최소자승 중첩 격자 기법과 유전자 알고리듬을 이용한 2차원 구조물의 경감공 위치 최적 설계)

  • Oh, Min-Hwan;Woo, Dong-Ju;Cho, Jin-Yeon
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.36 no.10
    • /
    • pp.979-987
    • /
    • 2008
  • In aerospace structural design, the position of lightening hole is often required to be optimized from the initial design in order to avoid an excessive stress concentration. To remodel the updated configuration in optimization procedure, re-meshing procedure is conventionally adopted. However, this approach is time-consuming, and has limitations especially in handling hexahedral or quadrilateral meshes, which are preferred because of their good numerical performances. To attenuate these disadvantages, new optimization scheme is proposed by combining the MLS(Moving Least Squares) based overset method and the genetic algorithm in this work. To test the validity of the proposed optimization scheme, optimizations of positions of lightening holes in 2D structures have been carried out.