臺灣博碩士論文加值系統

共享經濟現今的盛行帶動群眾物流的熱潮。同時，採用群眾物流能降低最後一哩配送業者的固定成本，對於業者來說是具備相當程度的誘因。然而，群眾物流士通常受限於有限的空閒時間，因此他們無法單獨配送大都會區內的中長程訂單。在臺灣，並無空間群眾外包貨運平台應用接力配送之自動化任務指派模式，而接力配送模式能將大都會區內中長程訂單拆分成一個以上之任務。為涵蓋不同空閒時間之群眾物流士，可為結合不接力配送與接力配送之混合配送模式。採用此模式可使群眾物流士完成更多中長程訂單並增加平台營收。
本研究為以群眾物流平台業者的立場研究指派問題，並提出一個週期性自動化指派模式。本研究探討兩種配送模式：純不接力配送模式以及混合配送模式，平台在指派時將視當期群眾物流士、訂單與接力點指派任務。為了更趨近現實，本研究以兩種配送模式針對每個範例進行三個週期之任務指派。在最佳案例中，平台營收增加753.3%，而平均空車返程距離減少57.6%；而在最差案例中，平台營收僅上漲155.3%，而平均空車返程距離僅降低24.0%。使用混合配送模式下，敏感度分析結果指出群眾物流士之空閒時間與平台營收呈現非線性關係，而群眾物流士接力包裹之接力時間與平台營收也呈現非線性關係。研究結果顯示與純不接力配送相比下，使用混合配送模式能帶給平台更多的營收與減少群眾物流士的平均空車返程距離。

The prevalence of the sharing economy has driven the crowd logistics boom. Meanwhile, adopting crowd logistics can reduce fixed costs of last mile logistics service providers, which also creates a considerable degree of incentive for the providers. However, crowd logistics couriers usually have limited free time, and thus they cannot deliver mid- or long-range orders alone within a metropolitan area. In Taiwan, no freight platform uses the automatic task assignment model applying the relay delivery mode, which could have split mid- or long-range orders of metropolitan areas into more than a task. To cover different amounts of couriers’ free time, the model would be the mixed delivery mode combining the non-relay delivery and the relay delivery. Adopting this model allows crowd logistics couriers to finish more mid- or long-range orders, and the revenue of platforms will thus increase.
Proposing an automatic periodic assignment model, this paper studies the Assignment Problem (AP) from the standpoint of crowd logistics platforms. This study investigates two delivery models: the pure non-relay delivery and the mixed delivery. Platforms assign tasks based on the availability of crowd logistics couriers, tasks, and relay points at the moment of assignments. To better represent the reality, this paper considers a three-period simulation among different scales for both delivery models. In the best-case scenario, platform revenues increase by 753.3%, and the average returning empty distance decreases by around 57.6%. While in the worst-case scenario, the revenues increase by only 155.3%, and the average returning empty distance decreases by merely 24.0%. Using the mixed delivery mode, the sensitivity analysis suggests a nonlinear relationship between the amount of free time each courier has and the platform revenue, as well as between the amount of relay time couriers relay the package and the platform revenue. The results show that the mixed delivery mode performs better in both increasing the platform revenue and reducing the average returning empty distance in comparison to the pure non-relay delivery mode.

摘要………………………………………………………………………………………………..i
Abstract…...………………………………………………………………………………………ii
誌謝………………………………………………………………………………………………iii
目錄………………………………………………………………………………………………iv
圖目錄……………………………………………………………………………………………vi
表目錄…………………………………………………………………………………………...vii
第一章 緒論 1
1.1研究背景 1
1.2研究動機 2
1.3研究目的 3
1.4研究流程 3
第二章 文獻回顧 5
2.1最後一哩 5
2.1.1最後一哩配送模式 5
2.1.2最後一哩發展趨勢 8
2.1.3最後一哩實例–以沃爾瑪為例 8
2.2共享經濟 9
2.2.1共享經濟特性 10
2.2.2空間群眾外包 11
2.3群眾物流 13
2.3.1群眾物流分類 13
2.3.2應用於城市物流實例 15
2.4接力配送 18
2.4.1接力配送定義 18
2.4.2接力配送於群眾物流之應用 19
2.5指派問題 21
2.5.1指派問題定義 22
2.5.2指派問題求解方法 24
2.5.3空間群眾外包任務指派問題與求解方法 25
2.6小結 35
第三章 接力配送之群眾物流任務指派模式建立 36
3.1問題描述 36
3.2接力配送之群眾物流任務指派模式 40
3.2.1模型假設條件 40
3.2.2符號定義 41
3.2.3數學模式 43
3.2.4求解說明 46
第四章 範例結果與分析 47
4.1範例說明 48
4.2範例求解 57
4.2.1範例1 (E-01)結果分析 57
4.2.2範例2 (E-02) 結果分析 61
4.2.3範例3 (E-03)與範例4 (E-04)結果分析 61
4.3情境分析 62
4.3.1純不接力配送之數學模式 62
4.3.2模式求解結果比較 64
4.4敏感度分析 67
4.4.1群眾物流士空閒時間 67
4.4.2任務接力時間 69
4.5結果分析與討論 70
第五章 結論與建議 71
5.1結論 71
5.2未來研究方向建議 72
第六章 參考文獻 74

中文文獻資料
[1]經濟部商業司（2000）。中華民國物流年鑑。
[2]戴嬡坪、蕭秀貞、張立潔、張鈺欣以及張玉玲（2005）。台灣專業型宅配公司個案之比較研究，經營管理論叢–第一屆管理與決策2005年學術研討會特刊，第231-252頁。
[3]楊孟軒（2017）。城市物流之快遞服務任務指派模式，國立交通大學，碩士論文。
英文文獻資料
[1]Agatz, N., Campbell, A., Fleischmann, M., and Savelsbergh, M. (2011). Time Slot Management in Attended Home Delivery. Transportation Science, 45(3), 435–449.
[2]Abraham, I., Alonso, O., Kandylas, V., and Slivkins, A. (2013). Adaptive Crowdsourcing Algorithms for the Bandit Survey Problem. In COLT , 882-910.
[3]Archetti, C., Speranza, M. G., and Savelsbergh, M. W. P. (2016). The vehicle routing problem with occasional drivers. European Journal of Operational Research, 254(2), 472-480.
[4]Akeb, H., Moncef, B., and Durand, B. (2018). Building a collaborative solution in dense urban city settings to enhance parcel delivery: An effective crowd model in Paris. Transportation Research Part E: Logistics and Transportation Review, Volume 119, Pages 223-233.
[5]Alnaggar, A., Gzara, F., and Bookbinder, J. H. (2019). Crowdsourced Delivery: A Review of Platforms and Academic Literature. Omega, 102139.
[6]Botsman, R., and Rogers, R. (2010). What’s Mine Is Yours: The Rise of Collaborative Consumption. Harper Business, New York.
[7]Behrend, M., Meisel, F., Fagerholt, K., and Andersson, H. (2019). An exact solution method for the capacitated item-sharing and crowdshipping problem. European Journal of Operational Research, Volume 279, Issue 2, Pages 589-604.
[8]Caron, G., Hansen, P., and Jaumard, B. (1999). The assignment problem with seniority and job priority constraints, Operations Research, 47 (3), 449-454.
[9]Cortés, C. E., Matamala, M., and Contardo, C. (2010). The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method. European Journal of Operational Research, 200(3), 711–724.
[10]Cranshaw, J., Toch, E., Hong, J., Kittur, A., & Sadeh, N. (2010). Bridging the gap between physical location and online social networks, the Proceedings of the 12th ACM international conference on Ubiquitous computing.
[11]Cheng, P., Lian, X., Chen, Z., Fu, R., Chen, L., Han, J., and Zhao, J. (2015). Reliable diversity-based spatial crowdsourcing by moving workers. Proceedings of the VLDB Endowment, 8(10), 1022-1033.
[12]Cheng, P., Lian, X., Chen, L., and Shahabi, C. (2017). Prediction-based task assignment in spatial crowdsourcing. In 33rd IEEE International Conference on Data Engineering, ICDE ’17, pages 997–1008.
[13]Carbone, V., Rouquet, A., and Roussat, C. (2017). The Rise of Crowd Logistics: A New Way to Co-Create Logistics Value. Journal of Business Logistics, 38(1), 238-252.
[14]Dang, H., Nguyen, T., and To, H. (2013). Maximum complex task assignment: Towards tasks correlation in spatial crowdsourcing. In Proceedings of International Conference on Information Integration and Web-based Applications and Services, 77.
[15]Edmonds, J. and Karp, R. M. (1972). Theoretical improvements in algorithmic effciency for network ow problems. Journal of the ACM.
[16]Felson, M., and Spaeth, J. L. (1978). Community Structure and Collaborative Consumption: A Routine Activity Approach. American Behavioral Scientist, Vol. 21, No. 4, pp. 614-624.
[17]Festa, P. (2014). A brief introduction to exact, approximation, and heuristic algorithms for solving hard combinatorial optimization problems. 2014 16th International Conference on Transparent Optical Networks (ICTON).
[18]Gdowska, K., Viana, A., and Pedroso, J. P. (2018). Stochastic last-mile delivery with crowdshipping. Transportation Research Procedia, 30, 90-100.
[19]Guo, B., Liu, Y., Wang, L., Li, V.O.K., Lam, J.C.K., and Yu, Z. (2018). Task allocation in spatial crowdsourcing: Current state and future directions. IEEE Internet Things J, 5(3), 1749–1764.
[20]Harris, C. (2002) Collaborative Commerce. Hyperinnovation, 93-102.
[21]Howe, J. (2006). The Rise of Crowdsourcing. Wired, 14(6), 1-4.
[22]ul Hassan, U., and Curry, E. (2013). A capability requirements approach for predicting worker performance in crowdsourcing. In Collaborative Computing: Networking, Applications and Worksharing (Collaboratecom), 2013 9th International Conference Conference , 429-437.
[23]Hübner, A., Kuhn, H., and Wollenburg, J. (2016). Last mile fulfilment and distribution in omni-channel grocery retailing. International Journal of Retail & Distribution Management, 44(3), 228–247.
[24]Huang, K. C., and Nashir A., M. (2019). A decision model for last-mile delivery planning with crowdsourcing integration. Computers & Industrial Engineering, 135, 898-912.
[25]Kuhn, H. W. (1955) The Hungarian Method for the assignment problem. Naval Research Logistics Quarterly, 2, 83-97.
[26]Kämäräinen, V., Saranen, J. and Holmström, J. (2001). The reception box impact on home delivery efficiency in the e-grocery business, International Journal of Physical Distribution and Logistics Management, Vol. 31 No. 6, pp. 414-426.
[27]Kleinberg, J. and Tardos, E. (2006). Algorithm design. Pearson Education India, Delhi, India.
[28]Kazemi, L. and Shahabi C. (2012). Geocrowd: enabling query answering with spatial crowdsourcing. In Proceedings of the 20th International Conference on Advances in Geographic Information Systems, SIGSPATIAL ’12, pages 189–198.
[29]Kafle, N., Zou, B., and Lin, J. (2017). Design and modeling of a crowdsource-enabled system for urban parcel relay and delivery. Transportation Research Part B: Methodological, 99, 62-82.
[30]Mazzola, J.B., and Neebe, A.W. (1986). Resource-constrained assignment scheduling, Operations Research, 34 (4), 560-572.
[31]Morganosky, M., A. and Cude, B., J. (2000). Consumer response to online grocery shopping, International Journal of Retail & Distribution Management, Vol. 28 No. 1, pp. 17-26.
[32]Murray, C. C., & Chu, A. G. (2015). The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery. Transportation Research Part C: Emerging Technologies, 54, 86–109.
[33]Papadimitriou, C. H. and Steiglitz, K. (1998). Combinatorial Optimization: Algorithms and Complexity. Courier Dover Publications, Mineola, NY.
[34]Pentico, D. W. (2007). Assignment problems: A golden anniversary survey. European Journal of Operational Research, 176(2), 774-793.
[35]Peng, Z., Al Chami, Z., Manier, H., and Manier, M.-A. (2019). A hybrid particle swarm optimization for the selective pickup and delivery problem with transfers. Engineering Applications of Artificial Intelligence, 85, 99–111.
[36]Söntgerath, V., Bubner, N., Bubner, N., and Helbig R. (2013). LOGISTICS TREND RADAR: Delivering insight today. Creating value tomorrow, DHL Customer Solutions & Innovation.
[37]Sampaio, A., Savelsbergh, M., Veelenturf, L., and Woensel T. (2019). Crowd-Based City Logistics, Sustainable Transportation and Smart Logistics : Decision-Making Models and Solutions, Pages 381-400.
[38]To, H., Shahabi, C., and Kazemi, L. (2015). A Server-Assigned Spatial Crowdsourcing Framework. ACM Transactions on Spatial Algorithms and Systems, 1(1), 1–28.
[39]To, H., and Shahabi, C. (2018). Location privacy in spatial crowdsourcing, In: Handbook of Mobile Data Privacy, pp. 167–194.
[40]Tong, Y., and Zhou, Z. (2018). Dynamic task assignment in spatial crowdsourcing, In: Proceedings of the 26rd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, vol. 10, no. 2, pp. 18–25.
[41]Tong, Y., Zhou, Z., Zeng, Y., Chen, L., and Shahabi, C. (2020). Spatial crowdsourcing: a survey. The VLDB Journal, Volume 29, Issue 1, pp 217–250.
[42]Votaw, D.F. and Orden, A. (1952). The personnel assignment problem. Symposium on Linear Inequalities, SCOOP 10, USAF, pp. 155-163.
[43]Vergara, H. A., and Root, S. (2013). Mixed fleet dispatching in truckload relay network design optimization. Transportation Research Part E: Logistics and Transportation Review, 54, 32–49.
[44]Wang, Y., Zhang, D., Liu, Q., Shen, F., and Lee, L. H. (2016). Towards enhancing the last-mile delivery: An effective crowd-tasking model with scalable solutions. Transportation Research Part E: Logistics and Transportation Review, 93, 279–293.
[45]Zhang, X., Yang, Z., Sun, W., Liu, Y., Tang, S., Xing, K., and Mao, X. (2016). Incentives for mobile crowd sensing: a survey, IEEE Commun. Surv. Tutor., 18(1), 54–67.
中文網路資料
[1]朱柏翰、陳志勇、高偉智以及林志成（2016）。台灣機車快遞產業發展現況與契機，物流與技術戰略。（查詢時間：2020/1/14）
https://www.logisticnet.com.tw/publicationArticle.asp?id=364
[2]Lalamove官方網站（2017），Lalamove App基本使用教學。（查詢時間：2020/1/16）
https://www.lalamove.com/taiwan/taipei/zh/blog/lalamove-app-%E5%9F%BA%E6%9C%AC%E4%BD%BF%E7%94%A8%E6%95%99%E5%AD%B8
[3]全球快遞官方網站（2020），服務項目。（查詢時間：2020/1/16）
https://www.global-business.com.tw/service.php
[4]新北市政府交通局（2015），北北基桃成立交通合作平台。（查詢時間：2020/1/18）
https://www.ntpc.gov.tw/ch/home.jsp?id=28&parentpath=0,6,27&mcustomize=multimessages_view.jsp&dataserno=201510060006
[5]道路交通安全規則（2020），全國法規資料庫。（查詢時間：2020/4/28）
https://law.moj.gov.tw/LawClass/LawSingle.aspx?pcode=K0040013&flno=93
英文網路資料
[1]Apple Maps. (查詢時間：2019/12/26)
https://www.apple.com/tw/ios/maps/
[2]Botsman, R. (2013). The Sharing Economy Lacks a Shared Definition. Co Exist. (查詢時間：2019/12/20)
http://www.fastcoexist.com/3022028/the-sharing-economy-lacks-ashareddefinition#4
[3]Barr, A. and Wohl, J. (2013). Exclusive: Wal-mart may get customers to deliver packages to online buyers. Reuters. (查詢時間：2020/03/15)
https://tinyurl.com/yccje985
[4]Cambridge Dictionary. (查詢時間：2019/09/15)
https://dictionary.cambridge.org/dictionary/english-chinese-traditional/relay
[5]Cosgrove, E. (2019). Walmart's last mile around the world, Supply Chain Dive. (查詢時間：2020/1/10)
https://www.supplychaindive.com/news/walmart-last-mile-delivery/565803/
[6]Clement, J. (2019). E-commerce share of total global retail sales from 2015 to 2023. (查詢時間：2020/6/8)
https://www.statista.com/statistics/534123/e-commerce-share-of-retail-sales-worldwide/
[7]Google Maps. (查詢時間：2020/4/28)
https://www.google.com.tw/maps
[8]Schor, J. (2014). Debating the Sharing Economy, Great Transition Initiatives. (查詢時間：2019/10/17)
https://greattransition.org/publication/debating-the-sharing-economy
[9]Smith, M. (2019). Time to Deliver: How Walmart Approaches Last-Mile Convenience Around the World, Walmart Corporate Affairs. (查詢時間：2020/1/10)
https://corporate.walmart.com/newsroom/2019/08/22/time-to-deliver-how-walmart-approaches-last-mile-convenience-around-the-world