Наредни састанак Семинара биће одржан у петак, 23. јуна 2023, у сали 301ф Матматичког института САНУ са почетком у 14.15.
Предавач: Татјана Давидовић, Математички институт САНУ
Наслов предавања: PATH RELINKING – A VERY USEFUL OPTIMIZATION TOOL
Апстракт: In the optimization field it is necessary to find at least one extreme value of the objective function, as well as the corresponding set of arguments. Especially interesting and extremely hard are problems with the discrete domain, like Traveling Salesman Problem (TSP), Vehicle Routing Problem (VRP), Scheduling, Clustering, etc., that appear in the everyday life. As it is impossible to find the optimal solutions, various heuristic methods are developed to obtain high-quality sub-optimal solutions. One of these methods is Path Relinking (PR), that is classified as an evolutionary heuristic although it is deterministic and explores mathematical principles more than natural evolution. The main idea of PR is to build a path between two solutions, by performing successive modifications that transform one solution into the other. All intermediate solutions are evaluated and the best among them is adopted for further exploration. The number of intermediate solutions is determined by the distance between the initial solutions, indicating that PR needs a properly defined metric. More often than a standalone method, PR is used as an auxiliary step in other ptimization methods, metaheuristics in particular. After a brief review of PR and recent applications within various metaheuristics, our experience with using PR within discrete Symbiotic Organisms Search (SOS) for TSP will be presented.
This is a joint work with Vladimir Ilin, Raka Jovanović, and Dragan Simić.
Напомена: Предавања се могу пратити на даљину преко линка:
https://miteam.mi.sanu.ac.rs/call/T9XDGChhq8aDcNqmz/qw7wIwci2jv2rdg9I9CrXkm7OJhF_LB8DfjXZp4jTFV
Регистрациона форма је доступна на:
https://miteam.mi.sanu.ac.rs/asset/tz97w4Hu4c3unsJ7N