• 제목/요약/키워드: ACO

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

시간대 제약이 있는 차량경로 결정문제를 위한 2단계 해법의 개발 (A Two-phase Method for the Vehicle Routing Problems with Time Windows)

  • 홍성철;박양병
    • 산업공학
    • /
    • 제17권spc호
    • /
    • pp.103-110
    • /
    • 2004
  • This paper presents a two-phase method for the vehicle routing problems with time windows(VRPTW). In a supply chain management(SCM) environment, timely distribution is very important problem faced by most industries. The VRPTW is associated with SCM for each customer to be constrained the time of service. In the VRPTW, the objective is to design the least total travel time routes for a fleet of identical capacitated vehicles to service geographically scattered customers with pre-specified service time windows. The proposed approach is based on ant colony optimization(ACO) and improvement heuristic. In the first phase, an insertion based ACO is introduced for the route construction and its solutions is improved by an iterative random local search in the second phase. Experimental results show that the proposed two-phase method obtains very good solutions with respect to total travel time minimization.

A hybrid imperialist competitive ant colony algorithm for optimum geometry design of frame structures

  • Sheikhi, Mojtaba;Ghoddosian, Ali
    • Structural Engineering and Mechanics
    • /
    • 제46권3호
    • /
    • pp.403-416
    • /
    • 2013
  • This paper describes new optimization strategy that offers significant improvements in performance over existing methods for geometry design of frame structures. In this study, an imperialist competitive algorithm (ICA) and ant colony optimization (ACO) are combined to reach to an efficient algorithm, called Imperialist Competitive Ant Colony Optimization (ICACO). The ICACO applies the ICA for global optimization and the ACO for local search. The results of optimal geometry for three benchmark examples of frame structures, demonstrate the effectiveness and robustness of the new method presented in this work. The results indicate that the new technique has a powerful search strategies due to the modifications made in search module of ICACO. Higher rate of convergence is the superiority of the presented algorithm in comparison with the conventional mathematical methods and non hybrid heuristic methods such as ICA and particle swarm optimization (PSO).

Hamiltonian Path Problem을 위한 DNA 컴퓨팅의 코드 최적화 (Code optimization of DNA computing for Hamiltonian path problem)

  • 김은경;이상용
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2002년도 가을 학술발표논문집 Vol.29 No.2 (2)
    • /
    • pp.241-243
    • /
    • 2002
  • DNA 컴퓨팅은 생체 분자들이 갖는 막대한 병렬성을 정보 처리 기술에 적용한 기술이다. Adleman의 DNA 컴퓨팅은 랜덤한 고정길이의 형태로 문제를 표현하기 때문에 해를 찾지 못하거나 시간이 많이 걸리는 단점을 갖고 있다. 본 논문은 DNA 컴퓨팅에 DNA 코딩 방법을 적용하여 DNA 서열을 효율적으로 표현하고 반응횟수 만큼 합성과 분리 과정을 거쳐 최적의 코드를 생성하는 ACO(Algorithm for Code Optimization)를 제안한다. DNA 코딩 방법은 변형된 유전자 알고리즘으로 DNA 기능을 유지하며, 서열의 길이를 줄일 수 있으므로 최적의 서열을 생성할 수 있는 특징을 갖는다. ACO를 NP-complete 문제 중 Hamiltonian path problem에 적용하여 실험한 결과, Adleman의 DNA 컴퓨팅 보다 초기 문제 표현에서 높은 적합도 값을 갖는 서열을 생성했으며, 경로의 변화에도 능동적으로 대처하여 최적의 결과를 빠르게 탐색할 수 있었다.

  • PDF

무선 센서 네트워크에서의 에너지 효율적인 기반의 ACO 라우팅 알고리즘 설계 (Design of An Energy-efficient Routing Algorithm based on ACO for Wireless Sensor Networks)

  • 최재원;정의현;박용진
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2006년도 가을 학술발표논문집 Vol.33 No.2 (D)
    • /
    • pp.621-624
    • /
    • 2006
  • 무선 센서 네트워크는 기존의 무선 통신 기술로는 구현 불가능했던 다양한 응용 기술의 실현을 가능케 할 것으로 기대되고 있다. 이를 위해 제한된 자원의 효율적인 사용을 통한 무선 센서 네트워크의 성능 향상에 대한 연구가 지속되고 있으며 네트워크 계층에 있어서는 에너지 효율적인 라우팅 알고리즘에 대한 연구가 활발히 진행되고 있다. 본 논문에서는 데이터 중심(data-centric) 멀티 홉(multi-hop) 평면 라우팅 알고리즘에 최적화 알고리즘의 하나인 Ant Colony Optimization을 적용한 에너지 효율적인 라우팅 알고리즘을 제안한다. 시뮬레이션 결과, 제안한 알고리즘은 기존의 알고리즘에 비해 데이터 전송 지연 시간을 줄였을 뿐만 아니라, 경로 선택 및 유지에 필요한 제어 메시지 최소화를 통해 에너지 소모를 줄여 데이터 전송량의 증가를 가능케 했다.

  • PDF

Travelling Salesman Problem을 위한 DNA 컴퓨팅의 코드 최적화 (Code Optimization of DNA Computing for Travelling Salesman Problem)

  • 김은경;이상용
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2002년도 추계학술발표논문집 (상)
    • /
    • pp.323-326
    • /
    • 2002
  • DNA 컴퓨팅은 생체 분자들이 갖는 막대한 병렬성을 이용하여 조합 최적화 문제에 적용하는 연구가 많이 시도되고 있다. 특히 TSP(Travelling Salesman Problem)는 간선에 대한 가중치 정보가 추가되어 있기 때문에 가중치를 DNA 염기 배열로 표현하기 위한 효율저인 방법들이 제시되지 않았다. 따라서 본 논문에서는 DNA 컴퓨팅에 DNA 코딩 방법을 적용하여 정점과 간선을 효율적으로 생성하고 표현된 DNA 염기 배열의 간선에 실제간을 적용하여 가중치 정보를 계산하는 ACO(Algorithm for Code Optimization)를 제안한다. DNA 코딩 방법은 변형된 유전자 알고리즘으로 DNA 기능을 유지하며, 서열의 길이를 줄일 수 있으므로 최적의 서열을 생성할 수 있는 특징을 갖는다. 실험에서 ACO를 TSP에 적용하여 Adleman의 DNA 컴퓨팅 알고리즘과 비교하였다. 그 결과 초기 문제 표현에서 우수한 적합도 값을 생성했으며, 경로의 변화에도 능동적으로 대처하여 최적의 결과를 빠르게 탐색할 수 있었다.

  • PDF

Novel Two-Level Randomized Sector-based Routing to Maintain Source Location Privacy in WSN for IoT

  • Jainulabudeen, A.;Surputheen, M. Mohamed
    • International Journal of Computer Science & Network Security
    • /
    • 제22권3호
    • /
    • pp.285-291
    • /
    • 2022
  • WSN is the major component for information transfer in IoT environments. Source Location Privacy (SLP) has attracted attention in WSN environments. Effective SLP can avoid adversaries to backtrack and capture source nodes. This work presents a Two-Level Randomized Sector-based Routing (TLRSR) model to ensure SLP in wireless environments. Sector creation is the initial process, where the nodes in the network are grouped into defined sectors. The first level routing process identifies sector-based route to the destination node, which is performed by Ant Colony Optimization (ACO). The second level performs route extraction, which identifies the actual nodes for transmission. The route extraction is randomized and is performed using Simulated Annealing. This process is distributed between the nodes, hence ensures even charge depletion across the network. Randomized node selection process ensures SLP and also avoids depletion of certain specific nodes, resulting in increased network lifetime. Experiments and comparisons indicate faster route detection and optimal paths by the TLRSR model.

Regulation of Ethylene Biosynthesis by Phytohormones in Etiolated Rice (Oryza sativa L.) Seedlings

  • Lee, Han Yong;Yoon, Gyeong Mee
    • Molecules and Cells
    • /
    • 제41권4호
    • /
    • pp.311-319
    • /
    • 2018
  • The gaseous hormone ethylene influences many aspects of plant growth, development, and responses to a variety of stresses. The biosynthesis of ethylene is tightly regulated by various internal and external stimuli, and the primary target of the regulation is the enzyme 1-aminocyclopropane-1-carboxylic acid (ACC) synthase (ACS), which catalyzes the rate-limiting step of ethylene biosynthesis. We have previously demonstrated that the regulation of ethylene biosynthesis is a common feature of most of the phytohormones in etiolated Arabidopsis seedlings via the modulation of the protein stability of ACS. Here, we show that various phytohormones also regulate ethylene biosynthesis from etiolated rice seedlings in a similar manner to those in Arabidopsis. Cytokinin, brassinosteroids, and gibberellic acid increase ethylene biosynthesis without changing the transcript levels of neither OsACS nor ACC oxidases (OsACO), a family of enzymes catalyzing the final step of the ethylene biosynthetic pathway. Likewise, salicylic acid and abscisic acid do not alter the gene expression of OsACS, but both hormones downregulate the transcript levels of a subset of ACO genes, resulting in a decrease in ethylene biosynthesis. In addition, we show that the treatment of the phytohormones results in distinct etiolated seedling phenotypes, some of which resemble ethylene-responsive phenotypes, while others display ethylene-independent morphologies, indicating a complicated hormone crosstalk in rice. Together, our study brings a new insight into crosstalk between ethylene biosynthesis and other phytohormones, and provides evidence that rice ethylene biosynthesis could be regulated by the post-transcriptional regulation of ACS proteins.

Surgically Treated Anterior Communicating Artery Aneurysm

  • Koo, Sang-Keun;Song, Yeung-Jin;Huh, Jae-Taeck
    • Journal of Korean Neurosurgical Society
    • /
    • 제37권6호
    • /
    • pp.405-409
    • /
    • 2005
  • Objective: The purpose of this study is to assess the factors related to the outcome of 84 patients who underwent surgery for anterior communicating Artery(ACoA) aneurysms. Methods: The authors review 84 patients who were undertaken from January 1998 to May 2004. In the management of ACoA aneurysms, the outcome was based on several factors: Clinical condition, Distribution of hemorrhage, Time between aneurysmal rupture and surgery, Direction and shape of the aneurysm. Results: The incidence rate of the ACoA aneurysm was 35%. Seventy four patients were classified as those having a good recovery, but 5 patients suffered from some morbidity and 5 patients died. The rate of good outcome for the patients with Hunt and Hess grade was as follows 100% in grade I, 95% in grade II, 80% in grade III, IV and V. The rate of good outcome for the patients with Fisher grade was as follows 98% in grade I, II and 81% in grade III, IV. Nineteen of 22 patients who underwent early surgery were rated as good, while twenty six of 30 patients for whom surgery was delayed showed a favorable result. The unfavorable outcomes were also attributed by vasospasm or other medical problems. Conclusion: For further improvement of the overall surgical outcome: First, early surgical intervention is recommended for good grade patients. Second, active management of poor grade patients should be scrutinized with early surgery. Third, it is also important to step up the effort to minimize the risk of medical complications to enhance surgical results on top of the mainstay of prevention efforts for vasospasm and rebleeding.

개미군집 최적화 알고리즘을 이용한 상수도관망 시스템의 최저비용설계 모델의 현장 적용 (Field Application of Least Cost Design Model on Water Distribution Systems using Ant Colony Optimization Algorithm)

  • 박상혁;최홍순;구자용
    • 상하수도학회지
    • /
    • 제27권4호
    • /
    • pp.413-428
    • /
    • 2013
  • In this study, Ant Colony Algorithm(ACO) was used for optimal model. ACO which are metaheuristic algorithm for combinatorial optimization problem are inspired by the fact that ants are able to find the shortest route between their nest and food source. For applying the model to water distribution systems, pipes, tanks(reservoirs), pump construction and pump operation cost were considered as object function and pressure at each node and reservoir level were considered as constraints. Modified model from Ostfeld and Tubaltzev(2008) was verified by applying 2-Looped, Hanoi and Ostfeld's networks. And sensitivity analysis about ant number, number of ants in a best group and pheromone decrease rate was accomplished. After the verification, it was applied to real water network from S water treatment plant. As a result of the analysis, in the Two-looped network, the best design cost was found to $419,000 and in the Hanoi network, the best design cost was calculated to $6,164,384, and in the Ostfeld's network, the best design cost was found to $3,525,096. These are almost equal or better result compared with previous researches. Last, the cost of optimal design for real network, was found for 66 billion dollar that is 8.8 % lower than before. In addition, optimal diameter for aged pipes was found in this study and the 5 of 8 aged pipes were changed the diameter. Through this result, pipe construction cost reduction was found to 11 percent lower than before. And to conclusion, The least cost design model on water distribution system was developed and verified successfully in this study and it will be very useful not only optimal pipe change plan but optimization plan for whole water distribution system.