臺灣地區的橋樑必須每年進行所有構件的全面性定期檢測。實務上橋 樑定期檢測作業排程主要由人力指派方式決定，缺乏系統性分析與整體考 量，當面臨龐大的檢測作業排程時，將造成人力、經費與時間等成本之浪 費。緣此，本研究建構一橋樑定期檢測作業排程最佳化模式，期能使執行 橋樑定期檢測作業的總成本最小化。此外，本研究模式為一大型含額外限 制之整數網路流動問題，屬NP-Hard 問題，難以現有最佳化軟體直接求最 佳解，故本研究發展一啟發解演算法。最後，本研究以國內某地區之橋樑 定期檢測作業為測試範例，其結果良好，顯示本研究模式與演算法可供實 務界應用之參考。

The bridges in Taiwan have to be inspected regularly in every year. In practice, the routing and scheduling for bridge inspections depend on the experience of the decision maker, which is neither efficient nor effective. Therefore, in this study we propose an optimal routing and scheduling model with the objective of minimizing the total cost for bridge regular inspection. In addition, the model is formulated as an integer network flow problem with side constraints, which is characterized as NP-hard. To efficiently solve the realistically large problems occurring in pracitce, a heuristic algorithm is developed. Finally, we perform a case study using real data of bridge inspections from a Taiwan city to demonstrate and to elvaute the model and the solution algorithm. The results are good, showing that the model and the solution algorithm could be useful references for practices.