local search

Multi-neighborhood local search with room split balancer for exam timetabling: A case study

This study explicitly addresses the examination timetabling problem (ETP) at University Malaysia Sarawak (UNIMAS), which encompasses both online and physical exams treated within a unified framework of uncapacitated and capacitated formulations.  Currently, faculty exam timetabling managed by proprietary systems meets basic constraints but needs to incorporate faculty and stakeholder preferences into a mathematical formulation, making solution quality difficult to assess.  To address this issue, we propose a mathematical model that includes university-wide constraints a

COMBINED APPROACH TO BUILDING OPTIMAL ROUTES FOR INDIVIDUAL TRIPS IN A MOBILE APPLICATION

The paper deals with building optimal routes for individual trips under the influence of many factors and possible changes in the input parameters (such as weather conditions, traffic congestion, etc). We have analyzed four classes of algorithms for solving the traveling salesperson problem and evaluated their applicability in a tourist mobile application. The software should be a mobile application since only a few travelers take computers or laptops but most of them carry smartphones.