電腦演算法在運輸之應用

The Application of Computer Algorithms in Transportation

學期

115-1

學分

3 學分

當期課號

537210

永久課號

MGTM30064

開課單位

運輸與物流管理學系物流管理碩博士班、運輸與物流管理學系交通運輸碩博士班

授課教師

顏子皓

校區

光復

類別

選修

上課時間表

節	週二
5 13:20–14:10	電腦演算法在運輸之應用 A904（光復） 3 節連堂
6 14:20–15:10
7 15:30–16:20

* 根據陽明交大上課時間表所列

概述

The course aims to introduce the computation concepts used in analyzing transportation problems. It includes the following topics: C++ / Python language tutorial, data structures, elementary and advanced searching & sorting algorithms, graph algorithms (Dijkstra's Algorithm, Augmenting Path algorithm, Prim's Algorithm, Kruskal's Algorithm, etc.) and algorithm design techniques (Divide-and-Conquer Algorithms, Dynamic Programming, Branch-and-Bound Technique, Meta-Heuristics). Applications and case studies presented include transportation-related problems (Shortest Path Problems, Maximum Flow, Minimum Spanning Tree, Facility Location Problems, Traveling Salesman Problem, maintenance, logistics analysis etc.). After taking the course, students are expected to be able to solve transportation problems using computer algorithms with C++/ Python language.

先修科目

備註

無備註

教學方式

Pedagogy and other supplementary information (websites, Ta handouts)

評分方式

Description of Course Details: 1. Homework and Assignments: 80% (4 Problem sets + 4 Minor Excercises) 2. Course Participation: 20% *Notice that this course will be held in hybrid form, you can take the course online through the meeting link. *Notice that minor exercises are provided as extra-credit opportunities for the homework. The number of minor exercises may vary depending on the difficulty of the homework design.

課程大綱

教師未提供此項資料

週次計畫

週次	主題
第 1 週	00 Welcome & Introduction 2026-09-08(二) 時數：[2026-09-08]顏子皓(3.00)
第 2 週	01 C++ / Python programming languages tutorial 2026-09-15(二) 時數：[2026-09-15]顏子皓(3.00)
第 3 週	01 C++ / Python programming languages tutorial (continued) 2026-09-22(二) 時數：[2026-09-22]顏子皓(3.00)
第 4 週	01 C++ / Python programming languages tutorial (continued) 2026-09-29(二) 時數：[2026-09-29]顏子皓(3.00)
第 5 週	02 Data Structures 2026-10-06(二) 時數：[2026-10-06]顏子皓(3.00)
第 6 週	02 Data Structures (continued) 2026-10-13(二) 時數：[2026-10-13]顏子皓(3.00)
第 7 週	03 Sorting and Searching 2026-10-20(二) 時數：[2026-10-20]顏子皓(0.00)
第 8 週	04 Graph and Network Algorithms: Shortest Path Algorithm 2026-10-27(二) 時數：[2026-10-27]顏子皓(3.00)
第 9 週	04 Graph and Network Algorithms: Maximum Flow Algorithm 2026-11-03(二) 時數：[2026-11-03]顏子皓(3.00)
第 10 週	04 Graph and Network Algorithms: Minimum Spanning Tree Algorithm 2026-11-10(二) 時數：[2026-11-10]顏子皓(3.00)
第 11 週	05 Algorithm Design Techniques: Divide-and-Conquer Algorithm 2026-11-17(二) 時數：[2026-11-17]顏子皓(3.00)
第 12 週	05 Algorithm Design Techniques: Dynamic Programming 2026-11-24(二) 時數：[2026-11-24]顏子皓(3.00)
第 13 週	05 Algorithm Design Techniques: Greedy Algorithms 2026-12-01(二) 時數：[2026-12-01]顏子皓(3.00)
第 14 週	05 Algorithm Design Techniques: Branch-and-Bound Technique 2026-12-08(二) 時數：[2026-12-08]顏子皓(3.00)
第 15 週	05 Algorithm Design Techniques: Local Search Algorithm 2026-12-15(二) 時數：[2026-12-15]顏子皓(3.00)
第 16 週	05 Algorithm Design Techniques: Global Search Algorithm 2026-12-22(二) 時數：[2026-12-22]顏子皓(3.00)

教科書

Lecture Material: 1. Lecture Notes 2. Other online resources Reference: 1. Cormen, Thomas, Charles Leiserson, Ronald Rivest, and Clifford Stein. Introduction to Algorithms. 2nd ed. Cambridge, MA: MIT Press, 2001. ISBN: 9780262032933. 2. Horowitz, Ellis, Sartaj Sahni, and Sanguthevar Rajasekaran. Computer Algorithms / C++. Summit, NJ: Silicon Press, 2007. ISBN: 9780929306421. 3. Press, William, Saul Teukolsky, William Vetterling, and Brian Flannery. Numerical Recipes: The Art of Scientific Computing. 3rd ed. New York, NY: Cambridge University Press, 2007. ISBN: 9780521880688. 4. Network flows : Theory, algorithms, and applications, Ahuja, Ravindra K.; Magnanti, Thomas L.; Orlin, James B. c1993

Office Hours

地點: A808
時間: Book by email
聯絡方式: Email: tyan@nycu.edu.tw