메뉴 건너뛰기
Journal of Heuristics
Volumn 16, Issue 3, 2010, Pages 441-473
An adaptive memory algorithm for the split delivery vehicle routing problem
Author keywords

Adaptive memory; Heuristic; Route angle control; Split delivery; Variable neighborhood descent; Vehicle routing
Indexed keywords

ADAPTIVE MEMORY; ANGLE CONTROL; BENCH-MARK PROBLEMS; CONSTRUCTIVE ALGORITHMS; CONSTRUCTIVE APPROACH; CUSTOMER DEMANDS; HEURISTIC APPROACH; ITERATIVE APPROACH; NEW APPROACHES; NOVEL CONCEPT; ROUTE ANGLE CONTROL; SPLIT DELIVERY; SPLIT DELIVERY VEHICLE ROUTING;
EID: 77952237908     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-008-9101-3     Document Type: Conference Paper
Times cited : (38)
References (37)
  • 1
    • 33845403933 scopus 로고    scopus 로고
    • A food distribution network problem: A case study
    • DOI 10.1093/imaman/dpl012
    • D. Ambrosino A. Sciomachen 2007 A food distribution network problem: a case study IMA J. Manag. Math. 18 1 33 53 1126.90061 10.1093/imaman/dpl012 (Pubitemid 44895081)
    • (2007) IMA Journal Management Mathematics , vol.18 , Issue.1 , pp. 33-53
    • Ambrosino, D.1    Sciomachen, A.2
  • 2
    • 19944364549 scopus 로고    scopus 로고
    • Complexity and reducibility of the skip delivery problem
    • DOI 10.1287/trsc.1030.0084
    • C. Archetti R. Mansini M.G. Speranza 2005 Complexity and reducibility of the skip delivery problem Transp. Sci. 39 2 182 187 10.1287/trsc.1030.0084 (Pubitemid 40748588)
    • (2005) Transportation Science , vol.39 , Issue.2 , pp. 182-187
    • Archetti, C.1    Mansini, R.2    Speranza, M.G.3
  • 3
    • 33644585064 scopus 로고    scopus 로고
    • A tabu search algorithm for the split delivery vehicle routing problem
    • 10.1287/trsc.1040.0103
    • C. Archetti A. Hertz M.G. Speranza 2006 A tabu search algorithm for the split delivery vehicle routing problem Transp. Sci. 40 1 64 73 10.1287/trsc.1040.0103
    • (2006) Transp. Sci. , vol.40 , Issue.1 , pp. 64-73
    • Archetti, C.1    Hertz, A.2    Speranza, M.G.3
  • 4
    • 33646716139 scopus 로고    scopus 로고
    • Worst-case analysis for split delivery vehicle routing problems
    • 10.1287/trsc.1050.0117
    • C. Archetti M.W.P. Savelsbergh M.G. Speranza 2006 Worst-case analysis for split delivery vehicle routing problems Transp. Sci. 40 2 226 234 10.1287/trsc.1050.0117
    • (2006) Transp. Sci. , vol.40 , Issue.2 , pp. 226-234
    • Archetti, C.1    Savelsbergh, M.W.P.2    Speranza, M.G.3
  • 6
    • 0034262328 scopus 로고    scopus 로고
    • A lower bound for the split delivery vehicle routing problem
    • 1106.90380 10.1287/opre.48.5.801.12407 1792781
    • J. Belenguer M. Martinez E. Mota 2000 A lower bound for the split delivery vehicle routing problem Oper. Res. 48 5 801 810 1106.90380 10.1287/opre.48.5.801.12407 1792781
    • (2000) Oper. Res. , vol.48 , Issue.5 , pp. 801-810
    • Belenguer, J.1    Martinez, M.2    Mota, E.3
  • 7
    • 77952243241 scopus 로고    scopus 로고
    • Scatter search for heterogeneous fleet vehicle routing problems with time windows and split deliveries
    • P.P. Belfiore H.T.Y. Yoshizaki 2006 Scatter search for heterogeneous fleet vehicle routing problems with time windows and split deliveries Prod. Publ. Assoc. Bras. Engenh. Prod. 16 3 455 469
    • (2006) Prod. Publ. Assoc. Bras. Engenh. Prod. , vol.16 , Issue.3 , pp. 455-469
    • Belfiore, P.P.1    Yoshizaki, H.T.Y.2
  • 8
    • 38149137304 scopus 로고    scopus 로고
    • An effective memetic algorithm with population management for the split delivery vehicle routing problem
    • Hybrid Metaheuristics Springer Berlin. 10.1007/978-3-540-75514-2-2
    • Boudia, M., Prins, C., Reghioui, M.: An effective memetic algorithm with population management for the split delivery vehicle routing problem. In: Hybrid Metaheuristics. Lecture Notes in Computer Science, vol. 4771, pp. 16-30. Springer, Berlin (2007)
    • (2007) Lecture Notes in Computer Science , vol.4771 , pp. 16-30
    • Boudia, M.1    Prins, C.2    Reghioui, M.3
  • 9
    • 0008887050 scopus 로고
    • Vehicle routing with stochastic demands and split deliveries
    • 0799.90049
    • B. Bouzaiene-Ayari M. Dror G. Laporte 1993 Vehicle routing with stochastic demands and split deliveries Found. Comput. Decis. Sci. 18 2 63 69 0799.90049
    • (1993) Found. Comput. Decis. Sci. , vol.18 , Issue.2 , pp. 63-69
    • Bouzaiene-Ayari, B.1    Dror, M.2    Laporte, G.3
  • 10
    • 3843138356 scopus 로고    scopus 로고
    • A reactive variable neighborhood search for the vehicle-routing problem with time windows
    • DOI 10.1287/ijoc.15.4.347.24896
    • O. Bräysy 2003 A reactive variable neighborhood search for the vehicle-routing problem with time windows INFORMS J. Comput. 15 4 347 368 10.1287/ijoc.15.4.347.24896 2019285 (Pubitemid 39042714)
    • (2003) INFORMS Journal on Computing , vol.15 , Issue.4 , pp. 347-368
    • Braysy, O.1
  • 11
    • 34548214096 scopus 로고    scopus 로고
    • The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
    • DOI 10.1002/net.20181
    • S. Chen B. Golden E. Wasil 2007 The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results Networks 49 4 318 329 1141.90335 10.1002/net.20181 2381083 (Pubitemid 47324738)
    • (2007) Networks , vol.49 , Issue.4 , pp. 318-329
    • Si, C.1    Golden, B.2    Wasil, E.3
  • 12
    • 0001549833 scopus 로고
    • An algorithm for the vehicle-dispatching problem
    • 10.1057/jors.1969.75
    • N. Christofides S. Eilon 1969 An algorithm for the vehicle-dispatching problem Oper. Res. Q. 20 3 309 318 10.1057/jors.1969.75
    • (1969) Oper. Res. Q. , vol.20 , Issue.3 , pp. 309-318
    • Christofides, N.1    Eilon, S.2
  • 13
    • 0001208905 scopus 로고
    • The vehicle routing problem
    • N. Christofides A. Mingozzi P. Toth C. Sandi (eds). Wiley Chichester. Chap. 11
    • Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.) Combinatorial optimization, pp. 315-338. Wiley, Chichester (1979). Chap. 11
    • (1979) Combinatorial Optimization , pp. 315-338
    • Christofides, N.1    Mingozzi, A.2    Toth, P.3
  • 14
    • 0000419596 scopus 로고
    • Scheduling of vehicles from a central depot to a number of delivery points
    • 10.1287/opre.12.4.568
    • G. Clarke J. Wright 1964 Scheduling of vehicles from a central depot to a number of delivery points Oper. Res. 12 4 568 581 10.1287/opre.12.4.568
    • (1964) Oper. Res. , vol.12 , Issue.4 , pp. 568-581
    • Clarke, G.1    Wright, J.2
  • 15
    • 0001953950 scopus 로고
    • The truck dispatching problem
    • 0995.90560 10.1287/mnsc.6.1.80 115817
    • G. Dantzig J. Ramser 1959 The truck dispatching problem Manag. Sci. 6 1 80 91 0995.90560 10.1287/mnsc.6.1.80 115817
    • (1959) Manag. Sci. , vol.6 , Issue.1 , pp. 80-91
    • Dantzig, G.1    Ramser, J.2
  • 16
    • 0043059830 scopus 로고
    • Savings by split delivery routing
    • 0668.90044 10.1287/trsc.23.2.141 1013989
    • M. Dror P. Trudeau 1989 Savings by split delivery routing Transp. Sci. 23 2 141 145 0668.90044 10.1287/trsc.23.2.141 1013989
    • (1989) Transp. Sci. , vol.23 , Issue.2 , pp. 141-145
    • Dror, M.1    Trudeau, P.2
  • 17
    • 84989743891 scopus 로고
    • Split delivery routing
    • 0692.90044 1049782
    • M. Dror P. Trudeau 1990 Split delivery routing Nav. Res. Logist. 37 3 383 402 0692.90044 1049782
    • (1990) Nav. Res. Logist. , vol.37 , Issue.3 , pp. 383-402
    • Dror, M.1    Trudeau, P.2
  • 18
    • 0000855841 scopus 로고
    • Vehicle routing with split deliveries
    • 0801.90082 10.1016/0166-218X(92)00172-I 1277485
    • M. Dror G. Laporte P. Trudeau 1994 Vehicle routing with split deliveries Discrete Appl. Math. 50 3 239 254 0801.90082 10.1016/0166-218X(92)00172-I 1277485
    • (1994) Discrete Appl. Math. , vol.50 , Issue.3 , pp. 239-254
    • Dror, M.1    Laporte, G.2    Trudeau, P.3
  • 19
    • 0017150934 scopus 로고
    • An integer programming approach to the vehicle scheduling problem
    • 0327.90030 10.1057/jors.1976.63 489825
    • B.A. Foster D.M. Ryan 1976 An integer programming approach to the vehicle scheduling problem Oper. Res. Q. 27 2 367 384 0327.90030 10.1057/jors.1976.63 489825
    • (1976) Oper. Res. Q. , vol.27 , Issue.2 , pp. 367-384
    • Foster, B.A.1    Ryan, D.M.2
  • 20
    • 0343971032 scopus 로고
    • The bounded split delivery vehicle routing problem with grid network distances
    • 0775.90152 1179931
    • P. Frizzell J. Giffin 1992 The bounded split delivery vehicle routing problem with grid network distances Asia-Pac. J. Oper. Res. 9 101 116 0775.90152 1179931
    • (1992) Asia-Pac. J. Oper. Res. , vol.9 , pp. 101-116
    • Frizzell, P.1    Giffin, J.2
  • 21
    • 0029342706 scopus 로고
    • The split delivery vehicle scheduling problem with time windows and grid network distances
    • 0827.90072 10.1016/0305-0548(94)00040-F
    • P. Frizzell J. Giffin 1995 The split delivery vehicle scheduling problem with time windows and grid network distances Comput. Oper. Res. 22 6 655 667 0827.90072 10.1016/0305-0548(94)00040-F
    • (1995) Comput. Oper. Res. , vol.22 , Issue.6 , pp. 655-667
    • Frizzell, P.1    Giffin, J.2
  • 22
    • 2642574102 scopus 로고    scopus 로고
    • A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
    • DOI 10.1016/S0305-0548(03)00155-2, PII S0305054803001552
    • S. Ho D. Haugland 2004 A tabu search heuristic for the vehicle routing problem with time windows and split deliveries Comput. Oper. Res. 31 12 1947 1964 1074.68614 10.1016/S0305-0548(03)00155-2 (Pubitemid 38728562)
    • (2004) Computers and Operations Research , vol.31 , Issue.12 , pp. 1947-1964
    • Ho, S.C.1    Haugland, D.2
  • 23
    • 33750328011 scopus 로고    scopus 로고
    • A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem
    • DOI 10.1016/j.ijpe.2006.04.014, PII S0925527306001125
    • M. Jin K. Liu R.O. Bowden 2007 A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem Int. J. Prod. Econ. 105 1 228 242 10.1016/j.ijpe.2006.04.014 (Pubitemid 44636209)
    • (2007) International Journal of Production Economics , vol.105 , Issue.1 , pp. 228-242
    • Jin, M.1    Liu, K.2    Bowden, R.O.3
  • 24
    • 39149122239 scopus 로고    scopus 로고
    • A column generation approach for the split delivery vehicle routing problem
    • DOI 10.1016/j.orl.2007.05.012, PII S0167637707000909
    • M. Jin K. Liu B. Eksioglu 2008 A column generation algorithm for the vehicle routing problem with split delivery Oper. Res. Lett. 36 2 265 270 1144.90339 10.1016/j.orl.2007.05.012 2396578 (Pubitemid 351258138)
    • (2008) Operations Research Letters , vol.36 , Issue.2 , pp. 265-270
    • Jin, M.1    Liu, K.2    Eksioglu, B.3
  • 25
    • 33846581449 scopus 로고    scopus 로고
    • An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
    • DOI 10.1016/j.cor.2005.10.010, PII S0305054805003394
    • J. Kytöjoki T. Nuortio O. Bräysy M. Gendreau 2007 An efficient variable neighborhood search heuristic for very large scale vehicle routing problems Comput. Oper. Res. 34 9 2743 2757 1141.90429 10.1016/j.cor.2005.10.010 (Pubitemid 46178476)
    • (2007) Computers and Operations Research , vol.34 , Issue.9 , pp. 2743-2757
    • Kytojoki, J.1    Nuortio, T.2    Braysy, O.3    Gendreau, M.4
  • 26
    • 29844447098 scopus 로고    scopus 로고
    • A shortest path approach to the multiple-vehicle routing problem with split pick-ups
    • DOI 10.1016/j.trb.2004.11.004, PII S0191261505001116
    • C.-G. Lee M.A. Epelman C.C. White Y. Bozer 2006 A shortest path approach to the multiple-vehicle routing problem with split pick-ups Transp. Res. Part B 40 4 265 284 10.1016/j.trb.2004.11.004 (Pubitemid 43033363)
    • (2006) Transportation Research Part B: Methodological , vol.40 , Issue.4 , pp. 265-284
    • Lee, C.-G.1    Epelman, M.A.2    White III, C.C.3    Bozer, Y.A.4
  • 28
    • 0031281221 scopus 로고    scopus 로고
    • Variable neighborhood search
    • 0889.90119 10.1016/S0305-0548(97)00031-2 1471346
    • N. Mladenović P. Hansen 1997 Variable neighborhood search Comput. Oper. Res. 24 11 1097 1100 0889.90119 10.1016/S0305-0548(97)00031-2 1471346
    • (1997) Comput. Oper. Res. , vol.24 , Issue.11 , pp. 1097-1100
    • Mladenović, N.1    Hansen, P.2
  • 29
    • 38049014434 scopus 로고    scopus 로고
    • A new metaheuristic for the vehicle routing problem with split demands
    • Evolutionary Computation in Combinatorial Optimization Springer Berlin. 10.1007/978-3-540-71615-0-11
    • Mota, E., Campos, V., Corberan, A.: A new metaheuristic for the vehicle routing problem with split demands. In: Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science, vol. 4446, pp. 121-129. Springer, Berlin (2007)
    • (2007) Lecture Notes in Computer Science , vol.4446 , pp. 121-129
    • Mota, E.1    Campos, V.2    Corberan, A.3
  • 30
    • 0031071257 scopus 로고    scopus 로고
    • Split-delivery routing heuristics in livestock feed distribution
    • 0888.90109
    • P.A. Mullaseril M. Dror J. Leung 1997 Split-delivery routing heuristics in livestock feed distribution J. Oper. Res. Soc. 48 2 107 116 0888.90109
    • (1997) J. Oper. Res. Soc. , vol.48 , Issue.2 , pp. 107-116
    • Mullaseril, P.A.1    Dror, M.2    Leung, J.3
  • 32
    • 14844361815 scopus 로고    scopus 로고
    • A variable neighborhood search for the multi depot vehicle routing problem with time windows
    • DOI 10.1007/s10732-005-5432-5
    • M. Polacek R.F. Hartl K. Doerner M. Reimann 2004 A variable neighborhood search for the multi depot vehicle routing problem with time windows J. Heur. 105 6 613 627 10.1007/s10732-005-5432-5 (Pubitemid 40356746)
    • (2004) Journal of Heuristics , vol.10 , Issue.6 , pp. 613-627
    • Polacek, M.1    Hartl, R.F.2    Doerner, K.3    Reimann, M.4
  • 33
    • 0032364079 scopus 로고    scopus 로고
    • Routing helicopters for crew exchanges on off-shores locations
    • 0895.90133 10.1023/A:1018900705946
    • G. Sierksma G. Tijssen 1998 Routing helicopters for crew exchanges on off-shores locations Ann. Oper. Res. 76 1-4 261 286 0895.90133 10.1023/A:1018900705946
    • (1998) Ann. Oper. Res. , vol.76 , Issue.1-4 , pp. 261-286
    • Sierksma, G.1    Tijssen, G.2
  • 34
    • 0036642715 scopus 로고    scopus 로고
    • A practical approach to solving a newspaper logistics problem using a digital map
    • DOI 10.1016/S0360-8352(02)00077-3, PII S0360835202000773
    • S.H. Song K.S. Lee G.S. Kim 2002 A practical approach to solving a newspaper logistics problem using a digital map Comput. Ind. Eng. 43 1-2 315 330 10.1016/S0360-8352(02)00077-3 (Pubitemid 34551915)
    • (2002) Computers and Industrial Engineering , vol.43 , Issue.1-2 , pp. 315-330
    • Song, S.H.1    Lee, K.S.2    Kim, G.S.3
  • 35
    • 34248995958 scopus 로고    scopus 로고
    • A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing
    • DOI 10.1016/j.jfranklin.2005.12.002, PII S0016003205001171
    • R. Tavakkoli-Moghaddam N. Safaei M. Kah M. Rabbani 2007 A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing J. Franklin Inst. 344 5 406 425 10.1016/j.jfranklin.2005.12. 002 2327930 (Pubitemid 46779009)
    • (2007) Journal of the Franklin Institute , vol.344 , Issue.5 , pp. 406-425
    • Tavakkoli-Moghaddam, R.1    Safaei, N.2    Kah, M.M.O.3    Rabbani, M.4
  • 36
    • 77952241550 scopus 로고    scopus 로고
    • Solving the split delivery vehicle routing problem with a loaded travel cost objective
    • G. Bayraksan, W. Lin, Y. Son, R. Wysk (eds.) Nashville, TN. Institute of Industrial Engineers
    • Wilck, J., Cavalier, T.: Solving the split delivery vehicle routing problem with a loaded travel cost objective. In: G. Bayraksan, W. Lin, Y. Son, R. Wysk (eds.) Proceedings 2007 Industrial Engineering Research Conference, Nashville, TN. Institute of Industrial Engineers (2007)
    • (2007) Proceedings 2007 Industrial Engineering Research Conference
    • Wilck, J.1    Cavalier, T.2
  • 37
    • 77952242305 scopus 로고    scopus 로고
    • Large scale inventory routing problem with split delivery: A new model and Lagrangian relaxation approach
    • 10.1504/IJSOI.2006.011018
    • Y. Yu H. Chen F. Chu 2006 Large scale inventory routing problem with split delivery: a new model and Lagrangian relaxation approach Int. J. Serv. Oper. Inform. 1 3 304 320 10.1504/IJSOI.2006.011018
    • (2006) Int. J. Serv. Oper. Inform. , vol.1 , Issue.3 , pp. 304-320
    • Yu, Y.1    Chen, H.2    Chu, F.3

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.