• Title/Summary/Keyword: Multi-objective Optimization Problem

Search Result 306, Processing Time 0.025 seconds

Routing optimization algorithm for logistics virtual monitoring based on VNF dynamic deployment

  • Qiao, Qiujuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.5
    • /
    • pp.1708-1734
    • /
    • 2022
  • In the development of logistics system, the breakthrough of important technologies such as technology platform for logistics information management and control is the key content of the study. Based on Javascript and JQuery, the logistics system realizes real-time monitoring, collection of historical status data, statistical analysis and display, intelligent recommendation and other functions. In order to strengthen the cooperation of warehouse storage, enhance the utilization rate of resources, and achieve the purpose of real-time and visual supervision of transportation equipment and cargo tracking, this paper studies the VNF dynamic deployment and SFC routing problem in the network load change scenario based on the logistics system. The BIP model is used to model the VNF dynamic deployment and routing problem. The optimization objective is to minimize the total cost overhead generated by each SFCR. Furthermore, the application of the SFC mapping algorithm in the routing topology solving problem is proposed. Based on the concept of relative cost and the idea of topology transformation, the SFC-map algorithm can efficiently complete the dynamic deployment of VNF and the routing calculation of SFC by using multi-layer graph. In the simulation platform based on the logistics system, the proposed algorithm is compared with VNF-DRA algorithm and Provision Traffic algorithm in the network receiving rate, throughput, path end-to-end delay, deployment number, running time and utilization rate. According to the test results, it is verified that the test results of the optimization algorithm in this paper are obviously improved compared with the comparison method, and it has higher practical application and promotion value.

Genetic Algorithm based hyperparameter tuned CNN for identifying IoT intrusions

  • Alexander. R;Pradeep Mohan Kumar. K
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.3
    • /
    • pp.755-778
    • /
    • 2024
  • In recent years, the number of devices being connected to the internet has grown enormously, as has the intrusive behavior in the network. Thus, it is important for intrusion detection systems to report all intrusive behavior. Using deep learning and machine learning algorithms, intrusion detection systems are able to perform well in identifying attacks. However, the concern with these deep learning algorithms is their inability to identify a suitable network based on traffic volume, which requires manual changing of hyperparameters, which consumes a lot of time and effort. So, to address this, this paper offers a solution using the extended compact genetic algorithm for the automatic tuning of the hyperparameters. The novelty in this work comes in the form of modeling the problem of identifying attacks as a multi-objective optimization problem and the usage of linkage learning for solving the optimization problem. The solution is obtained using the feature map-based Convolutional Neural Network that gets encoded into genes, and using the extended compact genetic algorithm the model is optimized for the detection accuracy and latency. The CIC-IDS-2017 and 2018 datasets are used to verify the hypothesis, and the most recent analysis yielded a substantial F1 score of 99.23%. Response time, CPU, and memory consumption evaluations are done to demonstrate the suitability of this model in a fog environment.

Integrated Optimal Design of Smart Connective Control System and Connected Buildings (스마트 연결 제어 시스템과 연결 구조물의 통합 최적 설계)

  • Kim, Hyun-Su;Kang, Joo-Won
    • Journal of Korean Association for Spatial Structures
    • /
    • v.19 no.2
    • /
    • pp.43-50
    • /
    • 2019
  • A smart connective control system was invented recently for coupling control of adjacent buildings. Previous studies on this topic focused on development of control algorithm for the smart connective control system and design method of control device. Usually, a smart control devices are applied to building structures after structural design. However, because structural characteristics of building structure with control devices changes, a iterative design is required for optimal design. To defeat this problem, an integrated optimal design method for a smart connective control system and connected buildings was proposed. For this purpose, an artificial seismic load was generated for control performance evaluation of the smart coupling control system. 20-story and 12-story adjacent buildings were used as example structures and an MR (magnetorheological) damper was used as a smart control device to connect adjacent two buildings. NSGA-II was used for multi-objective integrated optimization of structure-smart control device. Numerical simulation results show the integrated optimal design method proposed in this study can provide various optimal designs for smart connective control system and connected buildings presenting good control performance.

A Study on the Optimal Preform Shape Design using FEM and Genetic Algorithm in Hot Forging (열간단조에서 유한요소법과 유전 알고리즘을 이용한 예비성형체의 최적형상 설계 연구)

  • Yeom, Sung-Ho;Lee, Jeong-Ho;Woo, Ho-Kil
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.16 no.4
    • /
    • pp.29-35
    • /
    • 2007
  • The main objective of this paper is to propose the optimal design method of forging process using genetic algorithm. Design optimization of forging process was doing about one stage and multi stage. The objective function is considered the filling of die. The chosen design variables are die geometry in multi stage and initial billet shape in one stage. We performed FE analysis to simulated forging process. The optimized preform and initial billet shape was obtained by genetic algorithm and FE analysis. To show the efficiency of GA method in forging problem are solved and compared with published results.

Task Scheduling and Resource Management Strategy for Edge Cloud Computing Using Improved Genetic Algorithm

  • Xiuye Yin;Liyong Chen
    • Journal of Information Processing Systems
    • /
    • v.19 no.4
    • /
    • pp.450-464
    • /
    • 2023
  • To address the problems of large system overhead and low timeliness when dealing with task scheduling in mobile edge cloud computing, a task scheduling and resource management strategy for edge cloud computing based on an improved genetic algorithm was proposed. First, a user task scheduling system model based on edge cloud computing was constructed using the Shannon theorem, including calculation, communication, and network models. In addition, a multi-objective optimization model, including delay and energy consumption, was constructed to minimize the sum of two weights. Finally, the selection, crossover, and mutation operations of the genetic algorithm were improved using the best reservation selection algorithm and normal distribution crossover operator. Furthermore, an improved legacy algorithm was selected to deal with the multi-objective problem and acquire the optimal solution, that is, the best computing task scheduling scheme. The experimental analysis of the proposed strategy based on the MATLAB simulation platform shows that its energy loss does not exceed 50 J, and the time delay is 23.2 ms, which are better than those of other comparison strategies.

Budget Estimation Problem for Capacity Enhancement based on Various Performance Criteria (다중 평가지표에 기반한 도로용량 증대 소요예산 추정)

  • Kim, Ju-Young;Lee, Sang-Min;Cho, Chong-Suk
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.5
    • /
    • pp.175-184
    • /
    • 2008
  • Uncertainties are unavoidable in engineering applications. In this paper we propose an alpha reliable multi-variable network design problem under demand uncertainty. In order to decide the optimal capacity enhancement, three performance measures based on 3E(Efficiency, Equity, and Environmental) are considered. The objective is to minimize the total budget required to satisfy alpha reliability constraint of total travel time, equity ratio, and total emission, while considering the route choice behavior of network users. The problem is formulated as the chance-constrained model for application of alpha confidence level and solved as a lexicographic optimization problem to consider the multi-variable. A simulation-based genetic algorithm procedure is developed to solve this complex network design problem(NDP). A simple numerical example ispresented to illustrate the features of the proposed NDP model.

Systematic probabilistic design methodology for simultaneously optimizing the ship hull-propeller system

  • Esmailian, Ehsan;Ghassemi, Hassan;Zakerdoost, Hassan
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.9 no.3
    • /
    • pp.246-255
    • /
    • 2017
  • The proposed design methodology represents a new approach to optimize the propeller-hull system simultaneously. In this paper, two objective functions are considered, the first objective function is Lifetime Fuel Consumption (LFC) and the other one is cost function including thrust, torque, open water and skew efficiencies. The variables of the propeller geometries (Z, EAR, P/D and D) and ship hull parameters (L/B, B/T, T and $C_B$) are considered to be optimized with cavitation, blades stress of propeller. The well-known evolutionary algorithm based on NSGA-II is employed to optimize a multi-objective problem, where the main propeller and hull dimensions are considered as design variables. The results are presented for a series 60 ship with B-series propeller. The results showed that the proposed method is an appropriate and effective approach for simultaneously propeller-hull system design and is able to minimize both of the objective functions significantly.

Multi-objective Optimal Design for the Low Drag Tail Shape of the MIRA model with the Lift Effect taken into account (양력 효과를 고려한 MIRA model 후미의 저저항 다목적 최적설계)

  • Lee Juhee;Lee Kyunghuhn;Kim Joonbae
    • Proceedings of the KSME Conference
    • /
    • 2002.08a
    • /
    • pp.565-568
    • /
    • 2002
  • In the flow analysis around a bluffbody such as road vehicles, drag reduction has been of the primary concern mainly due to the effect on fuel economy. To reduce the drag, which is mostly due to the pressure difference caused by the flow separation, the location of the separation and eddy sizes are controlled. However, less attention has been given to the effect of the lift. The effect of lift may cause the driving stability problem of the vehicle at high speed white heavy downward effect of lift together with the vehicle weight may require more power to drive the vehicle forward. It is considered worthwhile to pursue the optimal design of the low drag tail shape of the MIRA model while taking the lift effect into account, even though it is considered as a reference. To this end, a commercial multi-objective optimization code, FRONTIER, Is used together with the CFD code, STAR-CD. It is hoped that the results will provide more insight into the flow field around the bluffbody as transportation means.

  • PDF

Small Base Station Association and Cooperative Receiver Design for HetNets via Distributed SOCP

  • Lu, Li;Wang, Desheng;Zhao, Hongyi;Liu, Yingzhuang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.12
    • /
    • pp.5212-5230
    • /
    • 2016
  • How to determine the right number of small base stations to activate in multi-cell uplinks to match traffic from a fixed quantity of K users is an open question. This paper analyses the uplink cooperative that jointly receives base stations activation to explore this question. This paper is different from existing works only consider transmitting power as optimization objective function. The global objective function is formulated as a summation of two terms: transmitting power for data and coordinated overhead for control. Then, the joint base stations activation and beamforming problem is formulated as a mixed integer second order cone optimization. To solve this problem, we develop two polynomial-time distributed methods. Method one is a two-stage solution which activates no more than K small base stations (SBSs). Method two is a heuristic algorithm by dual decomposition to MI-SOCP that activates more SBSs to obtain multiple-antennae diversity gains. Thanks to the parallel computation for each node, our methods are more computationally efficient. The strengths and weaknesses of these two proposed two algorithms are also compared using numerical results.

Hybrid genetic-paired-permutation algorithm for improved VLSI placement

  • Ignatyev, Vladimir V.;Kovalev, Andrey V.;Spiridonov, Oleg B.;Kureychik, Viktor M.;Ignatyeva, Alexandra S.;Safronenkova, Irina B.
    • ETRI Journal
    • /
    • v.43 no.2
    • /
    • pp.260-271
    • /
    • 2021
  • This paper addresses Very large-scale integration (VLSI) placement optimization, which is important because of the rapid development of VLSI design technologies. The goal of this study is to develop a hybrid algorithm for VLSI placement. The proposed algorithm includes a sequential combination of a genetic algorithm and an evolutionary algorithm. It is commonly known that local search algorithms, such as random forest, hill climbing, and variable neighborhoods, can be effectively applied to NP-hard problem-solving. They provide improved solutions, which are obtained after a global search. The scientific novelty of this research is based on the development of systems, principles, and methods for creating a hybrid (combined) placement algorithm. The principal difference in the proposed algorithm is that it obtains a set of alternative solutions in parallel and then selects the best one. Nonstandard genetic operators, based on problem knowledge, are used in the proposed algorithm. An investigational study shows an objective-function improvement of 13%. The time complexity of the hybrid placement algorithm is O(N2).