• 제목/요약/키워드: Production and Distribution Problem

검색결과 191건 처리시간 0.027초

Meta-Heuristic Algorithms for a Multi-Product Dynamic Lot-Sizing Problem with a Freight Container Cost

  • Kim, Byung-Soo;Lee, Woon-Seek
    • Industrial Engineering and Management Systems
    • /
    • 제11권3호
    • /
    • pp.288-298
    • /
    • 2012
  • Lot sizing and shipment scheduling are two interrelated decisions made by a manufacturing plant and a third-party logistics distribution center. This paper analyzes a dynamic inbound ordering problem and shipment problem with a freight container cost, in which the order size of multiple products and single container type are simultaneously considered. In the problem, each ordered product placed in a period is immediately shipped by some freight containers in the period, and the total freight cost is proportional to the number of containers employed. It is assumed that the load size of each product is equal and backlogging is not allowed. The objective of this study is to simultaneously determine the lot-sizes and the shipment schedule that minimize the total costs, which consist of production cost, inventory holding cost, and freight cost. Because the problem is NP-hard, we propose three meta-heuristic algorithms: a simulated annealing algorithm, a genetic algorithm, and a new population-based evolutionary meta-heuristic called self-evolution algorithm. The performance of the meta-heuristic algorithms is compared with a local search heuristic proposed by the previous paper in terms of the average deviation from the optimal solution in small size problems and the average deviation from the best one among the replications of the meta-heuristic algorithms in large size problems.

제한용량이 있는 설비입지결정 문제에 대한 적응형 평균치교차분할 알고리즘 (Adaptive Mean Value Cross Decomposition Algorithms for Capacitated Facility Location Problems)

  • 김철연;최경현
    • 대한산업공학회지
    • /
    • 제37권2호
    • /
    • pp.124-131
    • /
    • 2011
  • In this research report, we propose a heuristic algorithm with some primal recovery strategies for capacitated facility location problems (CFLP), which is a well-known combinatorial optimization problem with applications in distribution, transportation and production planning. Many algorithms employ the branch-and-bound technique in order to solve the CFLP. There are also some different approaches which can recover primal solutions while exploiting the primal and dual structure simultaneously. One of them is a MVCD (Mean Value Cross Decomposition) ensuring convergence without solving a master problem. The MVCD was designed to handle LP-problems, but it was applied in mixed integer problems. However the MVCD has been applied to only uncapacitated facility location problems (UFLP), because it was very difficult to obtain "Integrality" property of Lagrangian dual subproblems sustaining the feasibility to primal problems. We present some heuristic strategies to recover primal feasible integer solutions, handling the accumulated primal solutions of the dual subproblem, which are used as input to the primal subproblem in the mean value cross decomposition technique, without requiring solutions to a master problem. Computational results for a set of various problem instances are reported.

On Nonparametric Estimation of Data Edges

  • Park, Byeong U.
    • Journal of the Korean Statistical Society
    • /
    • 제30권2호
    • /
    • pp.265-280
    • /
    • 2001
  • Estimation of the edge of a distribution has many important applications. It is related to classification, cluster analysis, neural network, and statistical image recovering. The problem also arises in measuring production efficiency in economic systems. Three most promising nonparametric estimators in the existing literature are introduced. Their statistical properties are provided, some of which are new. Themes of future study are also discussed.

  • PDF

유전 알고리듬을 적용한 지능형 ATP 시스템 개발 (Development of Intelligent ATP System Using Genetic Algorithm)

  • 김태영
    • 지능정보연구
    • /
    • 제16권4호
    • /
    • pp.131-145
    • /
    • 2010
  • ERP, SCM 등과 같은 기업용 정보 시스템을 활용함에 있어, 고객의 문의에 따라 제품 판매 가능 유무와 가능일자를 계산하여 통보해 주는 지능형 ATP 시스템은 전산 정보를 활용하여 고객 만족도를 최대화할 수 있는 유용한 기능이라고 할 수 있다. 그렇지만 공급 사슬 환경에서 ATP 시스템을 적용하려고 할 경우, 고객이 문의해 온 Retailer에게 납품 가능한 모든 분배센터(Distribution Center)와 공장(Plant)의 미래 시점의 재고량 변화와 운송 능력 등을 모두 고려하여야 하므로 계산량이 방대한 NP-Complete 문제가 된다. 따라서 시스템 사용자가 빠른 시간 내에 해를 구하여 고객에게 결과를 알려 줄 수 있는 ATP 시스템의 개발은 공급 사슬 관리를 효과적으로 활용하기 위하여 반드시 필요한 일이라고 할 수 있다. 본 논문에서는 동적 생산 함수의 개념을 이용하여 비 정수 타임 랙을 고려하여 ATP 시스템을 모델링하고, 해당 수리 모형으로부터 효율적으로 해를 얻기 위하여 유전 알고리듬을 개발하였다. 비 정수 타임 랙을 활용한 ATP 시스템은 비 정수 타임 랙을 올림이나 내림을 통하여 정수화 시킨 후 모형 수립하는 기존의 방법보다 정교하게 현실을 반영할 수 있고, ATP 시스템을 위한 유전 알고리듬의 진화 시스템은 문제크기가 작은 것에서부터 큰 것까지 최적해에 매우 근사한 값을 매우 빠른 시간 내에 풀 수 있음을 알 수 있었다.

해외농업투자에 따른 유통체계 개선방안에 관한 연구 (A study on the improvement of distribution system by overseas agricultural investment)

  • 선일석;이동옥
    • 유통과학연구
    • /
    • 제8권3호
    • /
    • pp.17-26
    • /
    • 2010
  • 세계경제 및 환경의 변화에 따라 농산물의 불안정적인 수급으로 인한 문제점이 노출되고 있으며, 우리나라의 경우 농산물의 안정적인 확보를 위하여 국가 전략적 차원에서의 해외농업투자의 필요성이 요구되고 있다. 하지만 정부차원의 지원 미진, 해외 농업에 대한 정보 및 기술 미비, 개발자금 확보의 어려움, 장기간의 투자금 회수기간, 사후관리 미흡 등의 이유로 성과를 이루지 못하고 있는 실정이며, 특히 해외 농산물의 국내 반입 시 관세의 장벽, 물류 유통비용 등으로 가격 경쟁력이 떨어지고 있어 국내에 반입되지 못하고 있는 실정이다. 이에 본 연구에서는 우리나라의 해외농업투자의 기본개념 및 실태를 살펴보고 해외농업투자의 필요성과 고려사항, 문제점 등을 도출하여 해외에서 재배된 농산물의 경쟁력을 위한 유통 측면에서의 개선방안을 정부의 간접적인 지원, 유통 현대화 및 유통정보기능 강화, 유통시설, 수송루트, 하역업무개선, 경쟁력 확보를 위한 정부의 정책적 지원, 교육 훈련을 통한 전문인력 양성 등 다섯 가지 측면에서 제시하였다.

  • PDF

Installation for Preparing of Nanopowders by Target Evaporation with Pulsed Electron Beam

  • Sokovnin S. Yu.;Kotov Yu. A.;Rhee C. K.
    • 한국분말재료학회지
    • /
    • 제12권3호
    • /
    • pp.167-173
    • /
    • 2005
  • Production of weakly agglomerated nanopowders with the characteristic size of about 10 nm and a narrow particle size distribution is still a topical problem especially if the matter is an acceptable output (>50 g/hour), a high purity of the final product, and a low (energy consumption. The available experience and literature data show that the most promising approach to production of such powders is the evaporation-condensation method, which has a set of means for heating of the target. From this viewpoint the use of pulsed electron accelerators for production of nanopowders is preferable since they allow a relatively simple adjustment of the energy, the pulse length, and the pulse repetition rate. The use of a pulsed electron accelerator provides the following opportunities: a high-purity product; only the target and the working gas will interact and their purity can be controlled; evaporation products will be removed from the irradiation zone between pulses; as a result, the electron energy will be used more efficiently; adjustment of the particle size distribution and the characteristic size of particles by changing the pulse energy and the irradiated area. Considering the obtained results, we developed a design and made an installation for production of nanopowders, which is based on a hollow-cathode pulsed gas-filled diode. The use of a hollow-cathode gas-filled diode allows producing and utilizing an electron beam in a single chamber. The emission modulation in the hollow cathode will allow forming an electron beam 5 to 100 ms long. This will ensure an exact selection of the beam energy. By now we have completed the design work, manufactured units, equipped the installation, and began putting the installation into operation. A small amount of nanopowders has been produced.

Genetic Algorithm과 Expert System의 결합 알고리즘을 이용한 직구동형 풍력발전기 최적설계 (Optimal Design of Direct-Driven Wind Generator Using Genetic Algorithm Combined with Expert System)

  • 김상훈;정상용
    • 조명전기설비학회논문지
    • /
    • 제24권10호
    • /
    • pp.149-156
    • /
    • 2010
  • In this paper, the optimal design of a wind generator, implemented with the hybridized GA(Genetic Algorithm) and ES(Expert System), has been performed to maximize the AEP(Annual Energy Production) over the whole wind speed characterized by the statistical model of wind speed distribution. In particular, to solve the problem of calculation iterate, ES finds the superior individual and apply to initial generation of GA and it makes reduction of search domain. Meanwhile, for effective searching in reduced search domain, it propose Intelligent GA algorithm. Also, it shows the results of optimized model 500[kW] wind generator using hybridized algorithm and benchmark result of compare with GA.

Inventory policy comparison on supply chain network by simulation technique

  • Park, Nam-Kyu;Choi, Woo-Young
    • 한국항해항만학회지
    • /
    • 제34권2호
    • /
    • pp.131-136
    • /
    • 2010
  • The aim of the paper is to solve the problem of customer reduction due to the difficulty of parts sourcing which impacts production delay and delivery delay in SC networks. Furthermore, this paper is to suggest the new inventory policy of MTS in order to solve the problem of current inventory policy. In order to compare two policies, a LCD maker is selected as a case study and the real data for 2007 years is used for simulation input. The maker uses MTO policy for parts sourcing which has the problem of lead time even if it has some advantage of inventory cost. Based on current process. The simulation program of AS-IS model and TO-BE model using ARENA 10 version is developed for evaluation. In a result, the order number of two policies shows that MTO is 52 and MTS is 53. However the quantity of order shows big difference such that MTO is 168,460 and MTS is 225,106. Particularly, the lead time of new inventory policy shows much shorter that that of MTO such that MTO 100 is days and MTS is 16 days. In spite of short lead time by MTS policy, new policy has to take burden of inventory cost per year. Total inventory cost per year by MTS policy is US$ 11,254 and each part inventory cost is that POL is US$ 1,807, LDI is US$ 2,166 and Panel is US$ 7,281. The implication of the research is that the company has to consider the cost and the service simultaneously in deciding the inventory policy. In the paper, even if the optimal point of deciding is put into tactical area, the ground of decision is suggested in order to improve the problem in SC networks.

주문형 게임 시스템의 구조 분석과 현황에 관한 연구 (An Architecture Analysis and Current Status of Games On Demand)

  • 이면재
    • 디지털콘텐츠학회 논문지
    • /
    • 제8권1호
    • /
    • pp.51-59
    • /
    • 2007
  • 기존 PC 패키지 게임의 경우에는 제작 비용과 유통 비용이 높고 인터넷을 통한 불법 복제가 많이 발생되었다. 그래서, 이를 막기 위한 방법으로 인터넷으로 게임 컨텐츠를 받아서 게임을 플레이 하는 주문형 게임(Games On Demand)에 관한 서비스가 시도되고 있다. 그러나, 현재 국내에서는 주문형 게임 서비스에 관한 연구가 부족하다. 따라서, 본 논문에서는 주문형 게임을 정의하고 이를 제공하기 위한 구조를 분석한다. 그리고 국내를 중심으로 주문형 게임의 서비스 현황을 기술하고 이에 대한 문제점과 해결 방향을 연구한다. 본 연구는 주문형 게임을 제공하려는 업체에게 유익한 자료가 될 수 있다.

  • PDF

A Genetic Algorithm for Trip Distribution and Traffic Assignment from Traffic Counts in a Stochastic User Equilibrium

  • Sung, Ki-Seok;Rakha, Hesham
    • Management Science and Financial Engineering
    • /
    • 제15권1호
    • /
    • pp.51-69
    • /
    • 2009
  • A network model and a Genetic Algorithm (GA) is proposed to solve the simultaneous estimation of the trip distribution and traffic assignment from traffic counts in the congested networks in a logit-based Stochastic User Equilibrium (SUE). The model is formulated as a problem of minimizing a non-linear objective function with the linear constraints. In the model, the flow-conservation constraints are utilized to restrict the solution space and to force the link flows become consistent to the traffic counts. The objective of the model is to minimize the discrepancies between two sets of link flows. One is the set of link flows satisfying the constraints of flow-conservation, trip production from origin, trip attraction to destination and traffic counts at observed links. The other is the set of link flows those are estimated through the trip distribution and traffic assignment using the path flow estimator in the logit-based SUE. In the proposed GA, a chromosome is defined as a real vector representing a set of Origin-Destination Matrix (ODM), link flows and route-choice dispersion coefficient. Each chromosome is evaluated by the corresponding discrepancies. The population of the chromosome is evolved by the concurrent simplex crossover and random mutation. To maintain the feasibility of solutions, a bounded vector shipment technique is used during the crossover and mutation.