• Title/Summary/Keyword: Optimization algorithms

Search Result 1,701, Processing Time 0.032 seconds

Development of a n-path algorithm for providing travel information in general road network (일반가로망에서 교통정보제공을 위한 n-path 알고리듬의 개발)

  • Lim, Yong-Taek
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.4 s.75
    • /
    • pp.135-146
    • /
    • 2004
  • For improving the effectiveness of travel information, some rational paths are needed to provide them to users driving in real road network. To meet it, k-shortest path algorithms have been used in general. Although the k-shortest path algorithm can provide several alternative paths, it has inherent limit of heavy overlapping among derived paths, which nay lead to incorrect travel information to the users. In case of considering the network consisting of several turn prohibitions popularly adopted in real world network, it makes difficult for the traditional network optimization technique to deal with. Banned and penalized turns are not described appropriately for in the standard node/link method of network definition with intersections represented by nodes only. Such problem could be solved by expansion technique adding extra links and nodes to the network for describing turn penalties, but this method could not apply to large networks as well as dynamic case due to its overwhelming additional works. This paper proposes a link-based shortest path algorithm for the travel information in real road network where exists turn prohibitions. It enables to provide efficient alternative paths under consideration of overlaps among paths. The algorithm builds each path based on the degree of overlapping between each path and stops building new path when the degree of overlapping ratio exceeds its criterion. Because proposed algorithm builds the shortest path based on the link-end cost instead or node cost and constructs path between origin and destination by link connection, the network expansion does not require. Thus it is possible to save the time or network modification and of computer running. Some numerical examples are used for test of the model proposed in the paper.

Computational estimation of the earthquake response for fibre reinforced concrete rectangular columns

  • Liu, Chanjuan;Wu, Xinling;Wakil, Karzan;Jermsittiparsert, Kittisak;Ho, Lanh Si;Alabduljabbar, Hisham;Alaskar, Abdulaziz;Alrshoudi, Fahed;Alyousef, Rayed;Mohamed, Abdeliazim Mustafa
    • Steel and Composite Structures
    • /
    • v.34 no.5
    • /
    • pp.743-767
    • /
    • 2020
  • Due to the impressive flexural performance, enhanced compressive strength and more constrained crack propagation, Fibre-reinforced concrete (FRC) have been widely employed in the construction application. Majority of experimental studies have focused on the seismic behavior of FRC columns. Based on the valid experimental data obtained from the previous studies, the current study has evaluated the seismic response and compressive strength of FRC rectangular columns while following hybrid metaheuristic techniques. Due to the non-linearity of seismic data, Adaptive neuro-fuzzy inference system (ANFIS) has been incorporated with metaheuristic algorithms. 317 different datasets from FRC column tests has been applied as one database in order to determine the most influential factor on the ultimate strengths of FRC rectangular columns subjected to the simulated seismic loading. ANFIS has been used with the incorporation of Particle Swarm Optimization (PSO) and Genetic algorithm (GA). For the analysis of the attained results, Extreme learning machine (ELM) as an authentic prediction method has been concurrently used. The variable selection procedure is to choose the most dominant parameters affecting the ultimate strengths of FRC rectangular columns subjected to simulated seismic loading. Accordingly, the results have shown that ANFIS-PSO has successfully predicted the seismic lateral load with R2 = 0.857 and 0.902 for the test and train phase, respectively, nominated as the lateral load prediction estimator. On the other hand, in case of compressive strength prediction, ELM is to predict the compressive strength with R2 = 0.657 and 0.862 for test and train phase, respectively. The results have shown that the seismic lateral force trend is more predictable than the compressive strength of FRC rectangular columns, in which the best results belong to the lateral force prediction. Compressive strength prediction has illustrated a significant deviation above 40 Mpa which could be related to the considerable non-linearity and possible empirical shortcomings. Finally, employing ANFIS-GA and ANFIS-PSO techniques to evaluate the seismic response of FRC are a promising reliable approach to be replaced for high cost and time-consuming experimental tests.

A Performance Analysis by Adjusting Learning Methods in Stock Price Prediction Model Using LSTM (LSTM을 이용한 주가예측 모델의 학습방법에 따른 성능분석)

  • Jung, Jongjin;Kim, Jiyeon
    • Journal of Digital Convergence
    • /
    • v.18 no.11
    • /
    • pp.259-266
    • /
    • 2020
  • Many developments have been steadily carried out by researchers with applying knowledge-based expert system or machine learning algorithms to the financial field. In particular, it is now common to perform knowledge based system trading in using stock prices. Recently, deep learning technologies have been applied to real fields of stock trading marketplace as GPU performance and large scaled data have been supported enough. Especially, LSTM has been tried to apply to stock price prediction because of its compatibility for time series data. In this paper, we implement stock price prediction using LSTM. In modeling of LSTM, we propose a fitness combination of model parameters and activation functions for best performance. Specifically, we propose suitable selection methods of initializers of weights and bias, regularizers to avoid over-fitting, activation functions and optimization methods. We also compare model performances according to the different selections of the above important modeling considering factors on the real-world stock price data of global major companies. Finally, our experimental work brings a fitness method of applying LSTM model to stock price prediction.

Performance Analysis of the IEEE 802.11 Broadcast Scheme in a Wireless Data Network (무선 데이터 망에서 IEEE 802.11 브로드캐스트 기법의 성능 분석)

  • Park, Jae-Sung;Lim, Yu-Jin;Ahn, Sang-Hyun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.5
    • /
    • pp.56-63
    • /
    • 2009
  • The IEEE 802.11 standard has been used for wireless data networks such as wireless LAN, ad-hoc network, and vehicular ad-hoc network. Thus, the performance analysis of the IEEE 802.11 specification has been one of the hottest issues for network optimization and resource management. Most of the analysis studies were performed in a data plane of the IEEE 802.11 unicast. However, IEEE 802.11 broadcast is widely used for topology management, path management, and data dissemination. Thus, it is important to understand the performance of the broadcast scheme for the design of efficient wireless data network. In this contort, we analyze the IEEE 802.11 broadcast scheme in terms of the broadcast frame reception probability according to the distance from a sending node. Unlike the other works, our analysis framework includes not only the system parameters of the IEEE 802.11 specification such as transmission range, data rate, minimum contention window but also the networking environments such as the number of nodes, network load, and the radio propagation environments. Therefore, our analysis framework is expected to be used for the development of protocols and algorithms in a dynamic wireless data network.

A Novel Compressed Sensing Technique for Traffic Matrix Estimation of Software Defined Cloud Networks

  • Qazi, Sameer;Atif, Syed Muhammad;Kadri, Muhammad Bilal
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.10
    • /
    • pp.4678-4702
    • /
    • 2018
  • Traffic Matrix estimation has always caught attention from researchers for better network management and future planning. With the advent of high traffic loads due to Cloud Computing platforms and Software Defined Networking based tunable routing and traffic management algorithms on the Internet, it is more necessary as ever to be able to predict current and future traffic volumes on the network. For large networks such origin-destination traffic prediction problem takes the form of a large under- constrained and under-determined system of equations with a dynamic measurement matrix. Previously, the researchers had relied on the assumption that the measurement (routing) matrix is stationary due to which the schemes are not suitable for modern software defined networks. In this work, we present our Compressed Sensing with Dynamic Model Estimation (CS-DME) architecture suitable for modern software defined networks. Our main contributions are: (1) we formulate an approach in which measurement matrix in the compressed sensing scheme can be accurately and dynamically estimated through a reformulation of the problem based on traffic demands. (2) We show that the problem formulation using a dynamic measurement matrix based on instantaneous traffic demands may be used instead of a stationary binary routing matrix which is more suitable to modern Software Defined Networks that are constantly evolving in terms of routing by inspection of its Eigen Spectrum using two real world datasets. (3) We also show that linking this compressed measurement matrix dynamically with the measured parameters can lead to acceptable estimation of Origin Destination (OD) Traffic flows with marginally poor results with other state-of-art schemes relying on fixed measurement matrices. (4) Furthermore, using this compressed reformulated problem, a new strategy for selection of vantage points for most efficient traffic matrix estimation is also presented through a secondary compression technique based on subset of link measurements. Experimental evaluation of proposed technique using real world datasets Abilene and GEANT shows that the technique is practical to be used in modern software defined networks. Further, the performance of the scheme is compared with recent state of the art techniques proposed in research literature.

Study on the Collision Avoidance Algorithm against Multiple Traffic Ships using Changeable Action Space Searching Method (가변공간 탐색법을 이용한 다중선박의 충돌회피 알고리즘에 관한 연구)

  • Son, N.S.;Furukawa, Y.;Kim, S.Y.;Kijima, K.
    • Journal of the Korean Society for Marine Environment & Energy
    • /
    • v.12 no.1
    • /
    • pp.15-22
    • /
    • 2009
  • Auto-navigation algorithm have been studied to avoid collision and grounding of a ship due to human error. There have been many research on collision avoidance algorithms but they have been validated little on the real coastal traffic situation. In this study, a Collision Avoidance algorithm is developed by using Fuzzy algorithm and the concept of Changeable Action Space Searching (CAS). In the first step, on a basis of collision risk calculated from fuzzy algorithm in the current time(t=to), alternative Action Space for collision avoidance is planned. In the second step, next alternative Action Space for collision avoidance in the future($t=to+{\Delta}t$) is corrected and re-planned with re-evaluated collision risk. In the third step, the safest and most effective course among Action Space is selected by using optimization method in real time. In this paper, the main features of the developed collision avoidance algorithm (CAS) are introduced. CAS is implemented in the ship-handling simulator of MOERI. The performance of CAS is tested on the situation of open sea with 3 traffic ships, whose position is assumed to be informed from AIS. Own-ship is fully autonomously navigated by autopilot including the collision avoidance algorithm, CAS. Experimental results show that own-ship can successfully avoid the collision against traffic ships and the calculated courses from CAS are reasonable.

  • PDF

OPTIMAL TRAJECTORY CORRECTION MANEUVER DESIGN USING THE B-PLANE TARGETING METHOD FOR FUTURE KOREAN MARS MISSIONS (B-평면 조준법을 이용한 화성 탐사선의 궤적 보정을 위한 최적의 기동 설계)

  • Song, Young-Joo;Park, Eun-Seo;Yoo, Sung-Moon;Park, Sang-Young;Choi, Kyu-Hong;Yoon, Jae-Cheol;Yim, Jo-Ryeong;Choi, Joon-Min;Kim, Byung-Kyo
    • Journal of Astronomy and Space Sciences
    • /
    • v.22 no.4
    • /
    • pp.451-462
    • /
    • 2005
  • Optimal Trajectory Correction Maneuver (TCM) design algorithm has been developed using the B-plane targeting method for future Korean Mars missions. For every-mission phase, trajectory informations can also be obtained using this developed algorithms which are essential to design optimal TCM strategy. The information were computed under minimum requiring perturbations to design Mars missions. Spacecraft can not be reached at designed aim point because of unexpected trajectory errors, caused by many perturbations and errors due to operating impulsive maneuvers during the cruising phase of missions. To maintain spacecraft's appropriate trajectory and deliver it to the designed aim point, B-plane targeting techniques are needed. A software NPSOL is used to solve this optimization problem, with the performance index of minimizing total amount of TCM's magnitude. And also executing time of maneuvers on be controlled for the user defined maneuver number $(1\~5)$ of TCMs. The constraints, the Mars arrival B-plane boundary conditions, are formulated for the problem. Results of this work show the ability to design and analyze overall Mars missions, from the Earth launch phase to Mars arrival phase including capture orbit status for future Korean Mars missions

Fuzzy Control of Smart Base Isolation System using Genetic Algorithm (유전자알고리즘을 이용한 스마트 면진시스템의 퍼지제어)

  • Kim, Hyun-Su;Roschke, P.N.
    • Journal of the Earthquake Engineering Society of Korea
    • /
    • v.9 no.2 s.42
    • /
    • pp.37-46
    • /
    • 2005
  • To date, many viable smart base isolation systems have been proposed and investigated. In this study, a novel friction pendulum system (FPS) and an MR damper are employed as the isolator and supplemental damping device, respectively, of the smart base isolation system. A fuzzy logic controller (FLC) is used to modulate the MR damper because the FLC has an inherent robustness and ability to handle non linearities and uncertainties. A genetic algorithm (GA) is used for optimization of the FLC. The main purpose of employing a GA is to determine appropriate fuzzy control rules as well to adjust parameters of the membership functions. To this end, a GA with a local improvement mechanism is applied. This method is efficient in improving local portions of chromosomes. Neuro fuzzy models are used to represent dynamic behavior of the MR damper and FPS. Effectiveness of the proposed method for optimal design of the FLC is judged based on computed responses to several historical earthquakes. It has been shown that the proposed method can find optimal fuzzy rules and the GA optimized FLC outperforms not only a passive control strategy but also a human designed FLC and a conventional semi active control algorithm.

Evolution of Neural Network's Structure and Learn Patterns Based on Competitive Co-Evolutionary Method (경쟁적 공진화법에 의한 신경망의 구조와 학습패턴의 진화)

  • Joung, Chi-Sun;Lee, Dong-Wook;Jun, Hyo-Byung;Sim, Kwee-Bo
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.1
    • /
    • pp.29-37
    • /
    • 1999
  • In general, the information processing capability of a neural network is determined by its architecture and efficient training patterns. However, there is no systematic method for designing neural network and selecting effective training patterns. Evolutionary Algorithms(EAs) are referred to as the methods of population-based optimization. Therefore, EAs are considered as very efficient methods of optimal system design because they can provide much opportunity for obtaining the global optimal solution. In this paper, we propose a new method for finding the optimal structure of neural networks based on competitive co-evolution, which has two different populations. Each population is called the primary population and the secondary population respectively. The former is composed of the architecture of neural network and the latter is composed of training patterns. These two populations co-evolve competitively each other, that is, the training patterns will evolve to become more difficult for learning of neural networks and the architecture of neural networks will evolve to learn this patterns. This method prevents the system from the limitation of the performance by random design of neural networks and inadequate selection of training patterns. In co-evolutionary method, it is difficult to monitor the progress of co-evolution because the fitness of individuals varies dynamically. So, we also introduce the measurement method. The validity and effectiveness of the proposed method are inspected by applying it to the visual servoing of robot manipulators.

  • PDF

Computational Optimization of Bioanalytical Parameters for the Evaluation of the Toxicity of the Phytomarker 1,4 Napthoquinone and its Metabolite 1,2,4-trihydroxynapththalene

  • Gopal, Velmani;AL Rashid, Mohammad Harun;Majumder, Sayani;Maiti, Partha Pratim;Mandal, Subhash C
    • Journal of Pharmacopuncture
    • /
    • v.18 no.2
    • /
    • pp.7-18
    • /
    • 2015
  • Objectives: Lawsone (1,4 naphthoquinone) is a non redox cycling compound that can be catalyzed by DT diaphorase (DTD) into 1,2,4-trihydroxynaphthalene (THN), which can generate reactive oxygen species by auto oxidation. The purpose of this study was to evaluate the toxicity of the phytomarker 1,4 naphthoquinone and its metabolite THN by using the molecular docking program AutoDock 4. Methods: The 3D structure of ligands such as hydrogen peroxide ($H_2O_2$), nitric oxide synthase (NOS), catalase (CAT), glutathione (GSH), glutathione reductase (GR), glucose 6-phosphate dehydrogenase (G6PDH) and nicotinamide adenine dinucleotide phosphate hydrogen (NADPH) were drawn using hyperchem drawing tools and minimizing the energy of all pdb files with the help of hyperchem by $MM^+$ followed by a semi-empirical (PM3) method. The docking process was studied with ligand molecules to identify suitable dockings at protein binding sites through annealing and genetic simulation algorithms. The program auto dock tools (ADT) was released as an extension suite to the python molecular viewer used to prepare proteins and ligands. Grids centered on active sites were obtained with spacings of $54{\times}55{\times}56$, and a grid spacing of 0.503 was calculated. Comparisons of Global and Local Search Methods in Drug Docking were adopted to determine parameters; a maximum number of 250,000 energy evaluations, a maximum number of generations of 27,000, and mutation and crossover rates of 0.02 and 0.8 were used. The number of docking runs was set to 10. Results: Lawsone and THN can be considered to efficiently bind with NOS, CAT, GSH, GR, G6PDH and NADPH, which has been confirmed through hydrogen bond affinity with the respective amino acids. Conclusion: Naphthoquinone derivatives of lawsone, which can be metabolized into THN by a catalyst DTD, were examined. Lawsone and THN were found to be identically potent molecules for their affinities for selected proteins.