메뉴 건너뛰기




Volumn , Issue , 2010, Pages

Memetic algorithm with heuristic candidate list strategy for Capacitated Arc Routing Problem

Author keywords

[No Author keywords available]

Indexed keywords

CANDIDATE LIST; CAPACITATED ARC ROUTING PROBLEM; COMPUTATIONAL TIME; EXCELLENT PERFORMANCE; HEURISTIC STRATEGY; IMPROVED ALGORITHM; LARGE SIZES; LOCAL SEARCH; LOCAL SEARCH OPERATORS; MEMETIC ALGORITHMS; NEIGHBORHOOD SEARCH; SOLUTION QUALITY;

EID: 79959431724     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2010.5586042     Document Type: Conference Paper
Times cited : (12)

References (19)
  • 2
    • 33644977676 scopus 로고    scopus 로고
    • Robust route optimization for gritting/salting trucks: A CERCIA experience
    • H. Handa, L. Chapman, and X. Yao, "Robust route optimization for gritting/salting trucks: a CERCIA experience," IEEE Computational Intelligence Magazine, vol. 1, no. 1, pp. 6-9, 2006.
    • (2006) IEEE Computational Intelligence Magazine , vol.1 , Issue.1 , pp. 6-9
    • Handa, H.1    Chapman, L.2    Yao, X.3
  • 3
    • 0019609540 scopus 로고
    • Capacitated arc routing problems
    • B. Golden and R. Wong, "Capacitated arc routing problems," Networks, vol. 11, no. 3, pp. 305-315, 1981.
    • (1981) Networks , vol.11 , Issue.3 , pp. 305-315
    • Golden, B.1    Wong, R.2
  • 4
    • 0020543990 scopus 로고
    • Computational experiments with algorithms for a class of routing problems
    • B. Golden, J. DeArmon, and E. Baker, "Computational experiments with algorithms for a class of routing problems," Computers and Operations Research, vol. 10, no. 1, pp. 47-59, 1983.
    • (1983) Computers and Operations Research , vol.10 , Issue.1 , pp. 47-59
    • Golden, B.1    DeArmon, J.2    Baker, E.3
  • 5
    • 0022404041 scopus 로고
    • The fleet size and mix problem for capacitated arc routing
    • G. Ulusoy, "The fleet size and mix problem for capacitated arc routing," European Journal of Operational Research, vol. 22, no. 3, pp. 329-337, 1985.
    • (1985) European Journal of Operational Research , vol.22 , Issue.3 , pp. 329-337
    • Ulusoy, G.1
  • 6
    • 0033718405 scopus 로고    scopus 로고
    • A tabu search heuristic for the capacitated arc routing problem
    • A. Hertz, G. Laporte, and M. Mittaz, "A tabu search heuristic for the capacitated arc routing problem," Operations Research, vol. 48, no. 1, pp. 129-135, 2000.
    • (2000) Operations Research , vol.48 , Issue.1 , pp. 129-135
    • Hertz, A.1    Laporte, G.2    Mittaz, M.3
  • 7
    • 0035520559 scopus 로고    scopus 로고
    • A variable neighborhood descent algorithm for the undirected capacitated arc routing problem
    • A. Hertz and M. Mittaz, "A variable neighborhood descent algorithm for the undirected capacitated arc routing problem," Transportation Science, vol. 35, no. 4, pp. 425-434, 2001.
    • (2001) Transportation Science , vol.35 , Issue.4 , pp. 425-434
    • Hertz, A.1    Mittaz, M.2
  • 8
    • 4444280768 scopus 로고    scopus 로고
    • Competitive memetic algorithms for arc routing problem
    • P. Lacomme, C. Prins, and W. Ramdane-Chérif, "Competitive memetic algorithms for arc routing problem," Annals of Operational Research, vol. 131, no. 1-4, pp. 159-185, 2004.
    • (2004) Annals of Operational Research , vol.131 , Issue.1-4 , pp. 159-185
    • Lacomme, P.1    Prins, C.2    Ramdane-Chérif, W.3
  • 9
    • 35248873900 scopus 로고    scopus 로고
    • A deterministic tabu search algorithm for the capacitated arc routing problem
    • J. Brandao and R. Eglese, "A deterministic tabu search algorithm for the capacitated arc routing problem," Computers and Operations Research, vol. 35, no. 4, pp. 1112-1126, 2008.
    • (2008) Computers and Operations Research , vol.35 , Issue.4 , pp. 1112-1126
    • Brandao, J.1    Eglese, R.2
  • 11
    • 70349871709 scopus 로고    scopus 로고
    • Memetic Algorithm with Extended Neighborhood Search for Capacitated Arc Routing Problems
    • K. Tang, Y. Mei, and X. Yao, "Memetic Algorithm with Extended Neighborhood Search for Capacitated Arc Routing Problems," IEEE Transactions on Evolutionary Computation, vol. 13, no. 5, pp. 1151-1166, 2009.
    • (2009) IEEE Transactions on Evolutionary Computation , vol.13 , Issue.5 , pp. 1151-1166
    • Tang, K.1    Mei, Y.2    Yao, X.3
  • 12
    • 0034266683 scopus 로고    scopus 로고
    • Stochastic ranking for constrained evolutionary optimization
    • T. P. Runarsson and X. Yao, "Stochastic ranking for constrained evolutionary optimization," IEEE Transactions on Evolutionary Computation, vol. 4, no. 3, pp. 284-294, 2000.
    • (2000) IEEE Transactions on Evolutionary Computation , vol.4 , Issue.3 , pp. 284-294
    • Runarsson, T.P.1    Yao, X.2
  • 13
    • 20544477332 scopus 로고    scopus 로고
    • The vehicle routing problem with time windows part II: Genetic search
    • J. Potvin and S. Bengio, "The vehicle routing problem with time windows part II: genetic search," INFORMS journal on Computing, vol. 8, no. 2, p. 165, 1996.
    • (1996) INFORMS Journal on Computing , vol.8 , Issue.2 , pp. 165
    • Potvin, J.1    Bengio, S.2
  • 15
    • 21144460871 scopus 로고
    • The capacitated arc routing problem: Lower bounds
    • E. Benavent, V. Campos, A. Corberän, and E. Mota, "The capacitated arc routing problem: lower bounds," Networks, vol. 22, no. 7, pp. 669-690, 1992.
    • (1992) Networks , vol.22 , Issue.7 , pp. 669-690
    • Benavent, E.1    Campos, V.2    Corberän, A.3    Mota, E.4
  • 16
    • 38149147463 scopus 로고
    • Routing winter gritting vehicles
    • R. W. Eglese, "Routing winter gritting vehicles," Discrete Applied Mathematics, vol. 48, no. 3, pp. 231-244, 1994.
    • (1994) Discrete Applied Mathematics , vol.48 , Issue.3 , pp. 231-244
    • Eglese, R.W.1
  • 17
    • 67349120844 scopus 로고    scopus 로고
    • Ph.D. dissertation, Rupercht-Karls-Universitat, Heidelberg, Germany
    • D. Ahr, "Contributions to multiple postmen problems," Ph.D. dissertation, Rupercht-Karls-Universitat, Heidelberg, Germany, 2004.
    • (2004) Contributions to Multiple Postmen Problems
    • Ahr, D.1
  • 18
    • 33645298466 scopus 로고    scopus 로고
    • Exact methods based on node-routing formulations for undirected arc-routing problems
    • R. Baldacci and V. Maniezzo, "Exact methods based on node-routing formulations for undirected arc-routing problems," Networks, vol. 47, no. 1, pp. 52-60, 2006.
    • (2006) Networks , vol.47 , Issue.1 , pp. 52-60
    • Baldacci, R.1    Maniezzo, V.2
  • 19
    • 27344446543 scopus 로고    scopus 로고
    • Solving capacitated arc routing problems using a transformation to the CVRP
    • H. Longo, D. A. M. Poggi, and E. Uchoa, "Solving capacitated arc routing problems using a transformation to the CVRP." Computers and Operations Research, vol. 33, no. 6, pp. 1823-1837, 2006.
    • (2006) Computers and Operations Research , vol.33 , Issue.6 , pp. 1823-1837
    • Longo, H.1    Poggi, D.A.M.2    Uchoa, E.3


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