• 제목/요약/키워드: Combinatorial method

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

집단간 긍정적.부정적 상호작용을 이용한 다중 집단 개미 모델 (Multi Colony Ant Model using Positive.Negative Interaction between Colonies)

  • 이승관;정태충
    • 정보처리학회논문지B
    • /
    • 제10B권7호
    • /
    • pp.751-756
    • /
    • 2003
  • 개미 집단 최적화는 최근에 제안된 조합 최적화 문제를 해결하기 위한 메타 휴리스틱 탐색 방법으로, 그리디 탐색뿐만 아니라 긍정적 반응의 탐색을 사용한 모집단에 근거한 접근법으로 순회 판매원 문제를 풀기 위해 처음으로 제안되었다. 본 논문에서는 기존의 개미 집단 시스템의 성능을 향상시키기 위해 강화와 다양화를 통한 집단간 긍정적 상호작용과 부정적 상호작용을 수행하는 다중 집단 개미 모델을 제안한다. 이 알고리즘은 TSP 문제를 해결하기 위해 몇 개의 에이전트 집단으로 이루어진 ACS 집단간의 상호작용을 통해 문제를 해결하는 방법이다. 본 논문에서는 이 제안된 방법을 TSP 문제에 적용해 보고 그 성능에 대해 기존의 ACS 방법과 비교 평가해, 문제 해결의 질적 수준이 우수하다는 것을 실험을 통해 알아보고자 한다.

이산적 입지 공간의 경쟁적 입지 문제를 해결하기 위한 GIS 기반 기하학적 방법론 연구 (A GIS-based Geometric Method for Solving the Competitive Location Problem in Discrete Space)

  • 이건학
    • 대한지리학회지
    • /
    • 제46권3호
    • /
    • pp.366-381
    • /
    • 2011
  • 일반적으로 이산적 입지 공간에서 경쟁적 입지 문제는 입지 후보지에 따라 수많은 조합의 경우가 발생하는 의사결정 문제이기 때문에, 수리적으로 계산하기가 쉽지 않다. 따라서 본 연구에서는 결정적 배분 형태를 가정한 이산적 입지 공간의 경쟁적 입지 문제를 보다 효율적으로 해결하기 위한 대안적 방법에 대해 논의한다. 제안된 방법론의 핵심은 입지 문제의 크기와 관련되는 잠재적 입지후보지의 개수를 기하학적 개념을 이용하여 줄이는 것이다. 사례 분석으로 경쟁이 가열화되고 있는 초고속 인터넷 시장을 대상으로 제안된 방법론을 적용하였는데 두 가지 다른 크기의 문제, 즉 연구 지역 전체에 대해 정의된 잠재적 입지 후보지와 GIS 기반의 기하학적 알고리즘에 의해 추출된 보다 적은 수의 잠재적 입지 후보지에 대해 계산 결과와 공간적 배열을 비교하였다. 사례 분석 결과, 두 문제 모두 고객 유치를 최대화시키는 동일한 최적 입지를 보여주는 한편, 적은 수의 잠재적 입지 후보지를 가진 경쟁적 입지 모델이 보다 효율적으로 해결될 수 있었다.

ISO Coordination of Generator Maintenance Scheduling in Competitive Electricity Markets using Simulated Annealing

  • Han, Seok-Man;Chung, Koo-Hyung;Kim, Balho-H.
    • Journal of Electrical Engineering and Technology
    • /
    • 제6권4호
    • /
    • pp.431-438
    • /
    • 2011
  • To ensure that equipment outages do not directly impact the reliability of the ISO-controlled grid, market participants request permission and receive approval for planned outages from the independent system operator (ISO) in competitive electricity markets. In the face of major generation outages, the ISO will make a critical decision as regards the scheduling of the essential maintenance for myriads of generating units over a fixed planning horizon in accordance with security and adequacy assessments. Mainly, we are concerned with a fundamental framework for ISO's maintenance coordination in order to determine precedence of conflicting outages. Simulated annealing, a powerful, general-purpose optimization methodology suitable for real combinatorial search problems, is used. Generally, the ISO will put forward its best effort to adjust individual generator maintenance schedules according to the time preferences of each power generator (GENCO) by taking advantage of several factors such as installed capacity and relative weightings assigned to the GENCOs. Thus, computer testing on a four-GENCO model is conducted to demonstrate the effectiveness of the proposed method and the applicability of the solution scheme to large-scale maintenance scheduling coordination problems.

유전 알고리즘을 이용한 생산 및 분배 계획 (A study on the Production and distribution planning using a genetic algorithm)

  • 정성원;장양자;박진우
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2001년도 추계학술대회 논문집
    • /
    • pp.253-256
    • /
    • 2001
  • Today's rapid development in the computer and network technology makes the environment which enables the companies to consider their decisions on the wide point of view and enables the software vendors to make the software packages to help these decisions. To make these software packages, many algorithms should be developed. The production and distribution planning problem belongs to those problems that industry manufacturers daily face in organizing their overall production plan. However, this combinatorial optimization problem can not be solved optimally in a reasonable time when large instances are considered. This legitimates the search for heuristic techniques. As one of these heuristic techniques, genetic algorithm has been considered in many researches. A standard genetic algorithm is a problem solving method that apply the rules of reproduction, gene crossover, and mutation to these pseudo-organisms so those organisms can Pass beneficial and survival-enhancing traits to new generation. This standard genetic algorithm should not be applied to this problem directly because when we represent the chromosome of this problem, there may exist high epitasis between genes. So in this paper, we proposed the hybrid genetic algorithm which turns out to better result than standard genetic algorithms

  • PDF

개미 모델 성능에서 다중 에이전트 상호작용 전략의 효과 (The Effect of Multiagent Interaction Strategy on the Performance of Ant Model)

  • 이승관
    • 한국콘텐츠학회논문지
    • /
    • 제5권3호
    • /
    • pp.193-199
    • /
    • 2005
  • 휴리스틱 알고리즘 연구에 있어서 중요한 분야 중 하나가 강화와 다양화의 조화를 맞추는 문제이다. 개미 집단 시스템은 최근에 제안된 조합 최적화문제를 해결하기 위한 메타 휴리스틱 기법으로, 그리디 탐색과 긍정적 보상에 의한 접근법으로 순회 판매원 문제를 풀기 위해 처음으로 제안되었다. 본 논문에서는 기존 개미집단 시스템의 성능을 향상시키기 위해 강화 전략과 다양화 전략으로 나누어진 엘리트 전략을 통해 집단간 긍정적 부정적 상호작용을 수행하는 다중 집단 개미 모델을 제안한다. 그리고, 이 제안된 엘리트 전략에 의한 다중 집단 상호작용 개미 모델을 순회판매원문제에 적용해 보고 그 성능에 대해 기존 개미집단 시스템과 비교한다.

  • PDF

동적 차량경로 문제에 대한 분산 알고리즘 (A Decentralized Coordination Algorithm for a Highly Dynamic Vehicle Routing Problem)

  • 이반스 소와 옥포티;정인재
    • 산업경영시스템학회지
    • /
    • 제42권4호
    • /
    • pp.116-125
    • /
    • 2019
  • The Dynamic Vehicle Routing Problem (DVRP) involves a combinatorial optimization problem where new customer demands become known over time, and old routes must be reconfigured to generate new routes while executing the current solution. We consider the high level of dynamism problem. An application of highly dynamic DVRP is the ambulance service where a patient contacts the service center, followed by an evaluation of case severity, and a visit by a practitioner/ ambulance is scheduled accordingly. This paper considers a variant of the DVRP and proposes a decentralized algorithm in which collaborators (Depot and Vehicle), both have only partial information about the entire system. The DVRP is modeled as a periodic re optimization of VRP using the proposed decentralized algorithm where collaborators exchange local information to achieve the best global objective for the current state of the system. We assume the existence of a dispatcher e.g., headquarter of the company who can communicate to vehicles in order to gather information and assigns the new visits to them. The effectiveness of the proposed decentralized coordination algorithm is further evaluated using benchmark data given in literature. The results show that the proposed method performed better than the compared algorithms which utilize the centralized coordination in 12 out of 21 benchmark problems.

Optimization of 3G Mobile Network Design Using a Hybrid Search Strategy

  • Wu Yufei;Pierre Samuel
    • Journal of Communications and Networks
    • /
    • 제7권4호
    • /
    • pp.471-477
    • /
    • 2005
  • This paper proposes an efficient constraint-based optimization model for the design of 3G mobile networks, such as universal mobile telecommunications system (UMTS). The model concerns about finding a set of sites for locating radio network controllers (RNCs) from a set of pre-defined candidate sites, and at the same time optimally assigning node Bs to the selected RNCs. All these choices must satisfy a set of constraints and optimize an objective function. This problem is NP-hard and consequently cannot be practically solved by exact methods for real size networks. Thus, this paper proposes a hybrid search strategy for tackling this complex and combinatorial optimization problem. The proposed hybrid search strategy is composed of three phases: A constraint satisfaction method with an embedded problem-specific goal which guides the search for a good initial solution, an optimization phase using local search algorithms, such as tabu algorithm, and a post­optimization phase to improve solutions from the second phase by using a constraint optimization procedure. Computational results show that the proposed search strategy and the model are highly efficient. Optimal solutions are always obtained for small or medium sized problems. For large sized problems, the final results are on average within $5.77\%$ to $7.48\%$ of the lower bounds.

이동통신에서 채널 할당 문제를 위한 Hopfield 신경회로망 모델 (A Hopfield Neural Network Model for a Channel Assignment Problem in Mobile Communication)

  • 김경식;김준철;이준환
    • 한국통신학회논문지
    • /
    • 제18권3호
    • /
    • pp.339-347
    • /
    • 1993
  • 이동통신에 있어서 채널 할당 문제는 조합적 최적화 문제로 문제의 범위가 증가함에 따라 계산량이 지수함수적으로 증가하는 NP-완성형 문제이다. 본 논문에서는 Hopfield 모델을 이용하여 동일 채널 간섭, 인접 기지국 간섭, 동일 기지국 간섭등의 제약조건을 만족하여 각 기지국의 채널 요구량에 따라 채널을 할당하는 방법을 고려하였다. 본 논문에서 고려한 Hopfield 모델은 현재의 하드웨어 구현기술의 제약 요건등을 고려하여 가장 기본적인 모델을 가정하였으며, 고정 채널할당 방법에서 균일, 불균일 트래픽 요구량을 고려하였고, 동적 채널 할당 방법의 적용 가능성을 타진해 보았다.

  • PDF

복합 처방 품질 관리를 위한 시스템 차원의 연구 동향 (Trends in System-level Research on Quality Control of Complex Herbal Formulation)

  • 이두석;김영우
    • 동의생리병리학회지
    • /
    • 제30권6호
    • /
    • pp.397-401
    • /
    • 2016
  • The quality control is a fundamental procedure for the standardization of herbal medicine to guarantee the consistency of efficacy and safety. For a long time, the quality analysis of herbal medicine has been largely dependent on the routine sensory evaluation, such as taste, smell, color, and shape. However, with the recent development of analytical instruments, various scientific approaches have been introduced in this field. On the basis of the theory that the biological activities of herbal medicine are mainly contributed by its chemical compositions, several types of chemical markers have been suggested for the quality evaluation. In addition to the analytical methods for the specific marker compound(s), including analytical marker and active marker, recently, chemical fingerprinting, a method comparing the chromatographic pattern of the whole chemical components, has been developed and widely accepted as a reliable approach for the quality control of herbal medicine. Moreover, in order to exactly understand the relationship between complex compounds and their holistic biological activities in herbal medicine, unique strategies, such as "BECCs (bioactive equivalent combinatorial components)" and "PhytomicsQC" have been established. In this article, we give an overview of the several categories of chemical markers and the recent research trends for the quality evaluation of herbal medicine.

Growth Mechanism of SnO Nanostructures and Applications as an Anode of Lithium-ion Battery

  • Shin, Jeong-Ho;Park, Hyun-Min;Song, Jae-Yong
    • 한국진공학회:학술대회논문집
    • /
    • 한국진공학회 2012년도 제42회 동계 정기 학술대회 초록집
    • /
    • pp.598-598
    • /
    • 2012
  • Rechargeable lithium-ion batteries have been considered the most attractive power sources for mobile electronic devices. Although graphite is widely used as the anode material for commercial lithium-ion batteries, it cannot fulfill the requirement for higher storage capacity because of its insufficient theoretical capacity of 372 mAh/g. For the sake of replacing graphite, Sn-based materials have been extensively investigated as anode materials because they can have much higher theoretical capacities (994 mAh/g for Sn, 875 mAh/g for SnO, 783 mAh/g for $SnO_2$). However, these materials generate huge volume expansion and shrinkage during $Li^+$ intercalation and de-intercalation and result in the pulverization and cracking of the contact between anode materials and current collector. Therefore, there have been significant efforts of avoiding these drawbacks by using nanostructures. In this study, we present the CVD growth of SnO branched nanostructures on Cu current collector without any binder, using a combinatorial system of the vapor transport method and resistance heating technique. The growth mechanism of SnO branched nanostructures is introduced. The SnO nanostructures are evaluated as an anode for lithium-ion battery. Remarkably, they exhibited very high discharge capacities, over 520mAh/g and good coulombic efficiency up to 50 cylces.

  • PDF