메뉴 건너뛰기




Volumn 4771 LNCS, Issue , 2007, Pages 16-30

An effective memetic algorithm with population management for the split delivery vehicle routing problem

Author keywords

Distance measure; Memetic algorithm; Split delivery vehicle routing problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL EFFICIENCY; DISTANCE MEASUREMENT; VEHICLE ROUTING;

EID: 38149137304     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75514-2_2     Document Type: Conference Paper
Times cited : (61)

References (23)
  • 1
    • 33644585064 scopus 로고    scopus 로고
    • A tabu search algorithm for the split delivery vehicle routing problem
    • Archetti, C., Hertz, A., Speranza, M.G.: A tabu search algorithm for the split delivery vehicle routing problem. Transportation Science 40(1), 64-73 (2006)
    • (2006) Transportation Science , vol.40 , Issue.1 , pp. 64-73
    • Archetti, C.1    Hertz, A.2    Speranza, M.G.3
  • 2
    • 33646716139 scopus 로고    scopus 로고
    • Worst-case analysis for split delivery vehicle routing problems
    • Archetti, C., Savelsbergh, M.W.P., Speranza, M.G.: Worst-case analysis for split delivery vehicle routing problems. Transportation Science 40(2), 226-234 (2006)
    • (2006) Transportation Science , vol.40 , Issue.2 , pp. 226-234
    • Archetti, C.1    Savelsbergh, M.W.P.2    Speranza, M.G.3
  • 4
    • 0034262328 scopus 로고    scopus 로고
    • A lower bound for the split delivery vehicle routing problem
    • Belenguer, J.M., Martinez, M.C., Mota, E.: A lower bound for the split delivery vehicle routing problem. Operations Research 48(5), 801-810 (2000)
    • (2000) Operations Research , vol.48 , Issue.5 , pp. 801-810
    • Belenguer, J.M.1    Martinez, M.C.2    Mota, E.3
  • 5
    • 14644398507 scopus 로고    scopus 로고
    • Context-independent scatter search and tabu search for permutation problems
    • Campos, V., Marti, R., Laguna, M.: Context-independent scatter search and tabu search for permutation problems. INFORMS Journal on Computing 17, 111-122 (2005)
    • (2005) INFORMS Journal on Computing , vol.17 , pp. 111-122
    • Campos, V.1    Marti, R.2    Laguna, M.3
  • 6
    • 0000419596 scopus 로고
    • Scheduling of vehicles from a central depot to a number of delivery points
    • Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12, 568-581 (1964)
    • (1964) Operations Research , vol.12 , pp. 568-581
    • Clarke, G.1    Wright, J.W.2
  • 9
    • 0043059830 scopus 로고
    • Savings by split delivery routing
    • Dror, M., Trudeau, P.: Savings by split delivery routing. Transportation Science 23, 141-145 (1989)
    • (1989) Transportation Science , vol.23 , pp. 141-145
    • Dror, M.1    Trudeau, P.2
  • 12
    • 0029342706 scopus 로고
    • The split delivery vehicle scheduling problem with time windows and grid network distances
    • Frizzell, P.W., Giffin, J.W.: The split delivery vehicle scheduling problem with time windows and grid network distances. Computers and Operations Research 22(6), 655-667 (1995)
    • (1995) Computers and Operations Research , vol.22 , Issue.6 , pp. 655-667
    • Frizzell, P.W.1    Giffin, J.W.2
  • 14
    • 0028530194 scopus 로고
    • A tabu search heuristic for the vehicle routing problem
    • Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Management Science 40, 1276-1290 (1994)
    • (1994) Management Science , vol.40 , pp. 1276-1290
    • Gendreau, M.1    Hertz, A.2    Laporte, G.3
  • 15
    • 0001535867 scopus 로고
    • A heuristic algorithm for the vehicle dispatch problem
    • Gillett, B.E., Miller, L.R.: A heuristic algorithm for the vehicle dispatch problem. Operations Research 22, 340-349 (1974)
    • (1974) Operations Research , vol.22 , pp. 340-349
    • Gillett, B.E.1    Miller, L.R.2
  • 16
    • 0002345223 scopus 로고    scopus 로고
    • Memetic algorithms: A short introduction
    • Corne, D, Dorigo, M, Glover, F, eds, McGraw-Hill, New York
    • Moscato, P.: Memetic algorithms: a short introduction. In: Corne, D., Dorigo, M., Glover, F. (eds.) New ideas in optimization, pp. 219-234. McGraw-Hill, New York (1999)
    • (1999) New ideas in optimization , pp. 219-234
    • Moscato, P.1
  • 18
    • 2642522782 scopus 로고    scopus 로고
    • A simple and effective evolutionary algorithm for the vehicle routing problem
    • Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research 31, 1985-2002 (2004)
    • (2004) Computers and Operations Research , vol.31 , pp. 1985-2002
    • Prins, C.1
  • 19
    • 38149074707 scopus 로고    scopus 로고
    • Prins, C., Sevaux, M., Sörensen, K.: A genetic algorithm with population management (GA|PM) for the CARP. In: 5th Triennal Symposium on Transportation Analysis (Tristan V), Le Gosier, Guadeloupe (2004)
    • Prins, C., Sevaux, M., Sörensen, K.: A genetic algorithm with population management (GA|PM) for the CARP. In: 5th Triennal Symposium on Transportation Analysis (Tristan V), Le Gosier, Guadeloupe (2004)
  • 20
    • 0026225350 scopus 로고
    • Tsplib-travelling salesman problem library. ORSAJ
    • Reinelt, G.: Tsplib-travelling salesman problem library. ORSAJ. Comput. 3, 376-384 (1991)
    • (1991) Comput , vol.3 , pp. 376-384
    • Reinelt, G.1
  • 22
    • 26444605411 scopus 로고    scopus 로고
    • Sörensen, K., Sevaux, M.: MA|PM: memetic algorithms with population management. Computers and Operations Research 33, 1214-1225 (2006)
    • Sörensen, K., Sevaux, M.: MA|PM: memetic algorithms with population management. Computers and Operations Research 33, 1214-1225 (2006)


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