|
課程名稱 |
運輸最佳化模式與方法
Optimization Models and Methods for Transportation |
|
開課學期 |
107-1 |
|
授課對象 |
工學院 交通工程組 |
|
授課教師 |
朱致遠 |
|
課號 |
CIE7196 |
|
課程識別碼 |
521 M5190 |
|
班次 |
|
|
學分 |
3.0 |
|
全/半年 |
半年 |
|
必/選修 |
選修 |
|
上課時間 |
星期四2,3,4(9:10~12:10) |
|
上課地點 |
土320 |
|
備註 |
限本系所學生(含輔系、雙修生)
總人數上限：20人 |
|
Ceiba 課程網頁 |
http://ceiba.ntu.edu.tw/1071transp_modeling |
|
課程簡介影片 |
|
|
核心能力關聯 |
核心能力與課程規劃關聯圖 |
|
課程大綱
|
|
為確保您我的權利,請尊重智慧財產權及不得非法影印
|
|
課程概述 |
本課程介紹最佳化模式與求解方法及其在運輸工程之應用，內容包括數學規劃模式之建構技巧以及求解方法，並著重於網路流動模式與組合問題，本課程所使用之電腦工具包括AMPL模式語言、Gurobi Optimizer、以及Python程式語言。本課程的前置課程為作業研究與計算機程式。本課程以英文授課。 |
|
課程目標 |
本課程之目的在於提供學生建構以及求解運輸最佳化問題的能力與工具。 |
|
課程要求 |
Policy on assignment:
1. Homework will be assigned after every class.
2. No partial or late submission of homework is accepted.
3. You are encouraged to discuss homework with your classmates. However, you are requested to write up your report or write your code independently. Plagiarism will lead to a zero score on assignments, exercises, and exams. More punishment will also be considered depending on the seriousness of plagiarism.
4. The designated modeling and programming languages must be used. Alternatives are not permitted.
Policy on attendance and class participation:
1. Punctuality, attendance, and participation at class meetings are expected. If a student must miss a class due to sickness or emergency, she or he must email or call the instructor as early as possible. Other excuses for absence such as conferences and projects are not accepted.
2. Laptops are prohibited unless required or permitted. Cellphones are strictly prohibited. |
|
預期每週課後學習時數 |
|
|
Office Hours |
|
|
指定閱讀 |
Lecture slides will be distributed in the class.
1. [MBMP] Model Building in Mathematical Programming, H. P. Williams, Wiley, 5th edition, 2013 (electronic resource available from NTU library).
2. [AMPL-T] Introduction to AMPL: A Tutorial, originally written by P. Kaminsky, 2000 and later modified by D. Rajan, 2003 (http://www.ieor.berkeley.edu/~atamturk/ieor264/samples/ampl/ampldoc.pdf).
3. [AMPL-P] A modeling language for mathematical programming, R. Fourer, D. M. Gay, and B. W. Kernighan, Management Science, 36(5), 519-554, 1990.
4. [AMPL-B] AMPL: A Modeling Language for Mathematical Programming, R. Fourer, D. M. Gay, and B. W. Kernighan, 2nd edition, Cengage Learning, 2002 (http://www.ampl.com/BOOK/download.html, http://www.ampl.com/EXAMPLES/index.html).
5. [AIMMS] AIMMS Optimization Modeling, J. Bisschop, Paragon Decision Technology, AIMMS 3 edition, 2012.
LP: http://www.aimms.com/aimms/download/manuals/aimms3om_linearprogrammingtricks.pdf
IP: http://www.aimms.com/aimms/download/manuals/aimms3om_integerprogrammingtricks.pdf
6. [UTN] Urban Transportation Networks, Y. Sheffi, Prentice-Hall, Inc., 1985 (http://sheffi.mit.edu/urban-transportation).
7. [NET] Network Flows: Theory, Algorithms, and Applications, by R. A. Ahuja, T. L. Magnanti, and J. B. Orlin, Prentice Hall, 1993 (hardcopy available from NTU Library).
8. [PYTHON] A primer on scientific programming with Python, H. P. Langtangen, Springer, 3rd edition, 2012 (Electronic resource available from NTU library).
Anaconda Python Distribution: https://store.continuum.io/cshop/anaconda/
PyCharm Python IDE: https://www.jetbrains.com/pycharm/
9. [GUROBI] Quick Start Guide for Python Interface: http://www.gurobi.com/documentation/6.0/windows-quick-start-guide/py_python_interface#section:Python
Python Reference Manual: http://www.gurobi.com/documentation/6.0/reference-manual/py_python_reference_manual
10. [HTSP] Heuristics for the traveling salesman problem. C. Nilsson, http://web.tuke.sk/fei-cit/butka/hop/htsp.pdf.
11. [META] Introduction to Operations Research, Hillier and Lieberman, McGraw-Hill, 8th edition, 2005, or 9th edition, 2009 (hardcopy available from NTU Library).
12. [COMB] Combinatorial optimization: algorithms and complexity, C. H. Papadimitriou and K. Steiglitz, Dover Publications, 1998 (hardcopy available from NTU Library).
13. [IP] Integer Programming, L. A. Wolsey, John Wiley & Sons, Inc., 1998 (hardcopy available from NTU Library).
14. [LR] The Lagrangian Relaxation Method for Solving Integer Programming Problems, M. L. Fisher, Management Science, 27(1), 1981 (reproduced in 50(12), 2004 as part of “Ten Most Influential Papers of Management Science's First Fifty Years”).
15. [FACLOC] Network and Discrete Location: Models, Algorithms, and Applications, Mark S. Daskin, 2013 (Electronic resource available from NTU library).
|
|
參考書目 |
待補 |
|
評量方式
(僅供參考) |
|
No. |
項目 |
百分比 |
說明 |
|
1. |
Assignments |
80% |
|
2. |
Class Participation |
20% |
|
|
|