• Title/Summary/Keyword: Problem instance

Search Result 250, Processing Time 0.023 seconds

A decomposition algorithm for local access telecommunication network design problem

  • Cho, Geon
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1995.04a
    • /
    • pp.54-68
    • /
    • 1995
  • In this paper, we develop detailed algorithms for implementing the so-called Limited Column Generation procedure for Local Access Telecommunication Network (LATN) Design problem. We formulate the problem into a tree-partitioning problem with an exponential number of variables. Its linear programming relaxation has all integral vertices, and can be solved by the Limited Column. Generation procedure in just n pivots, where n is the number of nodes in the network. Prior to each pivot, an entering variable is selected by detecting the Locally Most Violated (LMV) reduced cost, which can be obtained by solving a subproblem in pseudo-polynomial time. A critical step in the Limited Column Generation is to find all the LMV reduced costs. As dual variables are updated at each pivot, the reduced costs have to be computed in an on-line fashion. An efficient implementation is developed to execute such a task so that the LATN Design problem can be solved in O(n$^{2}$H), where H is the maximum concentrator capacity. Our computational experiments indicate that our algorithm delivers an outstanding performance. For instance, the LATN Design problem with n = 150 and H = 1000 can be solved in approximately 67 seconds on a SUN SPARC 1000 workstation.

  • PDF

Solving the Team Orienteering Problem with Particle Swarm Optimization

  • Ai, The Jin;Pribadi, Jeffry Setyawan;Ariyono, Vincensius
    • Industrial Engineering and Management Systems
    • /
    • v.12 no.3
    • /
    • pp.198-206
    • /
    • 2013
  • The team orienteering problem (TOP) or the multiple tour maximum collection problem can be considered as a generic model that can be applied to a number of challenging applications in logistics, tourism, and other fields. This problem is generally defined as the problem of determining P paths, in which the traveling time of each path is limited by $T_{max}$ that maximizes the total collected score. In the TOP, a set of N vertices i is given, each with a score $S_i$. The starting point (vertex 1) and the end point (vertex N) of all paths are fixed. The time $t_{ij}$ needed to travel from vertex i to j is known for all vertices. Some exact and heuristics approaches had been proposed in the past for solving the TOP. This paper proposes a new solution methodology for solving the TOP using the particle swarm optimization, especially by proposing a solution representation and its decoding method. The performance of the proposed algorithm is then evaluated using several benchmark datasets for the TOP. The computational results show that the proposed algorithm using specific settings is capable of finding good solution for the corresponding TOP instance.

Regioselective Acylation on Glycol Chitosan (글라이콜 키토산의 위치선택적 아실화)

  • Lee, Wonbum;Park, Chong-Rae
    • Proceedings of the Korean Fiber Society Conference
    • /
    • 2003.04a
    • /
    • pp.297-298
    • /
    • 2003
  • Chitin is a natural biopolymer that, with its derivative chitosan, has been represented as a biomaterial with considerable potential in wide ranging medical applications. But there are some limitations in using chitosan as attained, for instance, the problem of water solubility$^1$. In order to use chitosan in various applications (e.g. drug carrier), chemical modifications are often necessary$^2$. (omitted)

  • PDF

Evolutionary Approach for Traveling Salesperson Problem with Precedence Constraints

  • Moon, Chi-Ung;Yun, Young-Su
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2007.04a
    • /
    • pp.305-308
    • /
    • 2007
  • In this paper we suggest an efficient evolutionary approach based on topological sort techniques for precedence constrained TSPs. The determination of optimal sequence has much to offer to downstream project management and opens up new opportunities for supply chains and logistics. Experimental results show that the suggested approach is a good alternative to locate optimal solution for complicated precedence constrained sequencing as in optimization method for instance.

  • PDF

Self tuning control with offset elimination for nonminimum phase system (비최소 위상 시스템에 대하여 오프셋(offset) 제거 기능을 가진 자기 동조 제어)

  • 나종래;변증남
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1986.10a
    • /
    • pp.78-82
    • /
    • 1986
  • In the process control applications of self tuning control, a major concern of the control problem is to handle an offset caused by load disturbances and random steps occuring at random instance of time. Conventionally an integrator is incorperated in the forward path of the controller to eliminate such an offset. But this approach causes a difficulty if the adaptive part of the resultant controller is to be evaluated. In this paper a method of analyzing the adaptive system and improving the offset effect is suggested for a class of referance model method in the self tuning adaptive control system.

  • PDF

Adaptive Control of Robotic Manipulators Using Multiple Models and (다중모델과 스위칭을 이용한 로봇 매니퓰레이터의 적응제어)

  • Rhee, Hyoung-Chan
    • Proceedings of the KIEE Conference
    • /
    • 1997.07b
    • /
    • pp.693-695
    • /
    • 1997
  • This paper deals with the tracking control problem of robotic manipulators with unknown or changing dynamics. The torque input applied to the joint actuators is determined at every instance by the identification model that best approximates the robot dynamics. The best of the identified model is chosen by the proposed switching mechanism with fuzzy inference of the manipulator in an indirect adaptive controller architecture. Simulation results are also included to demonstrate the improvement in the tracking performance when the proposed method is used.

  • PDF

Design of the 0-1 Knapsack Processor using VHDL (VHDL을 이용한 0-1 Knapsack 프로세서의 설계)

  • 이재진;송호정;송기용
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2000.08a
    • /
    • pp.341-344
    • /
    • 2000
  • The 0-1 knapsack processor performing dynamic programming is designed and implemented on a programmable logic device. Three types of a processor, each with different behavioral models, are presented, and the operation of a processor of each type is verified with an instance of the 0-1 knapsack problem.

  • PDF

Key Success Factors for Collaborative Technology Development Projects: The Case of Small & Medium Firms in the Korean Electronics Parts Industry (공동기술개발 프로젝트의 성패요인: 우리나라 전자부품 중소기업 분석)

  • 이광희;김영배
    • Journal of Technology Innovation
    • /
    • v.6 no.2
    • /
    • pp.122-158
    • /
    • 1998
  • This study empirically examined different patterns of collaborative R&D project with their key success factors(KSFs), using data from 82 projects in the Korean electronic parts industry. The patterns of R&D collaboration were categorized into 4 types by two criteria development motive(technology Push/market pull) and Project initiator (focal firm/partner). The bivariate relationships revealed that project characteristics (technological complexity, market uncertainty), management characteristics (participation in project formulation), problem solving characteristics(problem solving performance of the focal firm, users active role in problem solving, active role of university or research institute in problem solving) and success rates appear to be different among four types of collaboration. Each type of collaborative R&D projects also had different KSFs. The KSFs of type 1 (technology Push and focal firm initiation), for instance, include the strategic importance of the project, focal firms share of cost, active role of university or research institute in problem solving, while those of type 4(market pull and customer initiation) cover reliability of partner relationship, a time at partners involvement, information sharing. The findings suggest that the different contingencies brought different patterns and KSFs of collaborative R&D project, since different information, resources, and partners roles were needed to successfully implement the projects according to development motive and project initiator Finally, managerial, policy, and theoretical implications for the collaborative R&D activities in the Korean electronics parts industry were discussed, based on empirical results of this study.

  • PDF

Faraday Rotation Measure in the Large Scale Structure III

  • Akahori, Takuya;Ryu, Dong-Su
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.35 no.2
    • /
    • pp.75.1-75.1
    • /
    • 2010
  • The nature and origin of the intergalactic magnetic field (IGMF) are an outstanding problem of cosmology, yet they are not well understood. Measuring Faraday rotation (RM) is one of a few promising methods to explore the IGMF. We have theoretically investigated RM using a model of the IGMF based on a MHD turbulence dynamo (Ryu et al. 2008; Cho et al. 2009). In the previous KAS meeting, we reported the results for the present-day local universe; for instance, the probability distribution function (PDF) of ${\mid}RM{\mid}$ follows the lognormal distribution, the root mean square (rms) value for filaments is ~1 rad m^{-2}, and the power spectrum peaks at ~1 h^{-1} Mpc scale. In this talk, we extend our study of RM; by stacking simulation data up to redshift z=5 and taking account of the redshift distribution of radio sources, we have reproduced an observable view of RM through filaments against background radio sources. Our findings are as follows. The inducement of RM is a random walk process, so that the rms of RM increases with increasing path length. The rms value of RM for filaments reaches several rad m^{-2}. The PDF still follows the lognormal distribution, and the power spectrum of RM peaks at less than degree scale. Our predictions of RM could be tested, for instance, with LOFAR, ASKAP, MEERKAT, and SKA.

  • PDF

Development of Priority Evaluation Framework for IT System Consolidation using Global Single Instance in Hightech Industry (하이테크 분양의 GSI 구현 대상 우선순위 평가 방법 및 적용 방안 연구)

  • Lee, Chi-Hun;Chang, Min-Yong;Seo, Jong-Hyen
    • Journal of the Korea Safety Management & Science
    • /
    • v.11 no.1
    • /
    • pp.175-182
    • /
    • 2009
  • The effort for GSI based IT system consolidation has been continued due to the increase of the system and complication increase of system connection, mainly by the global company. Since successful example of GSI realization by part of developed company affect to Korea, global level IT system consolidation has been examined mainly by the domestic company that have great deal of overseas business. Although they have examined consolidation possibility mainly on R&D, finance, operation management part which is the base part of company management, there are limitation for consolidation realization because of the difference between regional business problem of huge cost needed for consolidation. To overcome these realization limitations, it is necessary to lead risk and cost reduction through stepwise part unity and decide Priority Evaluation Framework for Consolidation target and systematic consolidation strategy. For GSI realization, appropriate distributions of unification time according to target system are needed. In this study, based on easiness and usefulness of consolidation and connection between the targets, evaluation methodology for Priority Evaluation Framework of system consolidation has been developed. Priority Evaluation Framework has been decided by applying developed methodology to global production company of high tech industrial part. Through this methodology, companies can realize successful and stable GSI by investing global resources intensively by Priority Evaluation Framework of consolidation target system.