• Title/Summary/Keyword: NP-complete

Search Result 312, Processing Time 0.018 seconds

An Optimization Model and Heuristic Algorithms for Multi-Ring Design in Fiber-Optic Networks (광전송망에서의 다중링 설계를 위한 최적화 모형 및 휴리스틱 알고리즘)

  • 이인행;이영옥;정순기
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.1B
    • /
    • pp.15-30
    • /
    • 2000
  • The important considerations in the design of fiber-optic networks are reliability and survivability preparing against a failure. The SDH(Synchronous Digital Hierarchy), the international standard of optical transmission, offers several network reconfiguration methods that enable network to be automatically restored from failure. One of the methods is the SHR(Self Healing Ring), which is a ring topology system. Most network providers have constructed their backbone networks with SHR architecture since it can provide survivability economically. The network architecture has eventually evolved into a multi-ring network comprised of interconnected rings. This paper addresses multi-ring network design problems is to minimize ring-construction cost. This problem can be formulated with MIP(mixed integer programming) model. However, it is difficult to solve the model within reasonable computing time on a large scale network because the model is NP-complete. Furthermore, in practice we should consider the problem of routing demands on rings to minimize total cost. This routing problem involves multiplex bundling at the intermediate nodes. A family of heuristic algorithms is presented for this problem. These algorithms include gateway selection and routing of inter-ring demands as well as load balancing on single rings. The developed heuristic algorithms are applied to some network provider's regional and long-distance transmission networks. We show an example of ring design and compare it with another ring topology design. Finally, we analysis the effect bundling.

  • PDF

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

  • Kim, Tai-Young
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.4
    • /
    • pp.131-145
    • /
    • 2010
  • The framework for making a coordinated decision for large-scale facilities has become an important issue in supply chain(SC) management research. The competitive business environment requires companies to continuously search for the ways to achieve high efficiency and lower operational costs. In the areas of production/distribution planning, many researchers and practitioners have developedand evaluated the deterministic models to coordinate important and interrelated logistic decisions such as capacity management, inventory allocation, and vehicle routing. They initially have investigated the various process of SC separately and later become more interested in such problems encompassing the whole SC system. The accurate quotation of ATP(Available-To-Promise) plays a very important role in enhancing customer satisfaction and fill rate maximization. The complexity for intelligent manufacturing system, which includes all the linkages among procurement, production, and distribution, makes the accurate quotation of ATP be a quite difficult job. In addition to, many researchers assumed ATP model with integer time. However, in industry practices, integer times are very rare and the model developed using integer times is therefore approximating the real system. Various alternative models for an ATP system with time lags have been developed and evaluated. In most cases, these models have assumed that the time lags are integer multiples of a unit time grid. However, integer time lags are very rare in practices, and therefore models developed using integer time lags only approximate real systems. The differences occurring by this approximation frequently result in significant accuracy degradations. To introduce the ATP model with time lags, we first introduce the dynamic production function. Hackman and Leachman's dynamic production function in initiated research directly related to the topic of this paper. They propose a modeling framework for a system with non-integer time lags and show how to apply the framework to a variety of systems including continues time series, manufacturing resource planning and critical path method. Their formulation requires no additional variables or constraints and is capable of representing real world systems more accurately. Previously, to cope with non-integer time lags, they usually model a concerned system either by rounding lags to the nearest integers or by subdividing the time grid to make the lags become integer multiples of the grid. But each approach has a critical weakness: the first approach underestimates, potentially leading to infeasibilities or overestimates lead times, potentially resulting in excessive work-inprocesses. The second approach drastically inflates the problem size. We consider an optimized ATP system with non-integer time lag in supply chain management. We focus on a worldwide headquarter, distribution centers, and manufacturing facilities are globally networked. We develop a mixed integer programming(MIP) model for ATP process, which has the definition of required data flow. The illustrative ATP module shows the proposed system is largely affected inSCM. The system we are concerned is composed of a multiple production facility with multiple products, multiple distribution centers and multiple customers. For the system, we consider an ATP scheduling and capacity allocationproblem. In this study, we proposed the model for the ATP system in SCM using the dynamic production function considering the non-integer time lags. The model is developed under the framework suitable for the non-integer lags and, therefore, is more accurate than the models we usually encounter. We developed intelligent ATP System for this model using genetic algorithm. We focus on a capacitated production planning and capacity allocation problem, develop a mixed integer programming model, and propose an efficient heuristic procedure using an evolutionary system to solve it efficiently. This method makes it possible for the population to reach the approximate solution easily. Moreover, we designed and utilized a representation scheme that allows the proposed models to represent real variables. The proposed regeneration procedures, which evaluate each infeasible chromosome, makes the solutions converge to the optimum quickly.