考慮回程撿收之設施位址－車輛途程問題演算法之研究 陳信宏、吳泰熙
E-mail: 9018614@mail.dyu.edu.tw
摘 要
由於傳統設施區位-車輛途程問題應用範圍非常的廣泛但過去之研究並沒有考慮回程取貨方面之問題，如此將平白浪費了 派車及運輸成本，而且與實際情況不符。本研究將針對此點而發展一可考慮回程撿收之設施區位-車輛途程問題之啟發式 演算法以改正其缺點。 由於考慮回程撿收之設施區位-車輛途問題乃以傳統之設施區位-車輛途程問題為基礎，所以本研究 將會先發展一優良之傳統型設施區位-車輛途程問題演算法，再以此為基礎整合車輛途程含回程取貨問題發展一可考量回 程撿收之設施區位-車輛途程問題的啟發式演算法。 本研究採用白俊偉[1]之將區位-途程問題分為三部份：(1)設施區位問題
、(2)車輛途程問題及(3)途程重新指派問題為基礎發展傳統型之區位-途程問題演算法，並與過去文獻結果做一比較。進而將 其中第二部份之車輛途程問題改為徐俊誠[6]之改良型車輛途程含回程取貨問題整合成為可考量回程取貨之區位-途程問題 之啟發式演算法。本演算法具有可同時處理送貨及取貨需求且沒有傳統先送貨後取貨順序之限制，將更能符合實情。
關鍵詞 : 設施區位-車輛途程問題、設施區位問題、車輛途程問題。
目錄
第一章 緒論--P1 1.1 研究背景與動機--P1 1.2 研究目的--P3 1.3 研究內容及流程--P4 第二章 文獻回顧--P7 2.1 設施區位問 題--P7 2.2 車輛途程問題--P8 2.3 車輛途程含回程取貨問題--P11 2.4 區位-途程問題--P12 2.5 模擬退火法--P17 2.5.1 Metroplis 演算法--P17 2.5.2 模擬退火演算法--P18 2.6 小結--P21 第三章 考慮回程撿收之設施位址-車輛途程問題求解--P22 3.1 問題定 義--P22 3.1.1 傳統型設施位址-車輛途程問題--P22 3.1.2 考慮回程撿收之設施位址-車輛途程問題--P24 3.2 傳統型設施位址-車 輛途程問題演算法--P26 3.2.1 區位分派模式--P31 3.2.2 車輛途程模式--P38 3.2.3 途程重新指派問題--P44 3.3 考慮回程撿收之 設施位址-車輛途程問題演算法--P45 3.3.1 區位問題(LAP)之修改部份--P46 3.3.2 車輛途程含回程取貨問題--P46 3.4 模擬退火 法參數及禁忌名單--P50 3.5 停止準則--P50 第四章 演算結果及分析--P51 4.1 演算例題描述--P51 4.1.1 傳統型設施區位-車輛 途程例題--P51 4.1.2 考慮回程撿收之設施區位-車輛途程例題--P54 4.2 傳統型設施區位-車輛途程之演算結果--P54 4.3 考慮回 程撿收之設施區位-車輛途程之演算結果--P55 第五章 結論與建議--P60 5.1 結論--P60 5.2 建議--P61 參考文獻--P62 附錄 一--P70 附錄二--P72
參考文獻
[ 1]白俊偉，"隨機型區位-途程問題解法之研究"，私立大葉大學工業工程研究所，碩士學位論文，民 國八十八年七月。
[ 2]李宗儒、翁基華，"具工作負荷平衡支配送車輛途程問題"，運輸學刊，11，59-72 (1999)。
[ 3]林明俊，"隨機環境下多車種配車問題之研究"，私立中原大學工業工程研究所，碩士學位論文，民 國八十七年六月。
[ 4]施鵬展，"以區位模式輔助郵局區位決策分析之研究"，交通大學交通運輸研究所，碩士學位論文， 民國八十年。
[ 5]阮如芸，"捷運站與接駁車站多目標區位選擇之研究"，交通大學交通運輸研究所，碩士學位論文， 民國八十三年。
[ 6]徐俊誠，"車輛途程含取貨問題解法之研究"，私立大葉大學工業工程研究所，碩士學位論文，民國 八十九年七月。
[ 7]張祖明，"多車種車輛路線問題啟發式解法之研究"，國立交通大學，土木工程研究所碩士論文，民 國八十二年六月。
[ 8]陳正元，"節省法與路線間交換改善法在車輛路線問題上之應用"，國立交通大學，土木工程研究所 碩士論文，民國八十一年六月。
[ 9]黃聖峰，"考量回程取貨之車輛途程問題"大葉大學工工所，民國八十八年六月 [10]郭振峰，"建立物流中心區位模式之研究"，國立成 功大學交通管理科學研究所，碩士學位論文，民 國八十三年六月。
[11]劉雅魁，"運用路線鄰域法求解車輛途程含回程取貨問題"國防管理學院資源管理所，民國八十七年 六月。
[12]鄭守志，"物流中心區位選擇模式之研究"，國立成功大學交通管理科學研究所碩士論文，民國83年 6月。
[13]韓復華、楊智凱、卓裕仁，"應用門檻接受法求解車輛路線問題之研究",運輸計劃季刊,26,253-280 (1997)。
[14]ALAN W. NEEBE, " A PROCEDURE FOR LOCATION EMERGENCY-SERVICE FACILITIES FOR ALL POSSIBL -E RESPONSE DISTANCE," J. OPL. RES.SOC., 39(8),743-748 (1988)。
[15]AVERBAKH, I.,AND O. BERMAN," ROUTING AND LOCATION-ROUTING P-DELIVERY MEN PROBLEM ON PATH,"
TRANSPORTATION SCIENCE, 28, 162-166(1994)。
[16]BARTHOLDI , J. J., AND L.K.PLATZMAN,"HEURISTICS BASED ON SPACE-FILLING CURVES FOR COMB -INATORIAL PROBLEMS IN EUCLIDEAN SPACE," MANAGEMENT SCIENCE, 34, 291-305(1988)。
[17]BERMAN, O., JAILLET, P., SIMCHI-LEVI, D., "THE STOCHASTIC VEHICLE ROUTING PROBLEM REVISITED, "
LOCATION-ROUTING PROBLEMS WITH UNCERTAINTY," SPRINGER-VERLAG, NEW YORK, NY, 427-453 (1995)。
[18]BODIN , L., AND B. GOLDEN, " CLASSIFICATION IN VEHICLE ROUTING AND SCHEDULING," NETWOR -KS,11,97-108(1981)。
[19]BOOKBINDER, J.H., AND K.E. REECE, "VEHICLE ROUTING CONSIDERATIONS IN DISTRIBUTION SYST -EM DESIGNS,"
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,37,204-213(1988)。
[20]BRAMEL, J., AND D. SIMCHI-LEVI, "A LOCATION BASED HEURISTIC FOR GENERAL ROUTING PROBLE -MS,"
OPERATIONS RESEARCH, 43,649-660(1995)。
[21]BRANDAO, J. ,AND A. MERCER, "A TABU SEARCH ALGORITHM FOR THE MULTI-TRIP VEHICLE ROUTING AND SCHEDULING PROBLEM," EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,100,180-191(1997)。
[22]BREEDAM, V.A., "IMPROVEMENT HEURISTICS FOR THE VEHICLE ROUTING PROBLEM BASED ON SIMULA -TED ANNEALING," EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,86, 80-190(1995)。
[23]CHRISTOFIDES, N. AND S.EILON,"AN ALGORITHM FOR THE VEHICLE DISPATCHING PROBLEM," OPER -ATIONAL RESEARCH QUARTERLY ,20 ,309-318 (1969)。
[24]CLARKE, G., AND J.W. WRIGHT, "SCHEDULING OF VEHICLES FROM A CENTRAL DEPOT TO A NUMBER -OF DELIVERY POINTS," OPERATIONS RESEARCH, 12,568-581(1964)。
[25]DANIEL, O. C., GOLDEN, B. L., AND EDWARD, A.W.,"VEHICLE ROUTING WITH BACKHAULS: MODELS , ALGORITHMS AND CASE SSTUDIES,"VEHICLE ROUTING:METHODS AND STUDIES, B.L. GOLDEN AND A.A. ASSAD(EDITORS), (1988)。
[26]DANTZIG, G. AND J. H. RAMSER,"THE TRUCK DISPATHING PROBLEM," MANAGEMENT SCIENCE, 6, 80 -91 (1959)。
[27]DEIF, I. AND BODIN, L.,"EXTENSION OF THE CLARKE AND WRIGHT ALGORITHM FOR SOLVING THE VEHICLE ROUTING PROBLEM WITH BACKHAULING,"IN PROCEEDINGS OF THE BABSON CONFERENCE ON SOFEWARE USE IN TRANDPORTATION AND LOGISTIC MANAGEMENT, A.E.KIDDER, BABSON PRAK, MA, 75-96(1984)。
[28]DUHAMEL C, POTVIN J, ROUSSEAU J, "A TABU SEARCH HEURISTIC FOR THE VEHICLE ROUTING PRO -BLEM WITH BACKHAULS AND TIME WINDOWS," TRANSPROTATION SCIENCE, 31,49-59, (1997)。
[29]FISHER, M., "VEHICLE ROUTING,"HANDBOOK IN OPERATIONS RESEARCH AND MANAGEMENT SCIENCE. (1995)。
[30]FISHER, M. L. AND R. JAIKUMAR, "A GENERALIZED ASSIGNMENT HEURISTIC FOR VEHICLE ROUTING PROBLEMS,"
NETWORKS, 11,109-124 (1981)。
[31]GENDREAU, M., HERTZ A, LAPORTE G, "A TABU SEARCH HEURISTIC FOR THE VEHICLE ROUTING PRO BLEM,"
MANAGEMENT SCIENCE, 40, 1276-1290, (1994)。
[32]GILLETT ,B.E. AND L.R.MILLER,"A HEURISTIC ALGORITHM FOR THE VEHICLE-DISPATCH PROBLEM," OPERATIONS RESEARCH ,22,340-349 (1974)。
[33]GOETSCHALCKX, M. AND JACOBS-BLECHA, C.,"THE VEHICLE ROUTING PROBLEM WITH BACKHAULS,"EU -ROPEAN JOURNAL OF OPERATIONAL RESEARCH, 42, 39-51 (1989)。
[34]GOLDEN, B., A. ASSAD, L. LEVY AND F. GHEYSENS,"THE FLEET SIZE AND MIX VEHICLE ROUTING PROBLEM,"
COMPUT & OPS RES. ,11,49-66 (1984)。
[35]GOLDEN,B.L.,T.L. MAGNANTI,AND H.Q. NGUYEN, "IMPLEMETING VEHICLE ROUTING ALGORITHMS,", NETWORKS,7,113-148(1977)。
[36]GOLDEN, E.B., ALFARO, J. AND SCHAGGER, J., "THE VEHICLE ROUING PROBLEM WITH BACKHAULLI -NG:TWO APPROACHES,"PROCEEDINGS OF THE XII ANNUAL MEETING OF S.E.TIMS, MYRTLE BEACH, S.C, 90-92 (1985)。
[37]HANSEN , P.H., B. HEGEDAHL , S. HJORTKJAR,AND B. OBEL, "A HEURISTIC SOLUTION TO THE WA -REHOUSE LOCATION-ROUTING PROBLEM," EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,76,111-12 7(1994)。
[38]HASAN PIRKUL AND DAVID A. SCHILLING, "THE SITING OF EMERGENCY SERVICE FACILITY WITH WORKLOAD CAPACITIES AND BACKUP SERVICE," MANAGEMENT SCIENCE, 34(7), (1988)。
[39]HOKEY MIN, VAIDYANATHAN JAYARAMAN, RAJESH SRIVASTAVA, "THE SITING OF EMERGENCY SERVICE FACILITY WITH WORKLOAD CAPACITIES AND BACKUP SERVICE," COMBINED LOCATION-ROUTING PRO -BLEMS : A SYNTHESIS AND FUTURE RESEARCH DIRECTIONS," EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 108, 1-15, (1998)。
[40]IAKOVOU, E., C. M. IP, C. DOULIGERIS, AND A. KORDE,"OPTIMAL LOCATION AND CAPACITY OF EMERGENCY CLEANUP EQUIPMENT FOR OIL SPILL RESPONSE",EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,96,72-80,1997.
[41]JACOBSEN, S.K.,O.B.G. MADSEN, " A COMPARATIVE STUDY OF HEURISTICS FOR A TWO-LEVEL ROUT -ING-LOCATION PROBLEM," EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,5,378-387(1980)。
[42]KIRKPATRICK, S., C.D. GELATT. TR., AND M.P.VECCHI, " OPTIMIZATION BY SIMULATED ANNEAL -ING,"
SCI.,22,671-680(1983)。
[43]KLINCEWICZ,J.G.,H. LUSS,AND M.G. PILCHER, "FLEET SIZE PLANNING WHEN OUTSIDE CARRIER SERVICE ARE
AVAILABE," TRANSPORTATION SCIENCE, 24,169-182(1990)。
[44]KOKSALAN, M., H. SURAL, AND O. KIRCA,"A LOCATION DISTRIBUTION APPLICATION FOR A BEER COMPANY",EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,80,16-24,1995.
[45]LAMBERT,V.,G. LAPORET AND F. LOUREAUX, "DESIGNING COLLECTION ROUTES THROUGH BANK BRANC -HES,"
COPMUTER OPERATIONS RESEARCH,20,783-791(1993)。
[46]LAPORTE ,G.,AND Y. NOBERT, "AN EXACT ALGORITHM FOR MINIMIZING ROUTING AND OPERATING COSTS IN DEPOT LOCATION," EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,6,224-226(1981)。
[47]LAPORTE, G., "LOCATION-ROUTING PROBLEM,"VEHICLE ROUTING : METHOD AND STUDIES.(1988)。
[48]LAPORTE , G., "THE VEHICLE ROUTING PROBLEM: AN OVERVIEW OF EXACT AND APPROXIMATE ALGOR -ITHMS,"
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,59,345-358(1992)。
[49]LITTLE , J. D. C, K.G. MURTY, D.W. SWEENEY AND C. KAREL,"ALGHORITHM FOR THE TRAVELING SALESMAN PROBLEM," OPS. RES. ,11, 979 (1963)。
[50]METROPOLIS,N.,A.W. ROSENBLUTH AND A.H. TELLER,"EQUATION OF STATE CALULATIONS BY FAST COMPUTING MACHINES,"J. CHEN. PHY.,21,1087-1092(1953)。
[51]MOLE, R. AND S.JAMESON,"A SEQUENTIAL ROUTE-BUILDING ALGORITHM EMPLOYING A GENERALIZED SAVINGS CRITERION," OPERATIONS RESEARCH QUARTERLY, 27,503-511 (1976)。
[52]NAGY G., SALHI S., "NESTED HEURISTIC METHODS FOR THE LOCATION-ROUTEING PROBLEM," JOURN -AL OF THE OPERATIONAL RESEARCH SOCIETY, 47, 1166-1174 (1996)。
[53]NAGY G., SALHI S., "A NESTED LOCATION-ROUTING HEURISTIC USING ROUTE LENGTH ESTIMATION, " SCHOOL OF MATHEMATICS AND STATISTICS, SLA70, 109-127 (1996)。
[54]OR, I. ,AND W.P. PIERSKALLA, "A TRANSPORTATION LOCATION-ALLOCATION MODEL FOR REGIONAL BLOOD BANKING,"AIIE TRANSACTIONS,11,86-95(1979)。
[55]OSMAN IH. "METASTRATEGY SIMULATED ANNEALING AND TABU SEARCH ALGORITHMS FOR THE VEHICLE ROUTING PROBLEM," ANNALS OF OPERATIONS RESEARCH, 41, 421-451, (1993)。
[56]PERL,J., "A UNIFIED WAREHOUSE LOCATION-ROUTING PROBLEM , "UMI DISSERTATION INFORMATION SERVICE。
[57]PERL, J.,AND M.S. DASKIN, "A WAREHOUSE LOCATION-ROUTING PROBLEM," TRANSPORTATION RESEA -RCH B, 19, 381-396(1985)。
[58]POTVIN, J.Y., D. DUBE,AND C. ROBILLARD, "A HYBRID APPROACH TO VEHICLE ROUTING USING NEURAL NETWORKS AND GENETIC ALGORITHMS,"APPLIED INTELLIGENCE,6,241-252(1996)。
[59]RENAUD, J. G. ,LAPORTE,AND F.F. BOCTOR, "A TABU SEARCH HEURISTIC FOR THE MULTI-DEPOT VEHICLE ROUTING PROBLEM,"COMPUTERS OPS. RES.,23,229-235(1996)。
[60]SEMET, F.,AND E. TAILLARD, "SOLVING REAL-LIFE VEHICLE ROUTING PROBLEMS EFFICIENTLY USI -NG TABU SEARCH,"ANNALS OF OPERATIONS OF RESEARCH,41,469-488(1993)。
[61]WILLIAM T. CHIEN, "HEURISTIC PROCEDURES FOR PRACTICAL-SIZED UNCAPACITATED LOCATION-CAP -ACITATED ROUTING PROBLEMS," DECISION C SCIENCES, 24, 995-1021 [62]TAILLARD, E.,AND P. BADEAU, "A TABU SEARCH
HEURISTIC FOR THE VEHICLE ROUTING PROBLEM WITH SOFT TIME WINDOWS," TRANSPORTATION SCIENCE, 31, 170-186(1997)。
[63]TOTH P, VIGO D, "THE VEHICLE ROUTING PROBLEM," SIAM, PHILADELPHIA MONOGRAPH ON DISCRE -TE MATHEMATICS AND APPLICATIONS, (2000)。
[64]WOLFE, P. AND W. J. BAUMOL,"WAREHOUSE LOCATION",OPERATIONS RESEARCH,6,252-263,1958.
[65]XU, J.,AND J. KELLY, "A NETWORK FLOW-BASED TABU SEARCH HEURISTIC FOR THE VEHICLE ROUTI -NG PROBLEM,"
TRANSPORTATION SCIENCE,30, 379-393(1996)。
[66]YANO, T., CHAN, L. AND RICHTER, K.M., "VEHICLE ROUTING AT ROUTING AT QUALITY STORES," INTERFACES, 17(2), 52-63 (1987)。
[67]WOLFE, P. AND W. J. BAUMOL,"WAREHOUSE LOCATION",OPERATIONS RESEARCH,6,252-263,1958.
