• 제목/요약/키워드: Ant Colony Optimization

검색결과 140건 처리시간 0.023초

유전알고리즘을 이용한 지속가능 공간최적화 모델 기초연구 - 선행연구 분석을 중심으로 - (Basic Study on Spatial Optimization Model for Sustainability using Genetic Algorithm - Based on Literature Review -)

  • 윤은주;이동근
    • 한국환경복원기술학회지
    • /
    • 제20권6호
    • /
    • pp.133-149
    • /
    • 2017
  • As cities face increasing problems such as aging, environmental pollution and growth limits, we have been trying to incorporate sustainability into urban planning and related policies. However, it is very difficult to generate a 'sustainable spatial plans' because there are trade-offs among environmental, society, and economic values. This is a kind of non-linear problem, and has limitations to be solved by existing qualitative expert knowledge. Many researches from abroad have used the meta heuristic optimization algorithms such as Genetic Algorithms(GAs), Simulated Annealing(SA), Ant Colony Optimization(ACO) and so on to synthesize competing values in spaces. GAs is the most frequently applied theory and have been known to produce 'good-enough plans' in a reasonable time. Therefore we collected the research on 'spatial optimization model based GAs' and analyzed in terms of 'study area', 'optimization objective', 'fitness function', and 'effectiveness/efficiency'. We expect the results of this study can suggest that 'what problems the spatial optimization model can be applied to' and 'linkage possibility with existing planning methodology'.

CO2 emissions optimization of reinforced concrete ribbed slab by hybrid metaheuristic optimization algorithm (IDEACO)

  • Shima Bijari;Mojtaba Sheikhi Azqandi
    • Advances in Computational Design
    • /
    • 제8권4호
    • /
    • pp.295-307
    • /
    • 2023
  • This paper presents an optimization of the reinforced concrete ribbed slab in terms of minimum CO2 emissions and an economic justification of the final optimal design. The design variables are six geometry variables including the slab thickness, the ribs spacing, the rib width at the lower and toper end, the depth of the rib and the bar diameter of the reinforcement, and the seventh variable defines the concrete strength. The objective function is considered to be the minimum amount of carbon dioxide gas (CO2) emission and at the same time, the optimal design is economical. Seven significant design constraints of American Concrete Institute's Standard were considered. A robust metaheuristic optimization method called improved dolphin echolocation and ant colony optimization (IDEACO) has been used to obtain the best possible answer. At optimal design, the three most important sources of CO2 emissions include concrete, steel reinforcement, and formwork that the contribution of them are 63.72, 32.17, and 4.11 percent respectively. Formwork, concrete, steel reinforcement, and CO2 are the four most important sources of cost with contributions of 67.56, 19.49, 12.44, and 0.51 percent respectively. Results obtained by IDEACO show that cost and CO2 emissions are closely related, so the presented method is a practical solution that was able to reduce the cost and CO2 emissions simultaneously.

MANET에서 군집지능을 이용한 라우팅 방안 (A Routing Method Using Swarm Intelligence in MANETs)

  • 우미애;;노우종
    • 한국통신학회논문지
    • /
    • 제33권7B호
    • /
    • pp.550-556
    • /
    • 2008
  • 군집지능은 단순한 객체들이 팀을 이루어 간단, 단순한 행동을 조합하여 복잡하고 의미 있는 과제를 수행하는 것을 말한다. 네트워크 라우팅 분야에서도 이러한 군집지능을 이용한 연구가 수행되어 왔다. 특히 동적 토폴로지에서 지역적 정보를 이용한 경로 설정이 필요한 이동 애드혹 네트워크 (mobile ad-hoc network: MANET)에서의 라우팅은 군집지능의 한 응용분야로 알려져 있다. 본 논문에서는 MANET에서 개미의 군집지능을 이용한 라우팅 방안을 제안한다. 제안 방안은 효율적인 개미 관리를 통하여 오버헤드를 줄이고, 경로 설정시간을 단축하는 것을 목표로 설정하였다. 모의실험 결과, 제안 방안은 패킷 전송율의 성능은 유지하면서 경로 설정시간, 종단간 지연, 오버헤드에서는 향상된 성능을 보여주었다.

Routing Protocol for Wireless Sensor Networks Based on Virtual Force Disturbing Mobile Sink Node

  • Yao, Yindi;Xie, Dangyuan;Wang, Chen;Li, Ying;Li, Yangli
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권4호
    • /
    • pp.1187-1208
    • /
    • 2022
  • One of the main goals of wireless sensor networks (WSNs) is to utilize the energy of sensor nodes effectively and maximize the network lifetime. Thus, this paper proposed a routing protocol for WSNs based on virtual force disturbing mobile Sink node (VFMSR). According to the number of sensor nodes in the cluster, the average energy and the centroid factor of the cluster, a new cluster head (CH) election fitness function was designed. At the same time, a hexagonal fixed-point moving trajectory model with the best radius was constructed, and the virtual force was introduced to interfere with it, so as to avoid the frequent propagation of sink node position information, and reduce the energy consumption of CH. Combined with the improved ant colony algorithm (ACA), the shortest transmission path to Sink node was constructed to reduce the energy consumption of long-distance data transmission of CHs. The simulation results showed that, compared with LEACH, EIP-LEACH, ANT-LEACH and MECA protocols, VFMSR protocol was superior to the existing routing protocols in terms of network energy consumption and network lifetime, and compared with LEACH protocol, the network lifetime was increased by more than three times.

직렬시스템의 신뢰도 최적 설계를 위한 Hybrid 병렬 유전자 알고리즘 해법 (A Hybrid Parallel Genetic Algorithm for Reliability Optimal Design of a Series System)

  • 김기태;전건욱
    • 산업경영시스템학회지
    • /
    • 제33권2호
    • /
    • pp.48-55
    • /
    • 2010
  • Reliability has been considered as a one of the major design measures in various industrial and military systems. The main objective is to suggest a mathematical programming model and a hybrid parallel genetic algorithm(HPGA) for the problem that determines the optimal component reliability to maximize the system reliability under cost constraint in this study. Reliability optimization problem has been known as a NP-hard problem and normally formulated as a mixed binary integer programming model. Component structure, reliability, and cost were computed by using HPGA and compared with the results of existing meta-heuristic such as Ant Colony Optimization(ACO), Simulated Annealing(SA), Tabu Search(TS) and Reoptimization Procedure. The global optimal solutions of each problem are obtained by using CPLEX 11.1. The results of suggested algorithm give the same or better solutions than existing algorithms, because the suggested algorithm could paratactically evolved by operating several sub-populations and improving solution through swap and 2-opt processes.

Faster pipe auto-routing using improved jump point search

  • Min, Jwa-Geun;Ruy, Won-Sun;Park, Chul Su
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • 제12권1호
    • /
    • pp.596-604
    • /
    • 2020
  • Previous studies on pipe auto-routing algorithms generally used such algorithms as A*, Dijkstra, Genetic Algorithm, Particle Swarm Optimization, and Ant Colony Optimization, to satisfy the relevant constraints of its own field and improve the output quality. On the other hand, this study aimed to significantly improve path-finding speed by applying the Jump Point Search (JPS) algorithm, which requires lower search cost than the abovementioned algorithms, for pipe routing. The existing JPS, however, is limited to two-dimensional spaces and can only find the shortest path. Thus, it requires several improvements to be applied to pipe routing. Pipe routing is performed in a three-dimensional space, and the path of piping must be parallel to the axis to minimize its interference with other facilities. In addition, the number of elbows must be reduced to the maximum from an economic perspective, and preferred spaces in the path must also be included. The existing JPS was improved for the pipe routing problem such that it can consider the above-mentioned problem. The fast path-finding speed of the proposed algorithm was verified by comparing it with the conventional A* algorithm in terms of resolution.

A Metaheuristic Approach Towards Enhancement of Network Lifetime in Wireless Sensor Networks

  • J. Samuel Manoharan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권4호
    • /
    • pp.1276-1295
    • /
    • 2023
  • Sensor networks are now an essential aspect of wireless communication, especially with the introduction of new gadgets and protocols. Their ability to be deployed anywhere, especially where human presence is undesirable, makes them perfect choices for remote observation and control. Despite their vast range of applications from home to hostile territory monitoring, limited battery power remains a limiting factor in their efficacy. To analyze and transmit data, it requires intelligent use of available battery power. Several studies have established effective routing algorithms based on clustering. However, choosing optimal cluster heads and similarity measures for clustering significantly increases computing time and cost. This work proposes and implements a simple two-phase technique of route creation and maintenance to ensure route reliability by employing nature-inspired ant colony optimization followed by the fuzzy decision engine (FDE). Benchmark methods such as PSO, ACO and GWO are compared with the proposed HRCM's performance. The objective has been focused towards establishing the superiority of proposed work amongst existing optimization methods in a standalone configuration. An average of 15% improvement in energy consumption followed by 12% improvement in latency reduction is observed in proposed hybrid model over standalone optimization methods.

동적 상황인식 기반 경로 선정 기법 연구 (A Study on Path Selection Mechanism Based on Dynamic Context-Awareness)

  • 최경미;박영호
    • 한국멀티미디어학회:학술대회논문집
    • /
    • 한국멀티미디어학회 2012년도 춘계학술발표대회논문집
    • /
    • pp.234-235
    • /
    • 2012
  • 본 논문에서는 개미 집단 최적화(Ant Colony Optimization, ACO) 알고리즘을 적용한 감속률에 따른 동적 상황인식 경로 선정 방법을 제안한다. 최근 ITS(Intelligent Transportation Systems)의 개발과 함께 차량용 내비게이션의 실시간 교통 정보를 이용하는 수요가 급증하면서, 경로탐색의 중요성이 더욱 가속화되고 있다. 현재 차량용 내비게이션은 멀티미디어 및 정보통신 기술의 결합과 함께 다양한 기능 및 정보를 사용자에게 제공하고 있으며, 이러한 경로탐색 알고리즘은 교통시스템, 통신 네트워크, 운송 시스템 등 다양한 분야에 적용되고 있다. 본 논문에서는 감속률에 따른 동적 상황인식 경로 선정 방법을 제안함으로써, 최단 시간 및 최소 비용의 정보를 제공해 줄 뿐만 아니라 교통정체로 인한 사회적 비용 감소의 효과를 가져다 줄 것으로 기대한다.

  • 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

도시 차량 애드 혹 네트워크를 위한 라우팅 프로토콜 (A Routing Protocol for Urban Vehicular Ad Hoc Networks)

  • 윤요한;김명철
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2011년도 한국컴퓨터종합학술대회논문집 Vol.38 No.1(D)
    • /
    • pp.145-148
    • /
    • 2011
  • 무선 네트워크를 이용한 서비스가 보편화됨에 따라 차량을 통한 네트워크 역시 그 기술의 중요성이 부각되고 있다. 각 차량을 통신 주체로 하는 VANET은 라우팅 프로토콜이 통신의 중요한 요소이지만, MANET 라우팅 프로토콜에 비하여 그 연구가 미비하다. 본 연구에서는 VANET의 상황을 고려하여 ant colony optimization 휴리스틱 알고리즘의 흔적을 이용하는 기법을 통해서 VANET 라우팅 프로토콜을 제안하고자 한다. 또한 이를 검증하기 위해 VANET의 시뮬레이션 방법에 대해서 알아보고 이를 통해서 제안한 라우팅 프로토콜이 패킷 전송률, 제어 패킷의 수의 메트릭에서 더 나은 성능임을 보인다.