• Title/Summary/Keyword: multi-heuristic algorithm

Search Result 169, Processing Time 0.029 seconds

An Efficient Code Assignment Algorithm in Wireless Mesh Networks (무선 메쉬 네트워크에서의 효율적인 코드할당 알고리즘에 대한 연구)

  • Yeo, Jae-Hyun
    • Journal of Information Technology Applications and Management
    • /
    • v.15 no.1
    • /
    • pp.261-270
    • /
    • 2008
  • Wireless Mesh Networks (WMNs) have emerged as one of the new hot topics in wireless communications. WMNs have been suggested for use in situations in which some or all of the users are mobile or are located in inaccessible environments. Unconstrained transmission in a WMN may lead to the time overlap of two or more packet receptions, called collisions or interferences, resulting in damaged useless packets at the destination. There are two types of collisions; primary collision, due to the transmission of the stations which can hear each other, and hidden terminal collision, when stations outside the hearing range of each other transmit to the same receiving stations. For a WMN, direct collisions can be minimized by short propagation and carrier sense times. Thus, in this paper we only consider hidden terminal collision while neglecting direct collisions. To reduce or eliminate hidden terminal collision, code division multiple access (CDMA) protocols have been introduced. The collision-free property is guaranteed by the use of spread spectrum communication techniques and the proper assignment of orthogonal codes. Such codes share the fixed channel capacity allocated to the network in the design stage. Thus, it is very important to minimize the number of codes while achieving a proper transmission quality level in CDMA WMNs. In this paper, an efficient heuristic code assignment algorithm for eliminating hidden terminal collision in CDMA WMNs with general topology.

  • PDF

A Heuristic Approach for Grading Operation of Hydraulic Excavator Systems using SMISMO Valve Configuration (SMISMO 밸브 구조를 채용한 유압식 굴삭기의 평탄화 작업을 위한 휴리스틱 접근)

  • Joh, Joongseon;Hwang, Cheol Min
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.30 no.11
    • /
    • pp.1153-1160
    • /
    • 2013
  • SMISMO valve configuration is now starting to draw attention of the researchers of the construction equipment industry to increase the fuel efficiency of their equipment like excavators and wheel-loaders. An open-loop control strategy for grading operation of hydraulic excavator systems using SMISMO valve configuration is investigated in this paper. Tabor's algorithm for 1 d.o.f. SMISMO system under the assumption of quasi-static operation is revealed as not adequate for multi d.o.f. system with large moment of inertia even though the motion of the system is slow. New parameters are proposed in this paper. It modifies Tabor's open-loop control strategy for the grading operation of hydraulic excavators using SMISMO valve configuration. A simulation-based parameter tuning method is also proposed. It uses GA (Genetic Algorithm) to find the best parameter values. Simulation study for a practical hydraulic excavator shows the validity of the proposed open-loop control strategy.

A Development of Optimal Algorithms for N/M/D/F/Fmax Scheduling Problems (N/M/D/F/Fmax 일정계획 문제에서 최적 알고리듬의 개발)

  • 최성운
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.13 no.21
    • /
    • pp.91-100
    • /
    • 1990
  • This paper is concerned with the development of optimal algorithms for multi-stage flowshop scheduling problems with sequence dependent setup times. In the previous researches the setup time of a job is considered to be able to begin at the earliest opportunity given a particular sequence at the start of operations. In this paper the setup time of a job is considered to be able to begin only at the completion of that job on the previous machine to reflect the effects of the setup time to the performance measure of sequence dependent setup time flowshop scheduling. The results of the study consist of two areas; first, a general integer programming(IP) model is formulated and a nixed integer linear programming(MILP) model is also formulated by introducing a new binary variable. Second a depth-first branch and bound algorithm is developed. To reduce the computational burdens we use the best heuristic schedule developed by Choi(1989) as the first trial. The experiments for developed algorithm are designed for a 4$\times$3$\times$3 factorial design with 360 observations. The experimental factors are PS(ratio of processing time to setup time), M(number of machines), N(number of jobs).

  • PDF

Integrated production planning in supply chain management environment considering manufacturing partners (SCM 환경에서의 협력 생산을 고려한 통합 생산 계획에 관한 연구)

  • Jeong Ho Sang;Jeong Bong Ju
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.363-370
    • /
    • 2002
  • This paper presents a production planning algorithm for minimizing the costs of production and subcontracting in SCM (supply chain management) environment. In our SCM environment, the several local plants that aye dispersed geographically produce parts and products. In this environment, we have to decide the production volumes of both parts and products considering the BOM (bill-of-material) structure to meet the fixed order quantity or forecasted demand quantity. Each plant produces the specified parts of product with finite production capacity. There exist subcontracting decisions relevant to the production capacity of each plant except the core process plant, and when we use the subcontractor's capacities we should be charged for the fixed subcontracting fees. The objective of this study is to solve the production planning problem, which minimizes the total costs of production, inventory, setup, and subcontracting under constraints of production and subcontracting capacity. For this problem, an integrated production planning model based on the multi-level capacitated lot sizing problem was formulated, and efficient decomposition algorithm was proposed. The experimental investigation shows that the proposed heuristic generates quite good solutions at very low computational costs.

  • PDF

Low-Complexity Energy Efficient Base Station Cooperation Mechanism in LTE Networks

  • Yu, Peng;Feng, Lei;Li, Zifan;Li, Wenjing;Qiu, Xuesong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.3921-3944
    • /
    • 2015
  • Currently Energy-Saving (ES) methods in cellular networks could be improved, as compensation method for irregular Base Station (BS) deployment is not effective, most regional ES algorithm is complex, and performance decline caused by ES action is not evaluated well. To resolve above issues, a low-complexity energy efficient BS cooperation mechanism for Long Time Evolution (LTE) networks is proposed. The mechanism firstly models the ES optimization problem with coverage, resource, power and Quality of Service (QoS) constraints. To resolve the problem with low complexity, it is decomposed into two sub-problems: BS Mode Determination (BMD) problem and User Association Optimization (UAO) problem. To resolve BMD, regional dynamic multi-stage algorithms with BS cooperation pair taking account of load and geographic topology is analyzed. And then a distributed heuristic algorithm guaranteeing user QoS is adopted to resolve UAO. The mechanism is simulated under four LTE scenarios. Comparing to other algorithms, results show that the mechanism can obtain better energy efficiency with acceptable coverage, throughput, and QoS performance.

A TSK fuzzy model optimization with meta-heuristic algorithms for seismic response prediction of nonlinear steel moment-resisting frames

  • Ebrahim Asadi;Reza Goli Ejlali;Seyyed Arash Mousavi Ghasemi;Siamak Talatahari
    • Structural Engineering and Mechanics
    • /
    • v.90 no.2
    • /
    • pp.189-208
    • /
    • 2024
  • Artificial intelligence is one of the efficient methods that can be developed to simulate nonlinear behavior and predict the response of building structures. In this regard, an adaptive method based on optimization algorithms is used to train the TSK model of the fuzzy inference system to estimate the seismic behavior of building structures based on analytical data. The optimization algorithm is implemented to determine the parameters of the TSK model based on the minimization of prediction error for the training data set. The adaptive training is designed on the feedback of the results of previous time steps, in which three training cases of 2, 5, and 10 previous time steps were used. The training data is collected from the results of nonlinear time history analysis under 100 ground motion records with different seismic properties. Also, 10 records were used to test the inference system. The performance of the proposed inference system is evaluated on two 3 and 20-story models of nonlinear steel moment frame. The results show that the inference system of the TSK model by combining the optimization method is an efficient computational method for predicting the response of nonlinear structures. Meanwhile, the multi-vers optimization (MVO) algorithm is more accurate in determining the optimal parameters of the TSK model. Also, the accuracy of the results increases significantly with increasing the number of previous steps.

Real-Time Vehicle License Plate Recognition System Using Adaptive Heuristic Segmentation Algorithm (적응 휴리스틱 분할 알고리즘을 이용한 실시간 차량 번호판 인식 시스템)

  • Jin, Moon Yong;Park, Jong Bin;Lee, Dong Suk;Park, Dong Sun
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.3 no.9
    • /
    • pp.361-368
    • /
    • 2014
  • The LPR(License plate recognition) system has been developed to efficient control for complex traffic environment and currently be used in many places. However, because of light, noise, background changes, environmental changes, damaged plate, it only works limited environment, so it is difficult to use in real-time. This paper presents a heuristic segmentation algorithm for robust to noise and illumination changes and introduce a real-time license plate recognition system using it. In first step, We detect the plate utilized Haar-like feature and Adaboost. This method is possible to rapid detection used integral image and cascade structure. Second step, we determine the type of license plate with adaptive histogram equalization, bilateral filtering for denoise and segment accurate character based on adaptive threshold, pixel projection and associated with the prior knowledge. The last step is character recognition that used histogram of oriented gradients (HOG) and multi-layer perceptron(MLP) for number recognition and support vector machine(SVM) for number and Korean character classifier respectively. The experimental results show license plate detection rate of 94.29%, license plate false alarm rate of 2.94%. In character segmentation method, character hit rate is 97.23% and character false alarm rate is 1.37%. And in character recognition, the average character recognition rate is 98.38%. Total average running time in our proposed method is 140ms. It is possible to be real-time system with efficiency and robustness.

Optimal Design of a Hybrid Structural Control System using a Self-Adaptive Harmony Search Algorithm (자가적응 화음탐색 알고리즘을 이용한 복합형 최적 구조제어 시스템 설계)

  • Park, Wonsuk
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.31 no.6
    • /
    • pp.301-308
    • /
    • 2018
  • This paper presents an optimal design method of a hybrid structural control system considering multi-hazard. Unlike a typical structural control system in which one system is designed for one specific type of hazard, a simultaneous optimal design method for both active and passive control systems is proposed for the mitigation of seismic and wind induced vibration responses of structures. As a numerical example, an optimal design problem is illustrated for a hybrid mass damper(HMD) and 30 viscous dampers which are installed on a 30 story building structure. In order to solve the optimization problem, a self-adaptive Harmony Search(HS) algorithm is adopted. Harmony Search algorithm is one of the meta-heuristic evolutionary methods for the global optimization, which mimics the human player's tuning process of musical instruments. A self-adaptive, dynamic parameter adjustment algorithm is also utilized for the purpose of broad search and fast convergence. The optimization results shows that the performance and effectiveness of the proposed system is superior with respect to a reference hybrid system in which the active and passive systems are independently optimized.

Match Field based Algorithm Selection Approach in Hybrid SDN and PCE Based Optical Networks

  • Selvaraj, P.;Nagarajan, V.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.5723-5743
    • /
    • 2018
  • The evolving internet-based services demand high-speed data transmission in conjunction with scalability. The next generation optical network has to exploit artificial intelligence and cognitive techniques to cope with the emerging requirements. This work proposes a novel way to solve the dynamic provisioning problem in optical network. The provisioning in optical network involves the computation of routes and the reservation of wavelenghs (Routing and Wavelength assignment-RWA). This is an extensively studied multi-objective optimization problem and its complexity is known to be NP-Complete. As the exact algorithms incurs more running time, the heuristic based approaches have been widely preferred to solve this problem. Recently the software-defined networking has impacted the way the optical pipes are configured and monitored. This work proposes the dynamic selection of path computation algorithms in response to the changing service requirements and network scenarios. A software-defined controller mechanism with a novel packet matching feature was proposed to dynamically match the traffic demands with the appropriate algorithm. A software-defined controller with Path Computation Element-PCE was created in the ONOS tool. A simulation study was performed with the case study of dynamic path establishment in ONOS-Open Network Operating System based software defined controller environment. A java based NOX controller was configured with a parent path computation element. The child path computation elements were configured with different path computation algorithms under the control of the parent path computation element. The use case of dynamic bulk path creation was considered. The algorithm selection method is compared with the existing single algorithm based method and the results are analyzed.

A Fair Scheduling of Heterogeneous Multi-Server Systems by Cumulative Extra Capacity Sharing (누적적 잉여용량 공유를 통한 이질적 다중 서버 시스템의 공정 스케줄링)

  • Park, Kyeong-Ho;Hwang, Ho-Young
    • The KIPS Transactions:PartA
    • /
    • v.14A no.7
    • /
    • pp.451-456
    • /
    • 2007
  • In this paper, we regard computer systems as heterogeneous multi-server systems and propose a cumulative fair scheduling scheme that pursues long-term fairness. GPS(generalized processor sharing)-based scheduling algorithms, which are usually employed in single-server systems, distribute available capacity in an instantaneous manner. However, applying them to heterogeneous multi-server systems may cause unfairness, since they may not prevent the accumulation of scheduling delays and the extra capacities are distributed in an instantaneous manner. In our scheme, long-term fairness is pursued by proper distribution of extra capacities while guaranteeing reserved capacities. A reference capacity model to determine the ideal progresses of applications is derived from long-term observations, and the scheduler makes the applications gradually follow the ideal progresses while guaranteeing their reserved capacities. A heuristic scheduling algorithm is proposed and the scheme is examined by simulation.