建議及未來發展

本研究完成一單純 LRPSPD 應用於手機通路商規劃其配銷通路之程式系統 設計，初步設定考量後勤維修中心之最佳區位選擇，以及後勤維修中心與門市、

維修客服中心等客戶點之間的最佳配送路線。

下列各點為本研究提供予未來有心延續本研究相關問題之學者參考：

1. 本研究設定各場站之設置成本皆相同；然實際問題上，場站會依其大小、位 置等因素具設置成本之貣伏變化。

2. 本研究設定各場站派出之車輛皆具相同的車輛成本及載貨量限制；然實際問 題上，每台車具自身性能變化，因此各車之固定成本皆可能不盡相同，載貨 量亦會隨車種而改變。

3. 本研究假設待收、送之貨品皆無先後順序或送達時間要求等問題；然實際問 題上，貨品可能具有急單和緩單之分別、最晚送達時間要求，建議未來可於 本研究之數學規劃模型中，加入時間窗設計，求出更貼近真實應用的結果。

34

4. 本研究提出之演算法架構仍欠缺周全性，僅使用 4.3 節解釋之兩種移步法則；

未來若能增加移步法則，調整現有組合模式以使之更加完整，相信鄰近解之 交換結果亦能再有更大的改善空間。

5. 本研究令手機通路商所具之後勤維修中心為場站，固定門市櫃台、特約服務 中心、維修客服中心為各客戶點，假設只有後勤維修中心能進行損壞手機之 維修服務，其餘各處皆只能發放自場站送來之新的或已修好的手機予客戶，

加上接收客戶損壞的手機送回場站維修；當未來手機通路商擁有的維修客服 中心也提供維修功能時，此問題自客戶點收取到之貨品，則可增加不全數運 回場站，而於代表維修客服中心之客戶點發送之考量，藉此讓整個問題更加 完整，且貼近實際應用。

35

參考文獻

Alfredotangmontane, F., & Galvao, R. (2006). A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Computers &

Operations Research, 33(3), 595-619. doi: 10.1016/j.cor.2004.07.009

Bae, S. T., Hwang, H. S., Cho, G. S., & Goan, M. J. (2007). Integrated GA-VRP

solver for multi-depot system. Computers & Industrial Engineering, 53(2), 233-240.

Barreto, S. S. (2004). Análise e Modelização de Problemas de localizaçãodistribuição

[Analysis and modelling of location-routing problems]. Ph.D. Thesis,

University of Aveiro, Aveiro, Portugal.

Berger, R. T. (2007). Location-routing problems with distance constraints.

Transportation Science, 41(1), 29-43. doi: DOI 10.1287/trsc.1060.0156

Caballero, R., Gonzalez, M., Guerrero, F. M., Molina, J., & Paralera, C. (2007).

Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia. European Journal of

Operational Research, 177(3), 1751-1763. doi: DOI

10.1016/j.ejor.2005.10.017

Chan, Y. P., Carter, W. B., & Burnes, M. D. (2001). A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands. Computers

& Operations Research, 28(8), 803-826.

Christofides, N., & Mingozzi, A. (1989). Vehicle routing: Practical and algorithmic aspects. In C. F. H. van Rijn (Ed.), Logistics: Where Ends Have to Meet (pp.

30-48). Oxford, UK: Pergamon Press.

Christofides, N., Mingozzi, A., & Toth, P. (1979). The vehicle routing problem. In N.

Christofides, A. Mingozzi, P. Toth & C. Sandi (Eds.), Combinatorial

Optimization (pp. 315-338). Chichester, UK: Wiley.

Crevier, B., Cordeau, J. F., & Laporte, G. (2007). The multi-depot vehicle routing problem with inter-depot routes. European Journal of Operational Research,

176(2), 756-773.

Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management

Science, 6, 80-91.

Daskin, M., Coullard, C., & Shen, Z. (2002). An inventory-location model:

Formulation, solution algorithm and computational results. Annals of

Operations Research, 110(1), 83-106.

Dilek Tuzun, L. I. B. (1999). A two-phase tabu search approach to the location routing problem. European Journal of Operational Research, 166, 87-99.

36

Fisher, M. L. (1995). Vehicle routing. In M. O. Ball, T. L. Magnanti, C. L. Monma &

G. L. Nemhauser (Eds.), Network Routing (Vol. 8, pp. 1-33). Amsterdam:

North Holland.

Fisher, M. L., & Jaikumar, R. (1981). A Generalize Assignment Heuristic for Vehicle Routing Problems. Networks, 11, 109-124.

Gendreau, M. (2003). An introduction to tabu search. In F. Glover & G. A.

Kochenberger (Eds.), Handbook of Metaheuristics (pp. 37-54). Boston, Dordrecht, London: Kluwer Academic Publishers.

Gendreau, M., Hertz, A., & Laporte, G. (1994). Tabu search heuristic for the vehicle routing problem. Management Science, 40(10), 1276-1290.

Glover, F. (1989). Tabu search - part I. ORSA Journal on Computing, 1(3), 190-206.

Glover, F. (1990). Tabu search - part II. ORSA Journal on Computing, 2(1), 4-32.

Glover, F. (1993). Tabu Search. Basel, Switzerland: J.C. Baltzer.

Glover, F., & Laguna, M. (1993). Tabu search. Modern Heuristic Techniques for

Combinatorial Problems, 70-150.

Glover, F., & Laguna, M. (1997). Tabu Search. Boston: Kluwer Academic Publishers.

Golden, B. L., & Assad, A. (Eds.). (1988). Vehicle Routing: Methods and Studies.

Amsterdam: North-Holland.

Javid, A. A., & Azad, N. (2010). Incorporating location, routing and inventory decisions in supply chain network design. Transportation Research Part

E-Logistics and Transportation Review, 46(5), 582-597. doi: DOI

10.1016/j.tre.2009.06.005

Lai, M. Y., & Cao, E. B. (2010). An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows. Engineering Applications of Artificial Intelligence, 23(2), 188-195.

doi: DOI 10.1016/j.engappai.2009.09.001

Laporte, G. (1992). The vehicle routing problem: an overview of exact and approximate algorithms. European Journal of Operational Research, 59, 345-358.

Laporte, G., Gendreau, M., Potvin, J. Y., & Semet, F. (2000). Classical and modern heuristics for the vehicle routing problem. International Transactions in

Operational Research, 7(4-5), 285-300.

Laporte, G., & Nobert, Y. (1987). Exact algorithms for the vehicle routing problem.

Surveys in Combinatorial Optimization, 31, 147-184.

Laporte, G., Nobert, Y., & Taillefer, S. (1988). Solving a family of multi-depot vehicle routing and location-routing problems. Transportation Science, 22(3),

161-172.

Laporte, G., & Semet, F. (2002). Classical heuristics for the capacitated VRP. In P.

37

Toth & D. Vigo (Eds.), The Vehicle Routing Problem (pp. 109-128).

Philadelphia, PA: SIAM Monographs on Discrete Mathematics and Applications.

Lieberman, H. (2005). Introduction to Operations Research (8 ed.). New York:

McGraw-Hill.

Liu, R., Jiang, Z. B., Fung, R. Y. K., Chen, F., & Liu, X. (2010). Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration. Computers & Operations Research, 37(5), 950-959.

Marc Goetschalckx, M., & Jacobs-Blecha, C. (1989). The vehicle routing problem with backhauls. European Journal of Operational Research, 42(1), 39-51.

Min, H. (1989). The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transportation Research Part A: General, 23(5), 377-386.

Naftali, T. (2010). A Genetic Algorithm for the Capacitated Location Routing

Problems and Its Variants. Master degree, National Taiwan University of

Science and Technology, Taipei City, Taiwan.

Prins, C., Prodhon, C., Ruiz, A., Soriano, P., & Wolfler Calvo, R. (2007). Solving the capacitated location-routing problem by a cooperative Lagrangean

relaxationgranular tabu search heuristic. Transportation Science, 410(4), 470-783.

Toth, P., & Vigo, D. (Eds.). (2002). The Vehicle Routing Problem. Philadelphia, PA:

SIAM Monographs on Discrete Mathematics and Applications.

Tuzun, D., & Burke, L. I. (1999). Two-phase tabu search approach to the location routing problem. European Journal of Operational Research, 116(1), 87-99.

Yu, V. F., Lin, S.-W., Lee, W., & Ting, C.-J. (2010). A simulated annealing heuristic for the capacitated location routing problem. Computers & Industrial

Engineering, 58(2), 288-299.

38

39

40

附錄三 例題測詴之最佳行車路徑(題庫一)

ID Tour of Best Solution

B01

1 13 11 9 6 5 10 1 1 12 7 8 15 17 14 1 0 21 24 25 23 0 0 20 18 16 19 22 0

B02

0 16 15 10 5 6 7 20 19 18 21 26 24 23 22 25 0 0 17 14 0

0 13 9 8 12 11 0

B03

^{2 6 2}

1 11 21 13 18 12 16 15 14 19 20 17 1 2 8 9 5 10 28 29 33 31 32 30 7 2

41 2 26 24 23 22 27 25 2

B04

2 15 9 10 11 12 13 14 36 17 5 2 2 34 7 8 6 16 35 2

2 21 29 28 27 26 24 25 22 23 18 2 2 33 32 20 31 30 19 2

B05

2 15 36 14 13 12 11 10 9 8 7 6 16 35 2 2 30 31 20 32 33 34 2

2 5 17 22 23 25 24 26 27 28 29 21 19 18 2

42

B06

3 24 23 17 11 5 6 12 18 19 25 3 3 13 7 8 9 10 16 15 14 20 26 3 3 32 33 27 21 22 28 34 40 39 38 3 3 31 37 36 35 29 30 3

B07

1 42 13 34 38 54 25 33 20 15 50 51 1 4 5 10 18 28 47 11 27 52 31 36 4 4 26 12 30 35 32 7 40 39 24 6 4 1 22 29 17 45 44 23 46 8 1 1 16 9 53 14 43 37 49 19 48 41 21 1

43

B08

0 84 11 71 82 42 25 12 60 0 3 46 22 63 28 36 38 83 30 78 80 3 0 61 54 37 77 13 76 0

0 16 62 23 44 17 55 43 0 3 79 69 45 56 57 14 24 66 29 3 0 39 70 31 73 51 50 52 10 0 0 15 72 32 65 58 33 27 53 21 0 0 35 26 67 48 18 49 0

8 74 40 64 34 59 41 81 19 8 8 47 20 68 75 8

B09

8 97 16 91 57 56 55 45 58 73 20 28 71 19 99 72 41 39 79 40 8

44

8 36 37 67 49 30 82 81 83 31 84 65 32 48 76 34 64 63 89 59 10 78 8 3 85 86 12 88 42 90 60 29 18 80 75 74 44 43 87 38 33 77 21 3

4 98 61 27 69 92 108 102 94 100 109 46 107 101 68 106 96 51 66 24 11 22 62 4 4 15 103 104 105 14 93 17 54 26 70 25 95 47 53 23 52 50 13 35 4

B10

0 5 6 12 13 11 0 0 10 9 7 2 3 4 8 0

B11

8 18 25 19 15 16 56 8 5 60 66 64 67 27 58 5 4 47 28 41 30 46 59 4 5 57 69 54 53 68 52 5 8 24 34 35 65 51 61 8 8 21 32 40 38 49 50 8 4 44 36 31 26 42 37 4 8 20 55 63 62 39 29 8 4 33 43 45 17 22 48 4

45 8 23 8

B12

4 56 59 53 17 11 10 48 15 4 5 30 16 66 12 42 54 55 5 1 33 71 65 64 63 62 45 44 1 1 69 75 74 72 67 60 68 22 1 4 43 19 73 88 89 87 86 58 4 4 83 7 50 52 49 61 46 70 4 1 28 78 80 79 18 77 76 20 1 1 39 36 9 14 40 51 8 38 1 1 23 34 81 29 35 37 13 25 1 5 47 21 91 24 90 32 41 31 5 5 26 27 84 85 57 82 5

B13

0 38 97 95 99 163 195 179 175 184 176 173 193 191 192 174 183 181 198 186 180 196 194

46

189 182 187 185 190 178 188 199 214 63 160 162 7 177 74 34 72 111 0

0 73 213 212 61 164 165 211 148 223 158 152 206 207 35 39 103 22 11 270 257 264 321 298 240 241 244 98 0

3 309 275 303 304 249 280 286 242 312 250 233 239 267 299 276 283 289 281 265 256 294 293 319 317 314 315 3

2 287 278 282 288 285 271 284 272 307 306 255 292 234 17 20 89 100 101 18 58 32 31 33 10 27 139 135 137 91 92 136 279 2

1 144 5 6 295 236 16 130 131 24 82 133 132 138 134 141 43 4 78 55 140 1

1 71 70 119 122 124 121 120 123 47 51 113 112 83 60 77 30 28 110 69 68 104 117 64 44 8 65 66 86 226 21 227 228 14 42 87 26 59 90 105 25 114 75 125 118 67 36 126 108 76 84 37 229 29 40 109 9 54 238 254 252 253 246 290 259 247 273 274 311 305 296 308 156 205 150 219 218 216 220 204 197 142 53 49 107 115 94 128 79 81 80 19 129 12 23 85 13 96 116 102 93 50 127 48 106 45 46 52 41 1

0 153 147 161 201 145 210 222 157 151 154 200 202 224 225 209 217 215 221 146 203 172 171 170 155 159 0

0 149 208 169 167 168 166 56 57 277 300 269 262 230 310 291 248 266 231 268 263 251 245 235 243 261 232 260 313 316 318 320 301 237 297 302 258 143 88 15 62 0

B14

3 312 242 251 245 261 263 268 232 231 266 248 291 269 274 3

2 310 230 305 246 253 252 254 256 238 8 117 54 9 109 40 29 84 37 26 76 126 108 36 67 118 125 75 114 25 105 48 90 59 229 87 42 14 228 227 21 226 86 66 65 2

1 236 44 64 104 110 30 77 85 12 23 51 68 69 47 113 112 83 94 161 201 147 210 166 168 167 169 208 224 223 97 72 95 38 70 99 163 152 15 56 1

0 158 221 220 215 216 218 219 150 156 146 204 155 277 244 300 321 39 35 207 0 0 217 203 205 172 57 225 149 154 142 121 71 0

3 124 123 175 176 173 193 160 200 170 171 257 264 3

3 273 298 270 11 22 103 197 159 209 202 151 157 222 153 148 206 180 189 211 199 179 3 0 191 212 162 62 122 120 119 0

0 128 53 213 185 111 0

0 115 34 195 184 165 196 181 198 0 0 183 192 63 49 145 74 79 19 60 98 0 0 174 188 194 187 177 81 129 107 0

0 178 182 214 61 73 7 80 13 96 116 102 93 50 127 106 52 28 78 4 91 92 0 1 45 46 41 55 255 293 292 1

1 137 138 43 27 33 32 58 100 89 20 17 247 306 307 265 243 233 267 299 280 1 1 24 258 249 250 283 235 289 281 282 16 133 1

1 132 294 288 287 239 275 262 297 259 237 320 318 1 1 140 304 303 309 296 314 1

47 3 234 278 276 302 260 3

2 284 286 279 2 2 285 313 272 2 3 311 315 3

3 88 190 164 186 31 10 295 6 5 130 131 82 134 141 135 136 139 143 144 241 240 18 101 308 319 301 3

3 316 290 271 3 3 317 3

B15

2 7 12 11 6 2 2 14 13 15 30 31 5 2 1 19 17 16 23 22 25 24 18 1 1 9 10 21 20 28 26 27 29 8 1

B16

4 121 124 49 48 122 140 116 135 141 138 131 132 50 51 43 92 4 4 38 52 94 46 55 23 20 14 59 63 60 61 65 66 68 57 4

4 109 133 108 107 106 102 113 101 111 105 103 114 110 89 4 3 100 90 91 95 67 73 62 74 75 82 87 80 3

4 96 98 93 97 88 81 83 85 79 84 77 76 78 86 99 104 112 4 5 115 134 126 139 8 21 10 35 9 136 5

1 29 15 30 13 12 34 18 31 26 128 129 120 130 123 1 2 137 119 117 127 118 125 2

1 44 39 40 71 70 53 27 11 16 32 36 69 58 72 25 1 1 54 56 47 37 45 41 64 42 24 19 17 28 22 33 1

48

B17

6 94 69 72 85 48 46 21 18 53 9 39 13 14 6

6 20 87 38 64 83 33 81 45 29 40 16 75 37 88 28 92 84 49 58 65 24 71 55 23 30 47 77 86 95 6 6 10 62 31 66 22 52 73 78 42 61 26 89 90 70 56 51 6

4 8 12 79 4

4 82 60 43 25 67 59 11 17 34 35 15 36 50 57 74 54 63 76 41 32 91 80 4 4 19 44 68 27 93 4

B18

0 79 93 120 56 57 85 82 96 63 158 65 37 156 105 22 157 52 102 146 24 84 0 0 107 89 129 152 128 71 78 12 145 109 46 80 33 159 45 100 134 0

5 68 55 95 141 38 31 87 143 69 72 114 17 62 115 39 90 64 99 5

5 131 111 118 108 59 104 58 16 122 23 34 73 101 76 130 151 147 148 49 5 5 15 117 127 50 21 110 11 150 5

5 48 116 149 139 32 26 140 14 124 40 53 123 154 142 29 5 0 10 133 88 0

49 0 60 119 28 74 27 36 18 13 67 83 0

5 51 132 66 103 92 20 106 42 75 138 94 91 25 153 35 98 81 97 44 5 5 19 144 121 43 61 30 155 136 135 70 126 112 86 54 113 125 137 41 77 47 5

B19

0 37 69 23 92 40 33 84 118 120 125 128 127 119 121 126 114 122 117 123 116 113 25 47 34 98 36 124 115 130 129 76 102 74 95 87 38 93 81 85 86 53 54 0

0 107 66 67 26 89 101 39 90 103 112 50 27 77 15 65 57 0

0 63 97 42 46 106 14 80 19 45 29 32 51 62 100 68 82 71 28 83 88 43 22 108 55 30 49 24 0 0 96 18 41 58 21 78 99 20 109 91 73 111 56 75 44 110 79 60 48 72 17 64 70 59 105 61 35 0 0 104 52 94 16 31 0

50

附錄四 例題測詴之最佳行車路徑(題庫二)

ID Tour of Best Solution

L01

7 89 105 35 71 64 21 69 84 53 107 7 6 109 36 40 56 20 24 78 55 54 99 6 7 48 82 81 16 93 50 17 66 87 7 7 19 34 33 14 28 58 27 68 30 7 6 23 92 62 49 86 26 59 13 90 80 6 6 101 95 91 57 83 6

9 44 106 85 70 52 104 42 45 11 9 9 25 63 32 108 73 10 18 103 77 94 9 9 75 96 51 43 100 61 15 98 47 9 7 72 76 97 31 67 60 79 22 38 65 7 7 46 74 88 39 102 37 29 41 12 7

L02

10 116 38 42 115 59 55 73 92 67 35 10 10 64 24 78 28 53 94 39 43 10

9 34 21 88 62 27 52 68 33 63 9 9 105 71 108 74 25 82 58 112 65 83 9 16 47 48 93 117 29 84 119 107 66 79 16 16 111 87 20 31 57 51 110 46 118 70 16 16 76 75 100 89 91 104 114 22 16 9 36 32 45 30 40 77 90 69 85 72 9 16 86 109 106 26 80 41 56 101 44 16 16 103 102 113 95 99 97 49 37 60 16 10 23 50 81 96 98 54 61 10

L03

8 89 58 73 31 94 41 34 56 21 82 8 3 13 32 24 72 15 39 11 38 86 50 3 8 61 107 106 74 66 49 51 98 48 99 8 3 103 77 95 30 20 22 62 33 101 18 47 3 3 54 17 14 105 104 55 76 93 25 69 3 3 16 60 59 52 68 63 87 75 23 46 36 3 7 67 92 57 83 100 90 42 45 10 7 8 78 35 65 64 85 79 84 53 44 19 8 7 12 108 40 43 88 26 27 28 97 7 8 80 102 71 91 96 109 29 70 37 81 8

L04

8 102 21 88 97 94 57 73 116 106 107 8 8 58 76 45 100 28 39 34 55 40 115 8

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65 14 138 139 120 123 128 137 71 59 121 14 11 41 25 33 27 37 24 43 38 35 34 11 11 36 26 45 44 23 28 46 42 29 22 11 11 31 32 39 30 40 11

66

附錄五 例題測詴之最佳行車路徑(題庫三)

ID Tour of Best Solution

P01

2 22 17 9 7 11 2 4 14 19 20 4 2 18 16 5 8 2 4 13 21 24 6 4 3 23 12 10 15 3

P02

3 10 13 8 15 18 9 17 16 3 2 24 11 19 20 14 6 22 5 21 2 2 12 23 7 2

P03

3 11 6 13 7 3 4 24 18 21 4 4 15 20 17 22 4 3 9 19 16 23 12 3 0 14 8 10 5 0

P04

1 16 15 23 21 20 24 22 18 17 1 3 7 13 14 3

3 11 19 12 9 6 8 10 5 3

P05

0 18 20 6 23 38 0 2 11 36 40 33 2 2 17 22 10 2 2 12 24 41 42 2 2 27 35 26 48 2 2 31 37 28 44 46 2 3 53 47 50 15 3 3 8 39 13 29 3 0 49 32 9 51 43 0 0 7 54 34 21 0 3 19 45 30 14 3 3 16 5 25 52 3

P06

2 11 13 39 8 29 53 47 36 40 2 2 33 50 15 16 41 42 22 17 10 37 2 2 46 44 28 31 2

0 7 54 51 34 25 52 5 21 38 0 0 49 24 12 27 35 48 26 32 9 43 0 0 18 20 30 45 19 14 23 6 0

67

68

69

70

71

72

73

74

75

76

77

78

79 9 103 98 86 77 101 85 130 120 79 78 9 9 119 106 124 90 83 94 117 93 87 9 9 104 122 22 99 127 105 129 115 81 9 9 131 100 138 134 84 92 109 75 102 123 9 9 76 89 133 137 96 111 108 128 113 9 9 82 80 118 136 121 126 116 139 95 107 9 9 32 58 57 72 9

5 59 49 10 48 63 68 31 55 52 5 5 30 60 13 45 50 14 41 37 15 5 5 56 71 42 47 40 28 27 18 35 26 20 5 5 21 73 12 24 62 66 11 43 46 51 5 5 36 16 70 38 23 53 17 34 19 74 5 5 44 25 65 54 69 33 61 39 67 5 5 29 186 184 149 143 5

3 64 189 158 162 180 205 206 198 156 188 3 3 208 182 176 152 157 207 174 204 178 3 3 190 175 172 170 166 171 192 173 147 3 3 203 167 200 181 209 153 142 160 155 3

3 183 201 146 163 169 161 144 177 199 195 196 3 3 141 191 197 140 179 164 150 185 193 3

3 187 202 151 194 168 148 154 165 145 159 3

在文檔中 同時收送貨之區位途程問題 (頁 40-86)