Yayın:
Obtaining Brachistochrone Curve With Metaheuristic Algorithms

dc.contributor.authorGuckiran, Kivanc
dc.contributor.authorYildirim, Tulay
dc.date.accessioned2026-06-27T14:20:49Z
dc.date.issued2018
dc.description.abstractBrachistochrone 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.en
dc.identifier.endpage75
dc.identifier.isbn978-1-5386-7786-5
dc.identifier.startpage71
dc.identifier.urihttps://hdl.handle.net/20.500.14981/59527
dc.identifier.wos000455592800021
dc.language.isoeng
dc.publisherIEEE
dc.relation.conferenceInnovations in Intelligent Systems and Applications Conference (ASYU)
dc.relation.ispartof2018 INNOVATIONS IN INTELLIGENT SYSTEMS AND APPLICATIONS CONFERENCE (ASYU)
dc.subjectMetaheuristics
dc.subjectGenetic Algorithm
dc.subjectHarmony Search
dc.subjectArtificial Bee Colony
dc.subjectDifferential Evolution
dc.subjectSnell's Law
dc.subjectFermat's Principle
dc.subjectBrachistochrone Curve
dc.subjectGLOBAL OPTIMIZATION
dc.subjectComputer Science
dc.subjectEngineering
dc.titleObtaining Brachistochrone Curve With Metaheuristic Algorithms
dc.typeProceedings Paper
dspace.entity.typePublication
local.import.sourceWOS

Dosyalar

Koleksiyonlar