【專題演講】2025-06-24 15:30-17:30 結合退火演算法與網頁技術解決智慧排班問題 Eugene Yu-Chun Lin (University of Wisconsin-Madison, Ph.D. Student in Computer Sciences)
數學跨領域研究中心 2025年專題演講
|
DATE
|
2025-6-24(二) 15:30-17:30
|
|
PLACE
|
理化實驗大樓2F
|
|
SPEAKER
|
林友鈞 Eugene Yu-Chun Lin (University of Wisconsin-Madison, Ph.D. Student in Computer Sciences) |
|
TITLE
|
結合退火演算法與網頁技術解決智慧排班問題 Solving Intelligent Scheduling Problems through the Integration of Annealing Algorithms and Web Technologies |
|
ABESTRACT
|
在當代資訊科技的浪潮下，如何有效安排人力與資源成為企業與科研機構的重要課題。本演講介紹結合數位退火技術與現代網頁前後端架構的系統，專門用來處理大規模排班問題。排班屬於NP困難的組合最佳化問題，傳統方法常面臨效率低落或無法應付約束複雜性的挑戰。利用退火演算法的高效尋優能力，搭配自訂QUBO模型建構排班目標函數，再透過數位退火雲端系統（如Fujitsu DA或Compal Quantix）快速求解。 In the wave of contemporary information technology, the efficient allocation of manpower and resources has become a critical issue for enterprises and research institutions. This presentation introduces a system that integrates digital annealing technology with a modern web-based frontend-backend architecture, specifically designed to tackle large-scale scheduling problems.Scheduling is an NP-hard combinatorial optimization problem, and traditional methods often struggle with efficiency or fail to handle complex constraints. Our system leverages the powerful optimization capabilities of annealing algorithms, constructs customized QUBO models to represent the scheduling objective functions, and solves them rapidly using cloud-based digital annealing platforms such as Fujitsu DA or Compal Quantix. |
|
SPONSOR
|
國立成功大學數學跨領域研究中心
|