PLAN RADA SEMINARA ZA JUL 2023. GODINE

Predavanja na seminaru mogu se pratiti na daljinu preko linka
https://miteam.mi.sanu.ac.rs/asset/YoqHWKALRkRTbK9So.
Registracija za on-line praćenje predavanja na Seminaru je na linku
https://miteam.mi.sanu.ac.rs/asset/xzGqvSp7aWbg8WpYX.

Utorak, 04.07.2023. u 14:15, Knez Mihailova 36, sala 301f i Online
Raka Jovanović, Qatar Environment and Energy Research Institute, Doha, Qatar
APPLICATIONS OF MATHEURISTIC FIXED SET SEARCH
Many real world problems are presented best and easiest using mixed-integer programming (MIP) formulations. An issue is that standard MIP solvers usually cannot solve problem instances corresponding to real-world applications of the model within a reasonable time limit. In this presentation, the problem is addressed by extending the fixed set search to a matheuristic (MFSS) setting. To be exact, MFSS combines MIP and a heuristic approach. The proposed method avoids the complexity of a versatile metaheuristic implementation and manages to solve larger problems than the corresponding MIP. The inspiration for the FSS is the fact that generally high-quality solutions, for a specific problem instance, have many common elements. The FSS is a novel population-based metaheuristic, its idea is to generate new solutions that contain such elements. In essence, these elements, the fixed set, are included in the solutions that will be generated and the computational effort is dedicated to complete the partial solution or, in other words, "filling in the gaps". In this presentation, the MFSS will be illustrated on two classical combinatorial optimization problems based on the knapsack problem. In addition, the effectiveness of the MFSS is shown on the practical problem of scheduling E-Bus in public transport.

---

RUKOVODIOCI SEMINARA

MI SANU
Vera Kovačević-Vujčić =
Milan Dražić

FON
Zorica Bogdanovic
Marijana Despotovic-Zrakic

IEEE
Bozidar Radenkovic