[Scheduling seminar] Changhyun Kwon (KAIST/Omelet, Inc.) | Learning-Based Approaches to Comb. Prob. скачать в хорошем качестве

[Scheduling seminar] Changhyun Kwon (KAIST/Omelet, Inc.) | Learning-Based Approaches to Comb. Prob.

Keywords: Neural combinatorial optimization, Deep reinforcement learning, Vehicle routing Combinatorial optimization problems arising in transportation are often NP-hard, making them computationally challenging to solve at scale. Recent advances in machine learning have opened new avenues for tackling such problems, either as standalone solution strategies or by enhancing traditional optimization algorithms. This talk surveys a spectrum of learning-based approaches for transportation optimization, including: (i) end-to-end learning models, (ii) integration within exact algorithms, (iii) learning to guide local search, (iv) accelerating metaheuristics, (v) embedding within optimization formulations, and (vi) test-time search strategies. This talk will discuss the principles behind each approach, highlight representative applications, and reflect on both their current potential and open challenges for the future of transportation optimization. Organized by Zdenek Hanzalek (CTU in Prague), Michael Pinedo (New York University), and Guohua Wan (Shanghai Jiao Tong). Seminar's webpage: https://schedulingseminar.com/