請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/60494
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 蔣明晃(Ming-Huang Chiang) | |
dc.contributor.author | Hong-Xin Lin | en |
dc.contributor.author | 林宏信 | zh_TW |
dc.date.accessioned | 2021-06-16T10:19:42Z | - |
dc.date.available | 2020-08-04 | |
dc.date.copyright | 2020-08-04 | |
dc.date.issued | 2020 | |
dc.date.submitted | 2020-07-27 | |
dc.identifier.citation | Bellman, R. 'Dynamic programming treatment of the travelling salesman problem' Journal of Assoc. Computing Mach. 9. 1962. Blickle, T. and L. Thiele (1996). 'A Comparison of Selection Schemes Used in Evolutionary Algorithms'. Evolutionary Computation. 4 (4): 361–394. doi:10.1162/evco.1996.4.4.361. ISSN 1063-6560. Chang, Y. C. (2014). 'B2C E-commerce Distribution Models in a Metropolitan Area.' Master Thesis, Graduate Institute of Industrial Engineering College of Engineering, National Taiwan University. Cheng, H. H. (2016). 'The Application of Multiple Ant Colony System with Time Limit on B2C E-Commerce Delivery Model.' Master Thesis, Graduate Institute of Industrial Engineering College of Engineering, National Taiwan University. Christofides, N. 'Worst-case analysis of a new heuristic for the travelling salesman problem.' Report 388, Graduate School of Industrial Administration, CMU, 1976. Clarke, G. and J. W. Wright (1964). 'Scheduling of vehicles from a central depot to a number of delivery points.' Operations Research 12(4): 568-581. Cook, S. (1971). 'The complexity of theorem proving procedures.' Proceedings of the Third Annual ACM Symposium on Theory of Computing. pp. 151–158. doi:10.1145/800157.805047. Croes, G. A. 'A method for solving traveling salesman problems.' Operations Res. 6 (1958), pp., 791-812. Dantzig, G. B. and J. H. Ramser (1959). 'The truck dispatching problem.' Management Science 6(1): 80-91. Donati, A. V., R. Montemanni, N. Casagrande, A. E. Rizzoli and L. M. Gambardella (2008). 'Time dependent vehicle routing problem with a multi ant colony system.' European journal of operational research 185(3): 1174-1191. Dorigo, M. (2007). Scholarpedia, 2(3):1461. Dorigo, M. and L. M. Gambardella (1997). 'Ant colony system: a cooperative learning approach to the traveling salesman problem.' Evolutionary Computation, IEEE Transactions on 1(1): 53-66. Dorigo, M., V. Maniezzo and A. Colorni (1996). 'Ant system: optimization by a colony of cooperating agents.' Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on 26(1): 29-41. Drezner, Z. and H. W. Hamacher. Facility Location: Applications and Theory. 2004. Goldberg, D. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison-Wesley Professional. ISBN 978-0201157673. Goldberg, D. and K. Deb (1991). 'A comparative analysis of selection schemes used in genetic algorithms.' Foundations of Genetic Algorithms: 69–93. Goodrich, M. T. and R. Tamassia (2015), '18.1.2 The Christofides Approximation Algorithm', Algorithm Design and Applications, Wiley, pp. 513–514. Held, M. and R. M. Karp. 'A dynamic programming approach to sequencing problem.' Journal for the Society for Industrial and Applied Mathematics 1:10. 1962. Hierholzer, C. (1873), 'Ueber die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren', Mathematische Annalen, 6 (1): 30–32, doi:10.1007/BF01442866. Holland, J. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, Michigan. 1975. ISBN 0-262-58111-6. Kruskal, J. B. (1956). 'On the shortest spanning subtree of a graph and the traveling salesman problem.' Proceedings of the American Mathematical Society. 7 (1): 48–50. doi:10.1090/S0002-9939-1956-0078686-7. JSTOR 2033241. Lawler, E. L. (1985). The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization (Repr. with corrections. ed.). John Wiley sons. ISBN 978-0471904137. Love, R. F., J. G. Morris and G. O. Wesolowsky (1988). 'Facilities location.' Chapter 3: 51-60. Owen, S. H. and M. S. Daskin (1998). 'Strategic facility location: A review.' European journal of operational research 111(3): 423-447. Perl, J. and M. S. Daskin (1985). 'A warehouse location-routing problem.' Transportation Research Part B: Methodological 19(5): 381-396. Toregas, C., R. Swain, C. ReVelle and L. Bergman (1971). 'The location of emergency service facilities.' Operations Research 19(6): 1363-1373. Weber, A. Theory of the Location of Industries. 1909. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/60494 | - |
dc.description.abstract | 區域途程問題在生活中無所不在,不同於過去,現在電子商務的形式以更多元方式發生,這也歸功於平台和共享經濟的普及,任何人都可以是平台的供應者和需求者,在平台的幫助下,使得人們更加容易被連結在一起來促進供需雙方的媒合。過去只有企業需要思考如何有效的將產品送達客戶的手中,現在所有人都可以是供給方,路徑問題在日後可以有更廣泛的應用,應該找到一個具時間效率的方式來求得最佳的途程,路徑又可以是各種形式,可以是多重的路徑也可以是對稱或非對稱。 面對多樣的路徑問題,以基因演算法來解決這些問題,只要稍微的修改基因解碼的路徑定義即可以容易的應用在所有途程。基因演算法的運算速度完全取決於是否可以對每個步驟提出有效的演算法,我們也在這篇論文中提到每個細節給予建議,像是動態規劃的應用和參數的設定,基因的生成數與疊代次數則要根據實際碰到的資料而定。從一些實證的資料來看,基因演算法應用在途程問題是相當方便且有許多改進的空間。 | zh_TW |
dc.description.abstract | The problem of location routing is ubiquitous. Today, the form of e-commerce occurs more diversely. It is due to the popularity of platforms and sharing economy. Anyone can be a supplier and a demander of different open platforms of his choice. Thus, it is easier for people to be linked together to promote the match between supply and demand. In the past, only companies had to consider the question of how to effectively deliver products to customers. However, now anyone can be a supplier, so the problem of routing will be more widely used in the future. It should be essential to use a time-efficient way to search for the optimal route. Routes can take various forms, such as multiple, symmetry, and asymmetry. There are various path problems, and genetic algorithms are applied to solve those problems. Gene decoding can be modified to be easily applied to different forms of routes. The speed of genetic algorithm depends on whether an effective algorithm can be proposed for each step. We also mentioned the details in the algorithm to give advice such as the application of dynamic programming and settings of parameters. The number of initial chromosomes and the number of iterations are still based on the actual data. From some empirical data, the application of genetic algorithms to the problem of routing is quite suitable and there is much room to improve. | en |
dc.description.provenance | Made available in DSpace on 2021-06-16T10:19:42Z (GMT). No. of bitstreams: 1 U0001-0507202019375400.pdf: 1822784 bytes, checksum: c36a6d2fdf4e07552233855cff61d904 (MD5) Previous issue date: 2020 | en |
dc.description.tableofcontents | 口試委員會審定書 # 誌謝 i 中文摘要 ii ABSTRACT iii CONTENTS iv LIST OF FIGURES vi LIST OF TABLES vii Chapter 1 Introduction 1 1.1 Background and Motivation 1 1.2 Objectives 2 1.3 Organization 3 Chapter 2 Related Works 4 2.1 Facility Location Problem (FLP) 4 2.2 Travel Salesman Problem (TSP) 5 2.3 Vehicle Routing Problem with Time Window (VRPTW) 7 2.3.1 Savings Method 7 2.3.2 Ant Colony Optimization Algorithms 9 2.3.3 Genetic Algorithms 9 Chapter 3 Methodology 12 3.1 Problem Description 12 3.2 Assumption 14 3.3 Model Formulation 15 3.3.1 Facility Location Problems 17 3.3.2 Vehicle Routing Problem with Time Window 19 Chapter 4 Experiments 26 4.1 Dataset 26 4.2 Location Routing Problem 28 4.2.1 Facility Location Problem 28 4.2.2 Vehicle Routing Problem with Time Window 30 4.3 Result Analysis 34 Chapter 5 Conclusion and Suggestion 35 5.1 Conclusion 35 5.2 Contributions 35 5.3 Limitations 35 5.4 Suggested Further Works 36 REFERENCE 37 | |
dc.language.iso | en | |
dc.title | 基因演算法應用於B2C電子商務配送模型 | zh_TW |
dc.title | B2C E-commerce Distribution Model Using Genetic Algorithm | en |
dc.type | Thesis | |
dc.date.schoolyear | 108-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 郭人介(Ren-Jieh Kuo),林我聰(Woo-Tsong Lin) | |
dc.subject.keyword | B2C電子商務物流,區位途程問題,基因演算法,動態規劃, | zh_TW |
dc.subject.keyword | B2C e-commerce logistics,location routing problem,genetic algorithm,dynamic programming, | en |
dc.relation.page | 39 | |
dc.identifier.doi | 10.6342/NTU202001323 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2020-07-27 | |
dc.contributor.author-college | 管理學院 | zh_TW |
dc.contributor.author-dept | 商學研究所 | zh_TW |
顯示於系所單位: | 商學研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
U0001-0507202019375400.pdf 目前未授權公開取用 | 1.78 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。