區位-途程問題啟發式解法之研究 顏嘉宏、吳泰熙,王安祥
E-mail: 9015649@mail.dyu.edu.tw
摘 要
區位-途程問題(LOCATION-ROUTING PROBLEMS ,LRPS)係採巡迴式配送；而傳統的配送，以往返式配送為主要方式，
此為LRP和傳統的區位指派問題(CLASSICAL LOCATION-ALLOCATION)間最大的區別。區位-途程問題是結合設施區位 問題與車輛途程問題，加以考量更符合實際的運輸成本，同時決定最佳的設施數目、服務範圍、車輛指派和車輛途程。 本 研究目的在針對由白俊偉[3]所建構一區位-途程數學模式，先應用鬆弛法求解集合涵蓋問題，再提出新的啟發式演算法進 行LRP的改善。由於LRP為一個NP-HARD問題，而且問題內容包含區位分派問題及車輛途程問題，因此非常複雜難解。
本研究將根據下列三個子問題：(1)區位分派問題，(2)車輛途程問題，(3)途程重新指派問題，結合拉氏式鬆弛
法(LAGRANGIAN RELAXATION)與禁忌搜尋法(TABU SEARCH)，分別發展啟發式演算法，以求迅速獲得近似最佳解。
關鍵詞 : 區位-途程問題、拉氏鬆弛法、禁忌搜尋法
目錄
第一章 緒論--P1 1.1 研究背景與動機--P1 1.2 研究目的--P2 1.3 研究大綱--P3 1.4 研究內容、流程--P3 第二章 文獻回顧--P5 2.1 設施區位問題--P5 2.2 車輛途程問題--P7 2.3 區位-途程問題--P10 2.4 求解集合涵蓋問題--P13 2.5 禁忌搜尋演算法--P22 第 三章 區位-途程模式之求解--P26 3.1 啟發式鬆弛法之應用--P26 3.2 區位-途程問題--P27 3.2.1 設施區位問題--P32 3.2.2 車輛途 程問題--P33 3.3 區位-途程模式之啟發式演算法--P35 3.3.1 區位-途程分解演算法--P35 3.3.2 區位分派模式之演算法--P39 3.3.3 車輛途程模式之演算法--P43 第四章 結果分析--P57 4.1 集合涵蓋問題文獻例題比較--P57 4.2 區位-途程問題文獻例題比 較--P62 第五章 結論與建議--P67
參考文獻
[ 1]張有恒，"物流管理"，華泰書局，民國87年9月。
[ 2]顏憶茹，張淳智，"物流管理"，華泰書局，民國87年6月。
[ 3]白俊偉，"隨機型區位-途程問題解法之研究"，大葉大學工業工程所碩士論文，民國88年7月。
[ 4]郭振峰，"建立物流中心區位模式之研究"，國立成功大學交通管理科學研究所碩士論文，民國83年 6月。
[ 5]鄭守志，"物流中心區位選擇模式之研究"，國立成功大學交通管理科學研究所碩士論文，民國83年 6月。
[ 6]黃金智，"隨機型車輛途程問題解法之研究"，大葉大學工業工程所碩士論文，民國88年7月。
[ 7]陳正元，"節省法與路線間交換改善法在車輛路線問題上之應用"，國立交通大學土木工程研究所碩 士論文，民國81年6月。
[ 8]韓復華、楊智凱、卓裕仁，"應用門檻接受法求解車輛路線問題之研究",運輸計劃季刊,26,P253-28 0 (1997)。
[ 9]李宗儒、翁基華，"具工作負荷平衡支配送車輛途程問題"，運輸學刊，11，P59-72 (1999)。
[10]AIKENS, C. H.,"FACILITY LOCATION MODELS FOR DISTRIBUTION PLANNING",EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,22,263-279,1999.
[11]ALMINANA, M. AND J. T. PASTOR,"AN ADAPTATION OF SH HEURISTIC TO THE LOCATION SET COVER -ING PROBLEM",EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,100,586-593,1997.
[12]BAKER, B. M. AND J. SHEASBY,"EXTENSIONS TO THE GENERALISED ASSIGNMENT HEURISTIC FOR VE -HICLE ROUTING",EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,119,147-157,1999.
[13]BARBAROSOGLU, G. AND D.OZGUR,"A TABU SEARCH ALGORITHM FOR THE VEHICLE ROUTING PROBLEM"
,COMPUTER & OPERATIONS RESEARCH ,26,255-270,1999.
[14]BATTA, R., J. M. DOLAN, AND N. N. KRISHNAMRUTHY,"THE MAXIMAL EXPECTED COVERING LOCATIO -N PROBLEM:REVISITED",TRANSPORTATION ,23,277-287,1989.
[15]BEASLEY, J. E.,"AN ALGORITHM FOR SET COVERING PROBLEM",EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,31,85-93,1987.
[16]BEASLEY, J. E.,"A LAGRANGIAN HEURISTIC FOR SET COVERING PROBLEM",NAVAL RESEARCH LOGIST -ICS,37,151-164,1990.
[17]BEASLEY, J. E. AND K.JORNSTEN,"ENHANCING AN ALGORITHM FOR SET COVERING PROBLEM",EUROPE -AN
JOURNAL OF OPERATIONAL RESEARCH,58,293-300,1992.
[18]BEASLY, J. E. AND P. C. CHU,"A GENETIC ALGORITHM FOR THE SET COVERING PROBLEM",EUROPEA -N JOURNAL OF OPERATIONAL RESEARCH ,94,586-593,1996.
[19]BERTSIMAS, D. J.,"A VEHICLE ROUTING PROBLEM WITH STOCHASTIC DEMAND",OPERATIONS RESEARC -H,40,574-585,1992.
[20]BODIN, L. D., B. L. GOLDEN , A. A. ASSAD AND M. O. BALL,"ROUTING AND SCHEDULING OF VEH -ICLES AND CREWS.
THE STATE OF THE ART",COMPUTERS AND OPERATIONS RESEARCH,10,69-211, 1983.
[21]BRAMEL, J. AND D. SIMCHI-LEVI,"ON THE EFFECTIVENESS OF SET COVERING FORMULATIONS FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS",OPERATIONS RESEARCH,45,295-301,1997.
[22]BRANDAO, J. AND A. MERCER,"A TABU SEARCH ALGORITHM FOR THE MULTITRIP VEHICLE ROUTING AND SCHEDULING PROBLEM",EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,100,180-191,1997.
[23]BRUSCO, M. J., L. W. JACOBS AND G. M. THOMPSON,"A MORPHING PROCEDURE TO SUPPLEMENT A SIMULATED ANNEALING HEURISTIC FOR COST AND COVERAGE-CORRELATED SET COVERING PROBLEMS", ANNALS OF OPERATIONS RESEARCH,86,611-627,1999.
[24]CERIA, S., P. NOBILI AND A. SASSANO,"A LAGRANGIAN-BASED HEURISTIC FOR LARGE-SCALE SET COVERING PROBLEMS",MATHEMATICAL PROGRAMMING,81,215-228,1998.
[25]CHRISTOFIDES, N. AND S. EILON,"AN ALGORITHM FOR THE VEHICLE DISPATCHING PROBLEM",OPERA -TIONAL RESEARCH QUARTERLY,20,309-318,1969.
[26]CHVATAL, V.,"A GREEDY HEURISTIC FOR THE SET COVERING PROBLEM",MATHEMATICS OF OPERATION -S RESEARCH,4,NO.3,AUGUST,233-235,1979.
[27]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.
[28]DAMMEYER, F. AND V. STEFAN,"DYNAMIC TABU LIST MANAGEMENT USING THE REVERSE ELIMINAT -ION METHOD",ANNALS OF OPERATION RESEARCH,41,31-46,1993.
[29]DANTZIG, G. AND J. H. RAMSER,"THE TRUCK DISPATHING PROBLEM",MANAGEMENT SCIENCE,6,80-91, 1959.
[30]DESROSIERS, M. AND J. M.SOLOMON,"A NEW OPTIMIZATION ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS",OPERATIONS RESEARCH,40,342-354,1992.
[31]DROR, M., AND P. TRUDEAU,"STOCHASTIC VEHICLE ROUTING WITH MODIFIED SAVINGS ALGORITHM", EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,23,228-235,1986.
[32]FISHER, M. L AND R. JAIKUMAR,"A GENERALIZED ASSIGNMENT HEURISTIC FOR VEHICLE ROUTING PROBLEMS",NETWORKS,11,109-124,1981.
[33]FISHER, M. L. AND P. KEDIA,"OPTIMAL SOLUTION OF SET COVERING/PARTITIONING PROBLEM USIN -G DUAL HEURISTICS",MANAGEMENT SCIENCE,36,NO.6,JUNE 1990.
[34]FISHER, M. L., K. O. JORNSTEN AND O. B. G. MADSEN,"VEHICLE ROUTING WITH TIME WINDOWS: TWO OPTIMIZATION ALGORITHMS",OPERATIONS RESEARCH,45,488-492,1997.
[35]GENDREAU , M., G. LAPORTE AND R. SEGUIN,"STOCHASTIC VEHICLE ROUTING",EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,88,3-12 ,1996.
[36]GILLETT, B. E. AND L. R. MILLER,"A HEURISTIC ALGORITHM FOR THE VEHICLE-DISPATCH PROBLE -M",OPERATIONS RESEARCH,22,340-349,1974.
[37]GOLDEN, B., A. ASSAD, L. LEVY AND F. GHEYSENS,"THE FLEET SIZE AND MIX VEHICLE ROUTING PROBLEM",COMPUTERS & OPERATIONS RESEARCH,11,49-66,1984.
[38]HADDADI, S.,"SIMPLE LAGRANGIAN HEURISTIC FOR THE SET COVERING PROBLEM",EUROPEAN JOURNA -L OF OPERATIONAL RESEARCH,97,200-204,1997.
[39]HANSEN, P. H., B. HEGEDAHL, S. HJORTKJAR AND B. OBEL, "A HEURISTIC SOLUTION TO THE WAR -EHOUSE LOCATION-ROUTING PROBLEM",EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,76,111-127, 1994.
[40]HOLMBERG, K., AND M. RONNQVIST,"AN EXACT ALGORITHM FOR THE CAPACITATED FACILITY LOCATI -ON PROBLEMS WITH SINGLE SOURCING",EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,113,544-55 6,1999.
[41]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.
[42]JACQUES, D., S. MICHEL AND S. FRANCOIS,"LAGRANGIAN RELAXATION METHODS FOR SOLVING THE MINIMUM FLEET SIZE MULTIPLE TRAVELING SALESMAN PROBLEM WITH TIME WINDOWS",MANAGEMENT
SCIENCE,34,1005-1022,1988.
[43]KLINCEWICZ, J. G., H. LUSS AND M. G. PILCHER,"FLEET SIZE PLANNING WHEN OUTSIDE CARRIER SERVICE ARE
AVAILABE",TRANSPORTATION SCIENCE,24,783-791,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]LAPORTE, G. AND Y. NOBERT,"AN EXACT ALGORITHM FOR MINIMIZING ROUTING AND OPERATING CO -STS IN DEPOT LOCATION",EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,6,224-226,1981.
[46]LAPORTE, G.,"LOCATION-ROUTING PROBLEM",VEHICLE ROUTING : METHOD AND STUDIES.,1988.
[47]LAPORTE, G., F. LOUVEAUX AND H. MERCURE,"MODELS AND EXACT SOLUTIONS FOR A CLASS OF STO -CHASTIC LOCATION-ROUTING PROBLEMS",EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,39,71-78, 1989.
[48]LAPORTE, G.,"THE VEHICLE ROUTING PROBLEM:AN OVERVIEW OF EXACT AND APPROXIMATE ALGORIT -HMS",EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,59,345-358,1992.
[49]LORENA, L. A. AND F. B. LOPES,"A SURROGATE HEURISTIC FOR SET COVERING PROBLEM",EUROPEA -N JOURNAL OF OPERATIONAL RESEARCH ,79,138-150,1994.
[50]MANNINO, C. AND A. SASSANO,"SOLVING HARD SET COVERING PROBLEMS",OPERATIONS RESEARCH LE -TTERS,18,1-5,1995.
[51]MIN, H., V. JAYARAMAN AND R. SRIVASTAVA,"COMBINED LOCATION ROUTING PROBLEMS :A SYNTHE -SIS AND FUTURE RESEARCH DIRECTIONS",EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,108,1-15, 1998.
[52]MOLE, R. AND S. JAMESON,"A SEQUENTIAL ROUTE-BUILDING ALGORITHM EMPLOYING A GENERALIZED SAVINGS CRITERION",OPERATIONS RESEARCH QUARTERLY,27,503-511,1976.
[53]ONG, H. L., B.W. ANG, T. N. GOH AND C. C. DENG,"A VEHICLE ROUTING AND SCHEDULING PROBL -EM WITH TIME WINDOWS AND STOCHASTIC DEMAND CONSTRAINTS",ASIA-PACIFIC JOURNAL OF OPERA -TION RESEARCH,14,1-17,1997.
[54]OR, I. AND W. P. PIERSKALLA,"A TRANSPORTATION LOCATION-ALLOCATION MODEL FOR REGIONAL BLOOD BANKING",AIIE TRANSACTIONS,11,86-95,1979.
[55]OSMAN, I. H.,"METASTRATEGY SIMULATED ANNEALING AND TABU SEARCH ALGORITHMS FOR THE VEH -ICLE ROUTING PROBLEM",ANNALS OF OPERATIONS RESEARCH,41,421-451,1993.
[56]PERL, J., "A UNIFIED WAREHOUSE LOCATION-ROUTING PROBLEM , "UMI DISSERTATION INFORMATIO -N SERVICE。
[57]PERL, J. AND M. S. DASKIN,"A WAREHOUSE LOCATION-ROUTING PROBLEM",TRANSPORTATION RESEAR -CH ,19,381-396,1985.
[58]PLATZMAN, L. K. AND J. J. BARTHOLDI,"HEURISTICS BASED ON SPACEFILLING CURVES FOR COMBI -NATORIAL PROBLEMS IN EUCLIDEAN SPACE",MANAGEMENT SCIENCE,34,291-305,1988.
[59]STEWART, W. R. JR. AND B. L. GOLDEN,"STOCHASTIC VEHICLE ROUTING : A COMPREHENSIVE APPR -OACH",EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,14,371-385,1983.
[60]SWERSE, A. J. AND L. S. THAKUR,"A INTEGER PROGRAMMING MODEL FOR LOCATING VEHICLE EMISS -IONS TESTING STATIONS",MANAGEMENT SCIENCE,41,NO.6,MARCH 1995.
[61]TAILLARD, E., P. BADEAU, M. GENDERAU, F. GUERTIN AND J.-Y. POTVIN,"A TABU SEARCH HEURI -STIC FOR THE VEHICLE ROUTING PROBLEM WITH SOFT TIME WINDOWS",TRANSPORTATION SCIENCE, 31,170-186,1997.
[62]TILLMAN, F. A.,"THE MULTIPLE TERMIAL DELIVERY PROBLEM WITH PROBABILISTIC DEMANDS",TRAN -SPORTATION SCIENCE,30,192-204,1969.
[63]TOTH, P. AND D. VIGO,"AN EXACT ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH BACKHAUL -S",TRANSPORTATION SCIENCE, 31,372-385 ,1997.
[64]TOTH, P. AND S. MARTELLO, "KNAPSACK PROBLEMS: ALGORITHMS AND COMPUTER IMPLEMENTATIONS , JOHN WILEY AND SONS., NEW YORK, 1990.
[65]TUZUN, D. AND L. I. BURKE,"A TWO-PHASE TABU SEARCH APPROACH TO THE LOCATION ROUTING PR -OBLEM",EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,116,87-99,1999.
[66]WALKER W.,"USING THE SET COVERING PROBLEM TO ASSIGN FIRE COMPANIES TO FIRE HOUSES",OPE -RATIONS RESEARCH ,22,275-277,1988.
[67]WOLFE, P. AND W. J. BAUMOL,"WAREHOUSE LOCATION",OPERATIONS RESEARCH,6,252-263,1958.
[68]XU, J. AND J. P. KELLY,"A NETWORK FLOW-BASED TABU SEARCH HEURISTIC FOR THE VEHICLE RO UTING PROBLEM",TRANSPORTATION SCIENCE ,30,379-393,1996.
