Obtaining Brachistochrone Curve With Metaheuristic Algorithms

被引:0
|
作者
Guckiran, Kivanc [1 ]
Yildirim, Tulay [1 ]
机构
[1] Yildiz Tech Univ, Dept Elect & Comm Engn, Istanbul, Turkey
关键词
Metaheuristics; Genetic Algorithm; Harmony Search; Artificial Bee Colony; Differential Evolution; Snell's Law; Fermat's Principle; Brachistochrone Curve; GLOBAL OPTIMIZATION;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Brachistochrone means "shortest time" in Ancient Greek. This curve defines the path a bead travels only with gravitational force between point A and a lower point B not directly under, in least amount of time. In this article, with the help of Snell's Law and the Fermat's principle, different metaheuristic algorithms are used to obtain Brachistochrone curve and compared with each other. Fermat's Principle states that wave chooses the shortest travel path when passing between different mediums. Snell's Law indicates the refraction angle of the wave on the surface of the media correlates to the intrinsic quality of the medium. As for metaheuristic algorithms, Genetic Algorithm (GA), Harmony Search (HS), Artificial Bee Colony (ABC) and Differential Evolution (DE) are used.
引用
收藏
页码:71 / 75
页数:5
相关论文
共 50 条
  • [21] Metaheuristic Algorithms Based Crop Classification
    Vishnu, Bhanawase Vishal
    Srinivas, Chalasani
    PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON COMMUNICATION AND ELECTRONICS SYSTEMS (ICCES 2018), 2018, : 1140 - 1144
  • [22] Metaheuristic Algorithms for Convolution Neural Network
    Rere, L. M. Rasdi
    Fanany, Mohamad Ivan
    Arymurthy, Aniati Murni
    COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE, 2016, 2016
  • [23] Quantile regression using metaheuristic algorithms
    Rahman, Mohammad Arshad
    INTERNATIONAL JOURNAL OF COMPUTATIONAL ECONOMICS AND ECONOMETRICS, 2013, 3 (3-4) : 205 - 233
  • [24] Metaheuristic algorithms for frequency assignment problems
    Gupta, DK
    2005 IEEE INTERNATIONAL CONFERENCE ON PERSONAL WIRELESS COMMUNICATIONS, 2005, : 456 - 459
  • [25] Metaheuristic Algorithms for Multiagent Routing Problems
    Germanchuk, M. S.
    Lemtyuzhnikova, D., V
    Lukianenko, V. A.
    AUTOMATION AND REMOTE CONTROL, 2021, 82 (10) : 1787 - 1801
  • [26] Metaheuristic Algorithms for the Quadratic Assignment Problem
    Tasgetiren, M. Fatih
    Pan, Quan-Ke
    Suganthan, P. N.
    Dizbay, Ikbal Ece
    PROCEEDINGS OF THE 2013 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN PRODUCTION AND LOGISTICS SYSTEMS (CIPLS), 2013, : 131 - 137
  • [27] The Mosaic of Metaheuristic Algorithms in Structural Optimization
    Nikos D. Lagaros
    Vagelis Plevris
    Nikos Ath. Kallioras
    Archives of Computational Methods in Engineering, 2022, 29 : 5457 - 5492
  • [28] Implementing metaheuristic optimization algorithms with JECoLi
    Evangelista, Pedro
    Maia, Paulo
    Rocha, Miguel
    2009 9TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS, 2009, : 505 - 510
  • [29] The Mosaic of Metaheuristic Algorithms in Structural Optimization
    Lagaros, Nikos D.
    Plevris, Vagelis
    Kallioras, Nikos Ath
    ARCHIVES OF COMPUTATIONAL METHODS IN ENGINEERING, 2022, 29 (07) : 5457 - 5492
  • [30] Metaheuristic algorithms for the strip packing problem
    Iori, M
    Martello, S
    Monaci, M
    OPTIMIZATION AND INDUSTRY: NEW FRONTIERS, 2003, 78 : 159 - 179