參考文獻 |
1.朱經武、周偉禮 (2006),「以啟發式演算法求解單一場站多車種同時收送貨之車輛途程問題」,航運季刊,第15卷,第3期,頁63~頁88。
2.全國法規資料庫 (2021.4.28修訂) 所得稅法第五十一條。
取自https://reurl.cc/rgk6AN
3.行新聞GoNews (2020.9) 行車宅圖解6大自動駕駛等級 主動式安全、汽車科技。
取自https://www.gonews.com.tw/car/tech/4968/。
4.李忠憲 (2011),「運用粒子群最佳化解決多場站之收送貨問題」,國立交通大學運輸科技與管理學系碩士論文。
5.何采維 (2018),「宅配結合智慧櫃之車輛途程問題」,國立臺灣科技大學工業管理系碩士論文。
6.李寶玉 (2019),「使用智能櫃進行都會區最初與最終一哩收送與轉運物流之眾包運送問題研究」,國立成功大學工業與資訊管理學系碩士論文。
7.林士安 (2019),「考量裝載可行性之車輛途程問題:以B2B個案公司為例」,國立東華大學運籌管理研究所碩士論文。
8.林依穎 (2020),「市區公車路線設計與時刻表整合最佳化」,國立臺灣大學土木工程研究所碩士論文。
9.倪婉欣 (2020) ,「泰國消費者在最後一哩物流配送中使用智能櫃之意圖研究」,私立逢甲大學國際經營管理碩士論文。
10.張育銘 (2014),「應用時空網路建構貨櫃場內拖車排程與路線規劃模型」,國立臺灣海洋大學航運管理學系碩士論文。
11.黃品慈 (2018),「警察巡邏路線規劃模式暨求解演算法之研究」,國立中央大學土木工程學系碩士論文。
12.數位時代 電動車/交通科技:自駕技術離商用不遠了?「最懂自駕車」的詹景堯:先學習接受科技不完美
取自:https://www.bnext.com.tw/article/61531/autonomous-cars-ev
13.顏上堯、林妤玲、陳怡君 (2020),「最佳化報廢機車回收場區位途程模式之研究」,中國土木水利工程學刊,第32卷,第2期,頁135~頁146。
14.顏上堯、翁綵穗 (2001),「季節轉換間緩衝期飛航排程之研究」,運輸計劃季刊,第30卷,第4期,頁891~頁921。
15.顏上堯、蕭妃晏、謝潤曉 (2011),「跨校選授課專車排程規劃模式暨演算法之研究」,運輸計劃季刊,第40卷,第4期,頁367~頁392。
16.顏上堯、盧宗成、徐鸛侖 (2015),「考慮護運風險下保全運鈔車路線與排程模式暨演算法之研究」,運輸計劃季刊,第44卷,第1期,頁45~頁68。
17.Aziez, I., Côté, J.-F.& Coelho, LC. (2018). The multi-pickup and delivery problem with time windows: European Journal of Operational Research, Vol. 269, Issue 1, pp. 353-362.
18.Azizi, V.& Hu, G. (2020). Multi-product pickup and delivery supply chain design with location-routing and direct shipment: International Journal of Production Economics, Vol. 226, 107648.
19.Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems: Numerische mathematik, Vol. 4(1), 238-252.
20.Bodin L. and Golden B. (1981). Classification in vehicle routing and scheduling: Networks, Vol. 11, pp. 97-108.
21.Bruni, M.E., Toan,D.Q. and Nam, L.Q. (2021). The multi-vehicle profitable pick-up and delivery routing problem with uncertain travel times: Transportation Research Procedia, Vol. 52, pp. 509-516.
22.Chen, C. Y., & Kornhauser, A. L. (1990): Decomposition of convex mulitcommodity network flow problem: Report SOR-90-19, Dept. of Civil Engineering and Operations Research, Princeton University, Princeton, NJ.
23.Chu, J., Yan, S., and Huang, H. (2017). A Multi-Trip Split-Delivery Vehicle Routing Problem with Time Windows for Inventory Replenishment Under Stochastic Travel Times: Networks and Spatial Economics, Vol. 17, Issue 1, pp. 41-68.
24.Goeke, D. (2019). Granular tabu search for the pickup and delivery problem with time windows and electric vehicles: European Journal of Operational Research, Vol. 278, Issue 3, pp. 821-836.
25.Jun, L., Hamidreza, E., Michael, G. and Glenn, G. (2021). Deploying autonomous mobile lockers in a two-echelon parcel operation: Transportation Research Part C: Emerging Technologies, Vol. 128, 103155
26.Kennington, J., & Shalaby, M. (1977). An effective subgradient procedure for minimal cost multicommodity flow problems: Management Science, Vol. 23(9), 994-1004.
27.Lu, C.C., Yan, S. and Huang, Y.W. (2018). Optimal scheduling of a taxi fleet with mixed electric and gasoline vehicles to service advance reservations: Transportation Research Part C: Emerging Technologies, Vol. 93, pp. 479-500.
28.Mahmoudi, M., & Zhou, X. (2016). Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations: Transportation Research Part B: Methodological, Vol. 89, pp. 19-42.
29.Mesquita, M., & Paixao, J. (1992). Multiple depot vehicle scheduling problem: A new heuristic based on quasi-assignment algorithms. In Computer-Aided Transit Scheduling (pp. 167-180). Springer, Berlin, Heidelberg.
30.Schwerdfeger, S. & Boysen, N. (2020). Optimizing the changing locations of mobile parcel lockers in last-mile distribution: European Journal of Operational Research, Vol. 285, Issue 3, 1077-1094.
31.Serdar, T., Mitsuo, G. (2012). A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries: Computers & Industrial Engineering, Vol. 62, Issue 3, pp. 755-761.
32.Simpson, R. W. (1996). Scheduling and Routing Models for Airline Systems.
33.Sitek, P., Wikarek, J., Rutczyńska-Wdowiak, K., Bocewicz, G., and Banaszak, Z. (2021). Optimization of capacitated vehicle routing problem with alternative delivery, pick-up and time windows: A modified hybrid approach: Neurocomputing, Vol. 423, pp. 670-678.
34.Yan, S. and Chen, H.-L. (2002). A scheduling model and a solution algorithm for inter-city bus carriers: Transportation Research Part A: Policy and Practice, Vol. 36(9), pp. 805-825.
35.Yan, S., Lin, C.K. and Chen, S.Y. (2014). Logistical support scheduling under stochastic travel times given an emergency repair work schedule: Computers & Industrial Engineering, Vol. 67, pp. 20-35.
36.Yan, S. and Young, H.-F. (1996). A decision support framework for multi-fleet routing and multi-stop flight scheduling: Transportation Research Part A: Policy and Practice, Vol. 30(5), pp. 379-398.
37.Zhang, C., Gao, Y., Yang, L., Gao, Z., Qi, J. (2020). Joint optimization of train scheduling and maintenance planning in a railway network: A heuristic algorithm using Lagrangian relaxation: Transportation Research Part B: Methodological, Vol. 134, pp. 64-92. |