簡易檢索 / 詳目顯示

回結果列表
研究生： 陳英顏
Chen, Ying-Yen
論文名稱： 特定時窗下配送與撿收問題之研究
A Study on Delivery and Pickup Problems with Time Windows
指導教授： 王小璠
Wang, Hsiao-Fan
口試委員: 溫于平
顏上堯
姚銘忠
張國華
學位類別： 博士
Doctor
系所名稱： 工學院 - 工業工程與工程管理學系
Department of Industrial Engineering and Engineering Management
論文出版年： 2012
畢業學年度： 100
語文別： 英文
論文頁數： 104
中文關鍵詞： 車輛途程 、時窗 、配送與撿收 、確定與不確定狀況 、機會限制型規劃 、可信賴度 、共演化演算法
外文關鍵詞： Vehicle routing, Time windows, Delivery and pickup, Certain and uncertain environment, Chance constrained programming, Credibility measure, Coevolutionary algorithm
相關次數： 點閱：1  下載：0 
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

    • 由於環境保育意識的抬頭，具有環保意識的綠色產業愈來愈顯得重要，這些綠色產業包括有回收、拆解、再利用及再製造等產業。相對的，逆物流在這當中也扮演了重要角色。新近，將正向物流系統及逆向物流系統整合成一個雙向物流系統已經愈來愈普遍了，也因此特定時窗下配送與撿收問題逐漸受到了關注與重視。
    針對特定時窗下配送與撿收問題本研究檢視了三個現行主要的物流策略及其衍生而出的物流架構。其中，「特定時窗下同時配送與撿收問題」缺乏適切的規劃模式與問題集，本研究特別針對其特性探討。本研究更進一步提出兩個更一般性的架構：「特定時窗下彈性配送與撿收問題」及「特定時窗下模糊彈性配送與撿收問題」。
    針對上述的三種問題，本研究提出了對應的數學規劃模式並以Cplex軟體驗證之，同時產生了適切的問題集以利各種問題之進一步分析。在觀察了問題的特性後，本研究發展了一套共演化演算法來求解這些問題集。經過了大量的運算試驗後，發現共演化演算法在準確度及效率上皆有相當優異的表現。
    另外，本研究針對四個確定性的架構進行了比較性的探討，發現「特定時窗下彈性配送與撿收問題」架構最彈性、最有效率而且也最經濟。至於不確定性的架構，本研究藉由運用一個以可信賴度為基礎之機會限制型規劃模式，發現不同類型的決策者可以選用不同的信心水準進而找出其最適切之解決方案。

    Reverse logistics plays an important role in environmental conscious manufacturing, including recycling, disassembly, reuse, and remanufacturing. Integrating a forward logistic system and a reverse logistic system to form a bi-directional logistic system hence becomes significant. Subsequently, the Delivery and Pickup Problems with Time Windows (DPPTWs) has drawn much attention.
    Three current DPPTW schemes derived from the three main logistic strategies were reviewed in this study. Among them, the Simultaneous Delivery and Pickup Problem with Time Windows (SDPPTW) lacked for an appropriate model and appropriated test problems; thus, it was investigated first in this study. Then, two more general schemes: the Flexible Delivery Pickup Problem with Time Windows (FDPPTW) and the Fuzzy Flexible Delivery Pickup Problem with Time Windows (FFDPPTW) were thoroughly studied.
    For these problems, the corresponding mathematical models were proposed and validated by Cplex. Since they are NP-hard, the solution procedures entitled Coevolutionary Algorithms (CEAs) were developed for solving the generated test problems. The computational results reveal the excellent effectiveness and efficiency of the developed CEAs. Moreover, a comparative study on crisp schemes shows that the FDPPTW is the most flexible, efficient, and economical scheme for certain environment. For the uncertain case, the FFDPPTW based on a credibility measure was proposed in the form of the Chance Constrained Programming Model to facilitate the decision support based on the decision maker’s preference.

    ABSTRACT i 中 文 摘 要 iii TABLE CAPTIONS ix FIGURE CAPTIONS xi LIST OF NOTATIONS xiii Chapter 1 INTRODUCTION 1 1.1 Background of the Delivery and Pickup Problems 2 1.2 Motivation and Purposes 3 1.3 Framework of the Dissertation 6 Chapter 2 LITERATURE REVIEW 9 2.1 Delivery and Pickup Problems 9 2.2 Delivery and Pickup Problems with Time Windows 11 2.3 Fuzzy Vehicle Routing Problems 13 2.4 Fuzzy Credibility Theory 15 2.5 Evolutionary Algorithms 18 2.6 Summary and Conclusion 21 Chapter 3 ISSUES AND THE PROPOSED MODELS 25 3.1 Fuzzy Flexible Delivery and Pickup Problem with Time Windows (FFDPPTW) 25 3.1.1 Problem Description of the FFDPPTW 25 3.1.2 The Proposed Model of the FFDPPTW 28 3.1.3 Summary and Discussion of the FFDPPTW 33 3.2 Special Case 1: Flexible Delivery and Pickup Problem with Time Windows (FDPPTW) 34 3.2.1 Problem Description of the FDPPTW 35 3.2.2 The Proposed Model of the FDPPTW 36 3.2.3 Summary and Discussion of the FDPPTW 37 3.3 Special Case 2: Simultaneous Delivery and Pickup Problem with Time Windows (SDPPTW) 38 3.3.1 Problem Description of the SDPPTW 38 3.3.2 The Proposed Model of the SDPPTW 40 3.3.3 Summary and Discussion of the SDPPTW 42 3.4 Summary and Discussion 43 Chapter 4 THE PROPOSED SOLUTION PROCEDURE – COEVOLUTIONARY ALGORITHM 45 4.1 Framework of the Coevolutionary Algorithm 45 4.2 Encoding 47 4.3 Initial Population 47 4.3.1 Cheapest Insertion Method 48 4.3.2 Multi-parameter Cheapest Insertion Method 49 4.3.3 Random Seeds Cheapest Insertion Method 50 4.3.4 Crossover 50 4.3.5 Construction of the Initial Population 51 4.4 Co-evolution 52 4.4.1 Reproducing 53 4.4.2 Recombination 54 4.4.3 Local Improvement 55 4.4.4 Crossover 56 4.4.5 Mutation 57 4.4.6 Selection 60 4.5 Termination Condition 61 4.6 Implementation and Analysis 62 4.6.1 Parameters for the SDPPTW 62 4.6.2 Factorial Experiments for the FDPPTW 64 4.6.3 Framework of the Algorithm for the FDPPTW and the FFDPPTW 65 4.7 Conclusion and Discussion 68 Chapter 5 NUMERICAL EXAMPLES AND EVALUATION 69 5.1 SDPPTW Test Problems 69 5.1.1 Evaluation of the Accuracy and Efficiency of CEA 70 5.1.2 Comparison between GA and CEA 71 5.2 FDPPTW Test Problems 74 5.2.1 Evaluation of the Accuracy and Efficiency of CEA 74 5.2.2 Comparison between SDPPTW and FDPPTW 75 5.3 FFDPPTW Test Problems 77 5.3.1 Evaluation of the Accuracy and Efficiency of CEA 77 5.3.2 Results of the Credibility Approach 80 5.4 Comparative Studies and Analysis 82 5.5 Conclusion and Discussion 88 Chapter 6 SUMMARY AND CONCLUSION 91 6.1 Summary of the Dissertation 92 6.2 Conclusion 93 6.3 Possible Future Work 94 REFERENCES 97 APPENDIX A 103

     Ai, T.J., Kachitvichyanukul, V., 2009. A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Computers and Operations Research, 36, 1693-1702.
     Alvarenga, G.B., Mateusb, G.R., De Tomi, G., 2007. A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Computers and Operations Research, 34, 1561-1584.
     Angelelli, E., Mansini, R., 2002. The vehicle routing problem with time windows and simultaneous pickup and delivery. In: Klose. A., Speranza, M.G., Van Wassenhove, L.N. (Eds.). Quantitative Approaches to Distribution Logistics and Supply Chain Management (Lecture Notes in Economics and Mathematical Systems). New York: Springer Press, 249-267.
     Berbeglia. G., Cordeau, J.F., Gribkovskaia, I., Laporte, G., 2007. Static pickup and delivery problems: a classification scheme and survey. TOP, 15, 1-31.
     Bianchessi, N., Righini, G., 2007. Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Computers and Operations Research, 34, 578-594.
     Brito, J., Martínez, F.J., Moreno, J.A., Verdegay, J.L. 2009. A GRASP–VNS Hybrid for the fuzzy vehicle routing problem with time windows. Lecture Notes in Computer Science, 5717, 825-832.
     Cao, E., Lai, M., 2009. A hybrid differential evolution algorithm to vehicle routing problem with fuzzy demands. Journal of Computational and Applied Mathematics, 231, 302-310.
     Chen, Y.-Y., Wang, H.-F. 2012. Delivery and pickup problems with time windows: strategy and modeling. In: Gupta, S.M. (Eds). To appear in Reverse Supply Chains: Issues and Analysis. CRC Press.
     Chen, J.-F., Wu, T.-H., 2006. Vehicle routing problem with simultaneous deliveries and pickups. Journal of the Operational Research Society, 57, 579-587.
     Cheung, R.K. and D.D. Hang. 2003. Multi-attribute label matching algorithms for vehicle routing problems with time windows and backhauls. IIE Transactions, 35, 191-205.
     Clarke, G., Wright. J.W., 1964. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12, 568-581.
     Crispim, J., Brandao, J., 2005. Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls. Journal of the Operational Research Society, 56, 1296-1302.
     Dell'Amico, M., Righini, G., Salani, M., 2006. A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection. Transportation Science, 40, 235-247.
     Dethloff, J., 2001. Vehicle routing and reverse logistics: the vehicle routing Problem with simultaneous delivery and pick-up. OR Spectrum, 23, 79-96.
     Dong, Y., Kitaoka, M., 2010. Two-stage model of vehicle routing problem with fuzzy demands and its ant colony system algorithm. Proceeding of the ninth international symposium on operations research and its applications. Dunhuang, China.
     Dubois, D. 1983. Unfair coins and necessity measures: Towards a possibilistic interpretation of histograms. Fuzzy Sets and Systems, 10 (1-3), 15-20.
     Duhamel, C., Potvin, J.-Y., Rousseau, J.-M., 1997. A tabu search heuristic for the vehicle routing problem with backhauls and time windows, Transportation Science, 31, 49-59.
     Gelinas, S., Desrochers, M., Desrosiers, J., Solomon, M.M., 1995. A new branching strategy for time constrained routing problems with application to backhauling. Annals of Operations Research, 61, 91-109.
     Gribkovskaia, I., Laporte, G., Shyshou, A., 2008. The single vehicle routing problem with deliveries and selective pickups. Computers and Operations Research, 35, 2908- 2924.
     Holland, J.H., 1975. Adaptation in Natural and Artificial Systems. Ann Arbor: University of Michigan Press.
     Hu, Z., Ding, Y., Shao, Q., 2009. Immune co-evolutionary algorithm based partition balancing optimization for tobacco distribution system. Expert Systems with Applications, 36, 5248-5255.
     Ilgin, M.A., Gupta, S.M., 2010. Environmentally conscious manufacturing and product recovery (ECMPRO): A review of the state of the art. Journal of Environmental Management, 91, 563-591.
     Kicinger, R., Khorrami, B., Prete, J., Penny, S., Myers, T., Hackney H., 2009. Robust traffic flow management: coevolutionary approach. Proceedings of 47th AIAA Aerospace Sciences Meeting Including The New Horizons Forum and Aerospace Exposition. Orlando, Florida
     Kim, S.-J., Choi, M.-K., 2007. Evolutionary algorithms for route selection and rate allocation in multirate multicast network. Applied Intelligence, 26, 197-215
     Kontoravdis, G., Bard, J., 1995. A GRASP for the vehicle routing problem with time windows. ORSA Journal on Computing, 7(1), 10-23.
     Liu, B. 2012. Uncertain theory. (4th ed.). Uncertainty Theory Laboratory. http://orsc.edu.cn/liu/ut.pdf
     Liu, Y.-K., Liu B. 2002. Random fuzzy programming with chance measures defined by fuzzy integrals. Mathematical and Computer Modelling, 36, 509-524.
     Maekly, H., Haddadi, B., Tavakkoli-Moghadam, R. 2009. A fuzzy random vehicle routing problem: the case of Iran. Proceeding of the 39th International Conference on Computers and Industrial Engineering. Troyes, France.
     Mester, D., Bräysy, O., Dullaert, W., 2007. A multi-parametric evolution strategies algorithm for vehicle routing problems. Expert Systems with Applications, 32, 508-517.
     Min, H., 1989. The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transportation Research A, 23(5), 377-386.
     Mingozzi, A., Giorgi, S., 1999. An exact method for the vehicle routing problem with backhauls. Transportation Science, 33(3), 315-329.
     Montané, F.A.T., Galvao, R.D., 2006. A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Computers and Operations Research, 33(3); 595-619.
     Nagy, G., Salhi, S., 2005. Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. European Journal of Operational Research, 162(1), 126-141.
     Nahmias, S. 1978. Fuzzy variables. Fuzzy Sets and Systems, 1, 97-110.
     Osman I., 1993. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems. Annals of Operations Research, 41, 421-451.
     Peng, Y., Qian, Y., 2010. A particle swarm optimization to vehicle routing problem with fuzzy demands. Journal of Convergence Information Technology, 5(6), 112-119.
     Polat, L., Acan, A., Unveren, A., 2007. Cooperative coevolutionary algorithms for fuzzy vehicular routing problem: an analysis of efficiency vs. geographical distribution. Proceedings of the 2007 IEEE Congress on Evolutionary Computation. Singapore.
     Reimann, M., Doerner, K., Hartl, R.F., 2002. Insertion based ants for vehicle routing problems with backhauls and time windows. Lecture Notes in Computer Science, 2463, 135-148.
     Rezaee, A., 2009. Using of coevolutionary algorithm on p2p networks. Serbian journal of electrical engineering, 6, 43-55.
     Ropke, S., Pisinger, D., 2006. A unified heuristic for a large class of vehicle routing problems with backhauls. European Journal of Operational Research, 171, 750-775.
     Solomon, M.M., 1987. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35(2), 254-265.
     Thangiah, S.R., Potvin, J.-Y. Sun, T. 1996. Heuristic approaches to vehicle routing with backhauls and time windows, Computers and Operations Research, 23, 1043-1057.
     Tütüncüa, G.Y., Carreto, C.A.C., Baker, B.M., 2009. A visual interactive approach to classical and mixed vehicle routing problems with backhauls. Omega, 37, 138-154.
     Wade, A.C., Salhi, S., 2002. An investigation into a new class of vehicle routing problem with backhauls. Omega, 30, 479-487.
     Wang, H.-F., Chen, Y.-Y. 2012. A genetic algorithm for the simultaneous delivery and pickup problems with time window. Computers and Industrial Engineering, 62, 84-95.
     Wang, H.-F., Chen, Y.-Y. 2012. A coevolutionary algorithm for the flexible delivery and pickup problem with time windows. To appear in International Journal of Production Economics.
     Wang, H.-F., Chen, Y.-Y. 2012. Fuzzy credibility approach to the fuzzy flexible delivery and pickup problem with time windows. Submitted to European Journal of Operational Research.
     Wang H.-F., Hsu, H.-W., 2010. A closed-loop logistic model with a spanning-tree based genetic algorithm. Computers and Operations Research, 37( 2), 376-389.
     Xu, J., Goncalves, G., Hsu, T. 2008. Genetic algorithm for the vehicle routing problem with time windows and fuzzy demand. Proceeding of 2008 IEEE Congress on Evolutionary Computation. Hong Kong, China.
     Zadeh, L.A. 1978. Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets and Systems, 1, 3-28.
     Zhong, Y., Cole M.H., 2005. A vehicle routing problem with backhauls and time windows: a guided local search solution. Transportation Research Part E, 41, 131-144.

    無法下載圖示 全文公開日期 本全文未授權公開 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)

    QR CODE