• Title/Summary/Keyword: dynamic programming

Search Result 952, Processing Time 0.051 seconds

A traffic and interference adaptive DCA algorithm with rearrangement in microcellular systems

  • Kim, Seong-Lyun;Han, Youngnam
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1995.04a
    • /
    • pp.724-728
    • /
    • 1995
  • A new dynamic channel assignment (DCA) algorithm with rearrangement for cellular mobile communication systems is suggested. Our DCA algorithm is both traffic and interference adaptive, which is based on the mathematical formulation of the maximum packing under a realistic propagation model. In developing the algorithm, we adopt the Lagrangean relaxation technique that has been successfully used in the area of mathematical programming. Computational experiments of the algorithm reveal quite encouraging results. Although our algorithm primarily focuses on microcellular systems, it can be effectively applied to conventional cellular systems under highly nonuniform traffic distributions and interference conditions.

  • PDF

Design of A Quality System for Multi-Products with the Fixed Costs for Products Servicing (서비스 고정비용을 고려한 복수제품 품질시스템의 설계)

  • Kim Sung Chul
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.29 no.4
    • /
    • pp.61-72
    • /
    • 2004
  • In this paper, we design sampling inspections and service capacities simultaneously for multi-products. Particularly, we extend Kim(2003) by introducing the fixed cost of providing services. We show that, due to the fixed cost considered, the cost function of a product is no longer linear or convex in terms of the level of service provision, and the total inspection is prefered to the small level of service capacity which results in high burden of the fixed cost. And we develop a simple framework to deal with this joint design problem for a product. Also we consider the problem of allocating the given number of the total service capacities among products. A dynamic programming algorithm is developed to determine the optimal allocation which minimizes the overall total cost of the system and the optimal allocation can be obtained with the considerably smaller computations than the total number of possible allocations. The results can be used to support planning decisions and to aid the joint design of inspections and service capacities for products.

Integrated inventory-distribution planning in a (1:N) supply chain system with heterogeneous vehicles incorporated (다양한 수송수단을 고려하는 (1:N) 공급체인에 대한 재고-수송의 통합계획수립)

  • Kim, Eun-Seok;Seong, Chang-Seop;Yang, U-Seok
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.11a
    • /
    • pp.327-331
    • /
    • 2006
  • This paper considers an integrated inventory-distribution system with a fleet of heterogeneous vehicles employed where a single warehouse distributes a single type of products to many spatially distributed retailers to satisfy their dynamic demands and the product is provided to the warehouse via procurement ordering from any manufacturing plant or market The Problem is formulated as an Mixed Integer Programming with the objective function of minimizing the sum of inventory holding cost (at the warehouse and retailers), and transportation cost and procurement ordering cost at the warehouse, subject to inventory-balancing constraints, ordering constraints, vehicle capacity constraints and transportation time constraints. The problem is Proven to be NP-hard. Accordingly, a Lagrangean heuristic procedure is derived and tested for its effectiveness through computational experiments with some numerical instances.

  • PDF

A STUDY OH THE ECONOMIC OPERATION OF SMES FOR ENERGY STORAGE (전력 저장용 SEMS의 경제적 운용에 관한 연구)

  • Roh, Hee-Ho;Hahn, Song-Yop;Rhee, Sung-Won
    • Proceedings of the KIEE Conference
    • /
    • 1988.11a
    • /
    • pp.13-16
    • /
    • 1988
  • As the automic power plant is increased, load leveling energy storage system becomes more important. Pumped hydroelectric storage, used in the present, has too storage efficiency and difficulty in selecting site. But SMES(Superconducting Magnet Energy Storage) has high storage efficiency (90%), fast time response characteristics and ease of location. The general object of SMES with electric power system is the minimization overall production cost. This paper presents a method for the economic operation of SMES by Dynamic Programming.

  • PDF

Stereo vision Techniques for Correct extract of Moving object (이동물체의 정확한 추출을 위한 스테레오 알고리즘)

  • Kim, Jong-Man
    • Proceedings of the KIEE Conference
    • /
    • 2005.07d
    • /
    • pp.2531-2533
    • /
    • 2005
  • The proposed neural network technique is the real time computation method based theory of inter-node diffusion for searching the safety distances from the sudden appearance-objects during the work driving. The main steps of the distance computation using the theory of stereo vision like the eyes of man is following steps. One is the processing for finding the corresponding points of stereo images and the other is the interpolation processing of full image data from nonlinear image data of objects. All of therm request much memory space and time. Therefore the most reliable neural-network algorithm is drived for real-time matching of obejects, which is composed of a dynamic programming algorithm based on sequence matching techniques in moving objects.

  • PDF

The development of expansion planning algorithm considering environmental constraints (환경 제약을 고려한 설비계획 방법론 개발)

  • Kim, Yang-Il;Chung, Koo-Hyung;Shin, Hye-Kyeong;Kim, Bal-Ho H.
    • Proceedings of the KIEE Conference
    • /
    • 2006.11a
    • /
    • pp.164-166
    • /
    • 2006
  • Wien Automatic System Planning Package (WASP) which is used to draw out generation expansion planning applies Dynamic Programming in Korea power system panning. While this package has an advantage that computes annual capacity, it has a disadvantage that can't consider environmental constraints. With the effectuation of the Kyoto Protocol in February, 2005, it is expected that CO2 emission has a severe effect on Korean power system. Therefore, as the most important issue, the generation expansion planning considering environmental constraints is rising in power system. This paper develops a mathematic model including not only generation expansion planning but transmission planning and considering regional supply-demand and environmental constraints, especially CO2 emission, and verifies propriety through the case study.

  • PDF

On-line Optimal EMS Implementation for Distributed Power System

  • Choi, Wooin;Baek, Jong-Bok;Cho, Bo-Hyung
    • Proceedings of the KIPE Conference
    • /
    • 2012.11a
    • /
    • pp.33-34
    • /
    • 2012
  • As the distributed power system with PV and ESS is highlighted to be one of the most prominent structure to replace the traditional electric power system, power flow scheduling is expected to bring better system efficiency. Optimal energy management system (EMS) where the power from PV and the grid is managed in time-domain using ESS needs an optimization process. In this paper, main optimization method is implemented using dynamic programming (DP). To overcome the drawback of DP in which ideal future information is required, prediction stage precedes every EMS execution. A simple auto-regressive moving-average (ARMA) forecasting followed by a PI-controller updates the prediction data. Assessment of the on-line optimal EMS scheme has been evaluated on several cases.

  • PDF

A Two-Machine Flowshop Scheduling with Outsourcing Strategy Allowed (아웃소싱 전략을 활용하는 두 단계 흐름생산라인의 일정계획)

  • Lee, Ik Sun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.37 no.3
    • /
    • pp.113-121
    • /
    • 2014
  • This paper considers a scheduling problem in a two-machine flowshop with outsourcing strategy incorporated. The jobs can be either processed in the first machine or outsourced to outside subcontractors. This paper wants to determine which jobs to be processed in-house and which jobs to be outsourced. If any job is decided to be outsourced, then an additional outsourcing cost is charged The objective of this paper is to minimize the sum of scheduling cost and outsourcing cost under a budget constraint. At first this paper characterizes some solution properties, and then it derives solution procedure including DP (Dynamic Programming) and B&B (Branch-and-Bound) algorithms and a greedy-type heuristic. Finally the performance of the algorithms are evaluated with some numerical tests.

An Algorithm for Optimal Allocation of Spare Parts

  • Jee, Man-Won
    • Journal of the military operations research society of Korea
    • /
    • v.9 no.1
    • /
    • pp.29-49
    • /
    • 1983
  • The algorithm developed in this paper utilized kettelle's [1] idea of the undominated allocation sequence and his way of tableau computation to solve the more general spares allocation problem in the system availability optimization. The algorithm is to optimally allocate resources to the independent modules which are connected to be series/parallel/mixed system configurations. It has advantages over the standard dynamic programming algorithm by eliminating the need for backtracking and by solving the allocation problem for any budget size. By careful heuristic inspection the algorithm can be made very efficient for manual calculations because large blocks of cells can be eliminated from computation. A numerical example is provided to illustrate the allocation algorithm.

  • PDF

Balancing MPEG Transcoding with Storage in Multiple-Quality Video-on-Demand Services

  • Song, Min-Seok;Sim, Jeong-Seop;Go, Jae-Doo;Lee, Bum-Sun;Park, Soo-Jun
    • ETRI Journal
    • /
    • v.31 no.3
    • /
    • pp.333-335
    • /
    • 2009
  • To match the requirements of heterogeneous mobile devices, video objects may be transcoded, which requires considerable CPU resources. Alternatively, multiple versions of the same video may be stored on servers, but this requires a lot of disk space. We formulate the trade-off between the versions that are stored on disk and the need for transcoding. We propose an optimal solution to this formulation based on dynamic programming. Experiments show that our scheme allows up to 68% more clients to be admitted than conventional schemes when a reasonable amount of storage is available.

  • PDF