• 제목/요약/키워드: Allocation model

검색결과 1,209건 처리시간 0.021초

차기유도무기의 최적배치에 관한 모형 (An Optimal Allocation Model for SAM-X)

  • 김승빈;전건욱
    • 한국국방경영분석학회지
    • /
    • 제30권1호
    • /
    • pp.48-69
    • /
    • 2004
  • An optimal allocation model for SAM-X by using a set covering model is suggested. This allocation model considers to guarantee the maximum security of vital areas from the attack of enemy aircraft(s) and missiles. In order to formulate this model, we applied the concept of parallel structure reliability to set covering model. This model gives both direction of the primary target line and location of the facility. When applied this model to the real situation, the solution of this model can be used to the references of decision making for the optimal military facility allocation.

AIP 모델을 응용한 균형적 공항 슬롯 배정 모델에 관한 연구 -인천국제공항 사례 연구- (A Study on Balanced Airport Slot Allocation Model Applying AIP Model -Focused on Incheon International Airport-)

  • 박학순;김기웅
    • 한국항공운항학회지
    • /
    • 제26권1호
    • /
    • pp.25-36
    • /
    • 2018
  • This paper presents a new airport slot allocation model that uses AIP model to balance the use of airport slots within existing capacity based on the limitation of capacity expansion of airport slots. This new model is called a 'balanced airport slot allocation model', which integrates the airport facility usage system, which is applied independently without linkage, with the airport slot allocation system, introducing the market logical characteristic of 'administered incentive pricing. In this paper, we propose a new proposal to dramatically change the airport slot allocation system in the current situation where the expansion of facilities is limited in the urgent problem of the airport slot shortage, and it is necessary to balance the airport slot allocation. Airline paying for the use of an airport slot can determine the slot of the desired time slot based on the costs incurred by differentiating in the new airport slot allocation model. This is a system that allows the airlines that are willing to pay a lot of money in the market to use preferred airport slots.

수리계획을 이용한 금호강유역의 최적 물배분 시스템모델 (Optimum Water Allocation System Model in Keumho River Basin with Mathematical Programming Techniques)

  • 안승섭;이증석
    • 한국농공학회지
    • /
    • 제39권2호
    • /
    • pp.74-85
    • /
    • 1997
  • This study aims at the development of a mathematical approach for the optimal water allocation in the river basin where available water is not in sufficient. Its optimal allocation model is determined from the comparison and analysis of mathematical programming techniques such as transportation programming and dynamic programming models at its optimal allocation models. The water allocation system used in this study is designed to be the optimal water allocation which can satisfy the water deficit in each district through inter-basin water transfer between Kumho river basin which is a tributary catchment of Nakdong river basin, and the adjacent Hyungsan river basin, Milyang river basin and Nakdong upstream river basin. A general rule of water allocation is obtained for each district in the basins as the result of analysis of the optimal water allocation in the water allocation system. Also a comparison of the developed models proves that there is no big difference between the models Therefore transportation programming model indicates most adequate to the complex water allocation system in terms of its characteristics It can be seen, however, that dynamic programming model shows water allocation effect which produces greater net benefit more or less.

  • PDF

수송경로 문제를 고려한 물류최적화모델의 연구 (A supply planning model based on inventory-allocation and vehicle routing problem with location-assignment)

  • 황흥석;최철훈;박태원
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 1997년도 추계학술대회발표논문집; 홍익대학교, 서울; 1 Nov. 1997
    • /
    • pp.201-204
    • /
    • 1997
  • This study is focussed on optimization problems which require allocating the restricted inventory to demand points and assignment of vehicles to routes in order to deliver goods for demand sites with optimal decision. This study investigated an integrated model using three step-by-step approach based on relationship that exists between the inventory allocation and vehicle routing with restricted amount of inventory and transportations. we developed several sub-models such as; first, an inventory-allocation model, second a vehicle-routing model based on clustering and a heuristic algorithms, and last a vehicle routing scheduling model, a TSP-solver, based on genetic algorithm. Also, for each sub-models we have developed computer programs and by a sample run it was known that the proposed model to be a very acceptable model for the inventory-allocation and vehicle routing problems.

  • PDF

A Comparison of Variance Lower Bound between the Optimum Allocation and the Power Allocation

  • Son, Chang-Kyoon
    • Communications for Statistical Applications and Methods
    • /
    • 제10권1호
    • /
    • pp.79-88
    • /
    • 2003
  • In this paper, we study the efficiency of the stratified estimator in related with the variance lower bound of Horvitz-Thompson estimator subject to the superpopulation model. Especially, we compare the variance lower bound of optimum allocation with that of power allocation subject to Dalenius-Hedges stratification.

Allocation Model of Container Yard for A TC Optimal Operation in Automated Container Terminal

  • Kim, Hwan-Seong;Nguyen, DuyAnh
    • 한국항해항만학회지
    • /
    • 제32권9호
    • /
    • pp.737-742
    • /
    • 2008
  • In this paper, we deal with an allocation model of vertical type container yard for minimizing the total ATC (Automated Transfer Crane) working time and the equivalence of ATC working load in each block on automated container terminal. Firstly, a layout of automated container terminal yard is shown The characteristic of equipment which work in the terminal and its basic assumption are given Next, an allocation model which concerns with minimizing the total working time and the equivalence of working load is proposed for effectiveness of ATC working in automated container terminal. Also, a weight values on critical function are suggested to adjust the critical values by evaluating the obtained allocation plan. For ATC allocation algorithm, we suggest a simple repeat algorithm for on-line terminal operation.

최적 토량배분 계획을 위한 의사결정 모델 (Decision Making Model for Optimal Earthwork Allocation Planning)

  • 곽한성;서병욱;이동은
    • 한국건축시공학회:학술대회논문집
    • /
    • 한국건축시공학회 2016년도 춘계 학술논문 발표대회
    • /
    • pp.162-163
    • /
    • 2016
  • This paper presents a mathematical model for optimizing earthwork allocation plan that minimizes earthwork cost. The model takes into account operational constraints in the real-world earthwork such as material-type (i.e., quality level of material) and quantities excavated from cut-sections, required quality of material and quantities for each embankment layer, top-down cutting and bottom-up filling constraints, and allocation orders. These constraints are successfully handled by assuming the rock-earth material as the three dimensional (3D) blocks. The study is of value to project scheduler because the model identifies the optimal earth allocation plan (i.e., haul direction (cut and fill pairs), quantities of soil, type of material, and order of allocations) expeditiously and is developed as an automated system for usability. It is also relevant to estimator in that it computes more realistic earthworks costs estimation. The economic impact and validity of the mathematical model was confirmed by performing test cases.

  • PDF

A Stratified Unknown Repeated Trials in Randomized Response Sampling

  • Singh, Housila P.;Tarray, Tanveer Ahmad
    • Communications for Statistical Applications and Methods
    • /
    • 제19권6호
    • /
    • pp.751-759
    • /
    • 2012
  • This paper proposes an alternative stratified randomized response model based on the model of Singh and Joarder (1997). It is shown numerically that the proposed stratified randomized response model is more efficient than Hong et al. (1994) (under proportional allocation) and Kim and Warde (2004) (under optimum allocation).

Resource Allocation Strategy of Internet of Vehicles Using Reinforcement Learning

  • Xi, Hongqi;Sun, Huijuan
    • Journal of Information Processing Systems
    • /
    • 제18권3호
    • /
    • pp.443-456
    • /
    • 2022
  • An efficient and reasonable resource allocation strategy can greatly improve the service quality of Internet of Vehicles (IoV). However, most of the current allocation methods have overestimation problem, and it is difficult to provide high-performance IoV network services. To solve this problem, this paper proposes a network resource allocation strategy based on deep learning network model DDQN. Firstly, the method implements the refined modeling of IoV model, including communication model, user layer computing model, edge layer offloading model, mobile model, etc., similar to the actual complex IoV application scenario. Then, the DDQN network model is used to calculate and solve the mathematical model of resource allocation. By decoupling the selection of target Q value action and the calculation of target Q value, the phenomenon of overestimation is avoided. It can provide higher-quality network services and ensure superior computing and processing performance in actual complex scenarios. Finally, simulation results show that the proposed method can maintain the network delay within 65 ms and show excellent network performance in high concurrency and complex scenes with task data volume of 500 kbits.

대역폭 할당을 통한 Foundation Fieldbus 통신망 설계 (Network Design of Foundation Fieldbus using a Bandwidth Allocation Scheme)

  • 홍승호;최인호;문봉채
    • 제어로봇시스템학회논문지
    • /
    • 제7권10호
    • /
    • pp.882-890
    • /
    • 2001
  • The data link layer of Foundation Fieldbus is operated on the basis of scheduling and token-passing disciplines. This paper presents a network design method of Foundation Fieldbus using a bandwidth allocation scheme. Fieldbus traffic consists of periodic data and sporadically generated time-critical and time-available data. The bandwidth allocation scheme schedules the transmission of periodic data. Time-critical and time-available data are transmitted via a token-passing service. The validity of this bandwidth allocation scheme is determined using an experimental model of a network system. The results obtained from the experimental model show that the proposed scheme restricts the delay of both periodic and time-critical data to a pre-specified bound. The proposed bandwidth allocation scheme also fully utilizes the bandwidth resource of the network system.

  • PDF