簡易檢索 / 詳目顯示

回結果列表
研究生： 由沃诺
Yuwono - Ario Nugroho
論文名稱： 基植於模擬退火法的逆物流管理-以印尼工業園區廢棄物回收為例
Reverse Logistics Management based on the Simulated Annealing - A Case Study on Industry Park Waste in Indonesia
指導教授： 羅士哲
Shih-Che Lo
口試委員: 林希偉
Shi-Woei Lin
蔡鴻旭
Hung-Hsu Tsai
欢教授
Mabel Chou
學位類別： 碩士
Master
系所名稱： 管理學院 - 工業管理系
Department of Industrial Management
論文出版年： 2014
畢業學年度： 102
語文別： 英文
論文頁數： 67
中文關鍵詞： 車輛運途問題 、模擬退火法 、掃描法 、逆物流 、工業園區
外文關鍵詞： sw
相關次數： 點閱：284  下載：8 
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

    • 廢棄物回收問題可以用具產能限制的車輛運途問題建構模型，以於一些限制之下，找出最有效運輸路徑，以找到最小的總成本。我們用混合式模擬退火法去求解產能限制的車輛運途問題，此方法是結合掃描法與模擬退火法。我們將第一階段掃描法的結果作為第二階段模擬退火法的初始解。模擬退火演算法使用三種區域搜尋運算子，包含兩點交換、兩區交換和插入運算子。然後，實驗的結果將會與基因演算法做比較，已呈現混合式模擬退火法的演算效能。
    本研究用混合模擬退火法去計算23個標竿問題，以調查混合模擬退火法的績效。計算的結果顯示，不管在平均改善率，或在最低改善率，混合模擬退火法的表現都比基因演算法好。另外我們以包含大雅加達地區的21個工業園區做為案例研究分析，其中包含雅加達、貝卡希、茂物、坦格朗、加拉橫、普哇加達等地區。混合模擬退火法與基因演算法的結果，均整合了兩條運輸路徑，其總距離為524.8公里。

    The waste collecting problem can be modeled by using the Capacitated Vehicle Routing Problem (CVRP), which is concerned with finding efficient routes of minimum total cost subject to some constraints. We use the Hybrid SA which is a combination of the sweep method and the SA. The result from the sweep algorithm will be used as an initial route input for the SA. The SA itself will use three local search operators, including 2-opt, swap and insert operators. Then, the final result will be compared with the Genetic Algorithm to show the performance of the hybrid SA compares with another metaheuristic.
    Total 23 benchmark problems have been calculated to investigate the performance of the proposed Hybrid SA method. The computational results showed that the solution of the Hybrid SA was able to perform better than the GA, either in average improvement rate and lowest improvement rate. A case study with 21 industrial parks in the Greater Jakarta area was investigating as field survey. The area includes some cities such as Jakarta, Bekasi, Bogor, Tanggerang, Karawang, and Purwakarta. Both the Hybrid SA and the GA calculations generate two routes which the total distance is 524.8 kilometers.

    摘要 ABSTRACT TABLE OF CONTENT CHAPTER 1 INTRODUCTION 1.1. Research Motivation 1.2. Objectives 1.3. Research Structure CHAPTER 2 LITERATURE REVIEW 2.1. The Vehicle Routing Problem 2.2. Solution Methods for the VRP 2.2.1. Exact Algorithm 2.2.2. Classical Heuristics 2.2.3. Metaheuristics 2.3. The Simulated Annealing 2.4. Waste Management and Reverse Logistics CHAPTER 3 PROBLEM FORMULATION AND THE HYBRID SIMULATED ANNEALING 5.1. Problem Proposition 5.2. The Sweep Method 5.3. The Simulated Annealing 3.3.1. Solution Representation 3.3.2. Local Search 3.3.3. The Parameters 3.3.4. The SA Procedure 5.4. Parameter Setting for the GA CHAPTER 4 COMPUTATIONAL RESULTS CHAPTER 5 CASE STUDY 5.1. Industrial Waste Collecting Problem As A Part of Reverse Logistic In Indonesia 5.2. The Industrial Parks in the Greater Jakarta Area 5.3. Industrial Waste Collecting Problem Model 5.4. Computational Results CHAPTER 6 CONCLUSIONS 5.5. Conclusions 5.6. Further Research REFERENCES APPENDIX A: The solution of the Hybrid SA for instance E-n33-k4 APPENDIX B: The solution of the Hybrid SA for instance E-n76-k8 APPENDIX C: The solution of the Hybrid SA for instance E-n101-k14

    Baker, B.M. and Ayechew, M.A., 2003. A genetic algorithm for the vehicle routing problem. Computers & Operations Research 30, 787–800.
    Bell, J.E. and McMullen P.R., 2004. Ant colony optimization techniques for the vehicle routing problem, Advanced Engineering Informatics 18, 41–48.
    Berger, J. and Barkaoui, M., 2004. A parallel hybrid genetic algorithm for the vehicle routing problem with time windows, Computers & Operations Research 31, 2037–2053.
    Barros, A.I., Dekker, R., Scholten, V., 1998. A two-level network for recycling sand: a case study, European Journal of Operations Research 110, 199–214.
    Benjamin, A.M., and Beasley, J.E., 2010. Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities, Computers & Operations Research 37, 2270–2280.
    Buhrkal, K., Larsen, A., and Ropke, S., 2012. The waste collection vehicle routing problem with time windows in a city logistics context, Procedia - Social and Behavioral Sciences 39, 241 – 254.
    Caric, T. and Gold, H., 2008. Vehicle Routing Problem, I-Tech Education and Publishing KG, Vienna, Austria.
    Carter, C.R. and Ellram, L.M., 1998. Reverse logistics: a review of the literature and framework for future investigation, Journal of Business Logistics 19 (1), 85–102.
    Christofides, N. and Eilon, S., 1969. An algorithm for the vehicle dispatching problem, Operational Research Quarterly 20, 309-318.
    Christofides, N., Mingozzi, A. and Toth, P., 1981. Exact algorithms for the vehicle routing problem, based on spanning tree shortest path relaxations, Mathematical Programming 20, 255-282.
    Dantzig, G.B. and Ramser, J.H., 1959. The truck dispatching problem, Management Sceinece 6, 80-91.
    Dreo, J., Siarry, P., Petrowski, A., and Taillard, E., 2003. Metaheuristics for Hard Optimization.Springer-Verlag Berlin Heidelberg.
    Eilon, S., Watson-Grandy, C.D.T. and Christofides, N., 1971. Distribution Management: Mathematical Modelling and Practical Analysis. Griffin, London.
    Fisher, M and Jaikumar, R., 1981. A generalized assignment heuristic for vehicle routing, Networks 11, 109-124.
    Fleischmann, M., Bloemhof-Ruwaard, J.M., Dekker, R., Van Der Laan, E., Van Nunen, J.A.E.E., Van Wassenhove, L.N., 1997. Quantitative models for reverse logistics: a review, European Journal of Operational Research 103, 1–17.
    Ghaffari-Nasab, N.S., Ahari.G., and Ghazanfari, M., 2012. A hybrid simulated annealing based heuristic for solving the location-routing problem with fuzzy demands, Scientia Iranica 20 (3), 919–930.
    Gillett, B.E and Miller, L.R., 1971. A heuristic algorithm for the vehicle dispatch problem, Operations Research 22, 340-349.
    Hemmelmayr, V.C., Doerner, K.F., Hartl. R.F., 2007. A variable neighborhood search heuristic for periodic routing problems, European Journal of Operational Research 195, 791–802.
    Hu, T.L., Sheu, J.B, Huang, K.H., 2002. A reverse logistics cost minimization model for the treatment of hazardous wastes, Transportation Research Part E 38, 457–473.
    Jahre, M., 1995. Household waste collection as a reverse logistics channel: a theoretical perspective, International Journal of Physical Distribution and Logistics Management 25 (2), 39–55.
    Johnson, M.R., Wang, M.H., 1995. Planning product disassembly for material recovery opportunities, International Journal of Production Research 33 (11), 3119–3142.
    Kim, H., Yang, J., and Lee, K.D., 2009. Vehicle routing in reverse logistics for recycling end-of-life consumer electronic goods in South Korea, Transportation Research Part D 14, 291–299.
    Kirkpatrick, S., Gelatt, C. D., Jr., and Vecchi M. P., 1983. Optimization by simulated annealing, Science 220, 4598.
    Kuo, R.J., Zulvia, F.E., and Suryadi, K., 2012. Hybrid particle swarm optimization with genetic algorithm for solving capacitated vehicle routing problem with fuzzy demand– A case study on garbage collection system, Applied Mathematics and Computation 219, 2574–2588.
    Kytojoki, J., Nuortio, T., Braysy, O., Gendreau, M., 2007. An efficient variable neighborhood search heuristic for very large scale vehicle routing problems, Computers & Operations Research 34, 2743 – 2757.
    Laporte, G., 2009. Fifty years of vehicle routing. Transportation Science 01, 43, 408-416.
    Little, J.D.C, Murty, K.G., Sweeney, D.W. and Karel, C., 1963. An algorithm for the travelling salesman problem, Operations Research 11, 972-989.
    Lin, S. and Kernighan, B., 1973. An effective heuristic algorithm for the traveling salesman problem, Operation Research 21, 498–516.
    Lin, S.W., Yu, V.F., and Chou, S.Y., 2008. Solving the truck and trailer routing problem based on a simulated annealing heuristic, Computers & Operations Research 36, 1683 – 1692.
    Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E., 1953. Equation of state calculation by fast computing machines, The Journal of Chemical Physics 21, 1087-1091.
    Nikolaev, Alexander G. and Jacobson, S.H., 2010. Simulated annealing, International Series in Operations Research & Management Science 146, 1-40.
    Osman, I.H. and Christofides, N., 1994. Capacitated clustering problems by hybrid simulated annealing and tabu search. International Transportation Operation Research 1 (3), 317-336.
    Penev, K.D., de Ron, A.J., 1996. Determination of a disassembly strategy, International Journal of Production Research 34 (2), 495–506.
    Pohlen, T.L., Farris II, M.T., 1992. Reverse logistics in plastics recycling, International Journal of Physical Distribution and Logistics Management 22 (7), 35–47.
    Renaud, J., Laporte, G., and Boctor, F.F., 1996. A tabu search heuristic for the multi-depot vehicle routing problem, Computational Operation Research 23, 229–235.
    Richter, K., 1996. The extended EOQ repair and waste disposal model, International Journal of Production Economics 45 (1–3), 443–448.
    Salazar, R. and Toral R., 1996. Hybrid simulated annealing. The proceedings of the Euroconference: Supercomputation in Nonlinear and Disordered System: Algorithms, Applications and Architectures1996.
    Schrady, D.A., 1967. A deterministic inventory model for repairable items, Naval Research Logistics Quarterly 14,391–398.
    Spengler, T., Puckert, H., Penkuhn, T., Rentz, O., 1997. Environmental integrated production and recycling management, European Journal of Operations Research 97, 308–326.
    Suthikarnnarunai, N., 2008. A sweep algorithm for the mix fleet vehicle routing problem, Proceedings of the International Multi Conference of Engineers and Computer Scientists 2008 (III), Hong Kong.
    Tavakkoli-Moghaddam, R., Safaei, N., Kah, M.M.O. and Rabbani, M., 2005. A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing, Journal of the Franklin Institute 344, 406–425.
    Tavakkoli-Moghaddam, R., Safaei, N., and Gholipour, Y., 2005. A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length, Applied Mathematics and Computation 176, 445–454.
    Thangiah, S.R., Osman, H. and Sun, T., 1999. A hybrid genetic algorithms, simulated annealing and tabu search heuristic for vehicle routing problems with time windows, Practical Handbook of Genetic Algorithms, Volume III: Complex Structures, L. Chambers (Ed.), CRC Press, 347-381.
    Twardowska, I., Allen H.C., Kettrup,A.A.F., Lacy.W.J., 2004. Solid Waste: Assessment, Monitoring and Remediation. Elsevier, United Kingdom.
    Wu, J. and Tan, Y., 2009. A Particle swarm optimization algorithm for grain logistics vehicle routing problem, ISECS International Colloquium on Computing, Communication, Control, and Management, Sanya.
    Yu, V.F., Lin, S.W., Lee, W., and Ting, C.J., 2009. A simulated annealing heuristic for the capacitated location routing problem, Computers & Industrial Engineering 58, 288–299.

    QR CODE