電腦演算法在運輸之應用

The Application of Computer Algorithms in Transportation

學期

114-1

學分

3 學分

當期課號

537216

永久課號

MGTM30064

開課單位

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

授課教師

顏子皓

校區

光復

類別

選修

上課時間表

節	週二
5 13:20–14:10	電腦演算法在運輸之應用 A901 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.

週次計畫

週次	主題
第 1 週	00 Welcome & Introduction
第 2 週	01 C++ / Python programming languages tutorial
第 3 週	01 C++ / Python programming languages tutorial (continued)
第 4 週	01 C++ / Python programming languages tutorial (continued)
第 5 週	02 Data Structures
第 6 週	02 Data Structures (continued)
第 7 週	03 Sorting and Searching
第 8 週	04 Graph and Network Algorithms: Shortest Path Algorithm
第 9 週	04 Graph and Network Algorithms: Maximum Flow Algorithm
第 10 週	04 Graph and Network Algorithms: Minimum Spanning Tree Algorithm
第 11 週	05 Algorithm Design Techniques: Divide-and-Conquer Algorithm
第 12 週	05 Algorithm Design Techniques: Dynamic Programming
第 13 週	05 Algorithm Design Techniques: Greedy Algorithms
第 14 週	05 Algorithm Design Techniques: Branch-and-Bound Technique
第 15 週	05 Algorithm Design Techniques: Local Search Algorithm
第 16 週	05 Algorithm Design Techniques: Global Search Algorithm

教科書

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