메뉴 건너뛰기




Volumn , Issue , 2010, Pages

Towards probabilistic memetic algorithm: An initial study on capacitated arc routing problem

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTATION MECHANISM; CAPACITATED ARC ROUTING PROBLEM; EXPERIMENTAL STUDIES; GLOBAL EXPLORATION; MEDIUM SIZE; MEMETIC ALGORITHMS; META-HEURISTIC SEARCH; REAL-WORLD PROBLEM; SEARCH PERFORMANCE;

EID: 79959425915     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2010.5585993     Document Type: Conference Paper
Times cited : (20)

References (40)
  • 2
    • 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. 141, no. 1-4, pp. 159-185, 2004.
    • (2004) Annals of Operational Research , vol.141 , Issue.1-4 , pp. 159-185
    • Lacomme, P.1    Prins, C.2    Ramdane-Chérif, W.3
  • 3
    • 70449922699 scopus 로고    scopus 로고
    • Improved memetic algorithm for capacitated arc routing problem
    • Y. Mei, K. Tang, and X. Yao, "Improved memetic algorithm for capacitated arc routing problem," IEEE Congress on Evolutionary Computation, pp. 1699-1706, 2009.
    • (2009) IEEE Congress on Evolutionary Computation , pp. 1699-1706
    • Mei, Y.1    Tang, K.2    Yao, X.3
  • 4
    • 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. 1159-1166, 2009.
    • (2009) IEEE Transactions on Evolutionary Computation , vol.13 , Issue.5 , pp. 1159-1166
    • Tang, K.1    Mei, Y.2    Yao, X.3
  • 6
    • 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
  • 9
    • 2442564517 scopus 로고    scopus 로고
    • Utilizing lamarckian evolution and the baldwin effect in hybrid genetic algorithms
    • Meta-Heuristic Research and Applications Group, Department of Industrial Engineering, North Carolina State University
    • C. Houck, J. Joines, and M. Kay, "Utilizing lamarckian evolution and the baldwin effect in hybrid genetic algorithms," NCSU-IE Technical Report 96-01, Meta-Heuristic Research and Applications Group, Department of Industrial Engineering, North Carolina State University, 1996.
    • (1996) NCSU-IE Technical Report 96-01
    • Houck, C.1    Joines, J.2    Kay, M.3
  • 11
    • 0037394089 scopus 로고    scopus 로고
    • Evolutionary optimization of computationally expensive problems via surrogate modeling
    • Y. S. Ong, P. B. Nair, and A. J. Keane, "Evolutionary optimization of computationally expensive problems via surrogate modeling," American Institute of Aeronautics and Astronautics Journal, vol. 41, no. 4, pp. 687-696, 2003.
    • (2003) American Institute of Aeronautics and Astronautics Journal , vol.41 , Issue.4 , pp. 687-696
    • Ong, Y.S.1    Nair, P.B.2    Keane, A.J.3
  • 12
    • 77951287415 scopus 로고    scopus 로고
    • Lamarckian memetic algorithms: Local optimum and connectivity structure analysis
    • M. N. Le, Y. S. Ong, Y. C. Jin, and B. Sendhoff, "Lamarckian memetic algorithms: local optimum and connectivity structure analysis," Memetic Computing, vol. 1, no. 3, pp. 175-190, 2009.
    • (2009) Memetic Computing , vol.1 , Issue.3 , pp. 175-190
    • Le, M.N.1    Ong, Y.S.2    Jin, Y.C.3    Sendhoff, B.4
  • 13
    • 77949307685 scopus 로고    scopus 로고
    • Hybrid immune algorithm with lamarckian local search for multi-objective optimization
    • M. G. Gong, C. Liu, L. C. Jiao, and G. Cheng, "Hybrid immune algorithm with lamarckian local search for multi-objective optimization," Memetic Computing, vol. 2, no. 1, pp. 47-67, 2009.
    • (2009) Memetic Computing , vol.2 , Issue.1 , pp. 47-67
    • Gong, M.G.1    Liu, C.2    Jiao, L.C.3    Cheng, G.4
  • 14
    • 79251627173 scopus 로고    scopus 로고
    • Selecting survivors in genetic algorithm using tabu search strategies
    • C. K. Ting, C. F. Ko, and C. H. Huang, "Selecting survivors in genetic algorithm using tabu search strategies," Memetic Computing, vol. 1, no. 3, pp. 191-203, 2009.
    • (2009) Memetic Computing , vol.1 , Issue.3 , pp. 191-203
    • Ting, C.K.1    Ko, C.F.2    Huang, C.H.3
  • 15
    • 70349332825 scopus 로고    scopus 로고
    • Development and investigation of efficient ga/pso-hybrid algorithm applicable to real-world design optimization
    • J. Shinkyu, S. Hasegawa, K. Shimoyama, and S. Obayashi, "Development and investigation of efficient ga/pso-hybrid algorithm applicable to real-world design optimization," IEEE Computational Intelligence Magazine, vol. 4, no. 3, pp. 36-44, 2009.
    • (2009) IEEE Computational Intelligence Magazine , vol.4 , Issue.3 , pp. 36-44
    • Shinkyu, J.1    Hasegawa, S.2    Shimoyama, K.3    Obayashi, S.4
  • 16
    • 77949320940 scopus 로고    scopus 로고
    • Hmoam: Hybrid multi-objective genetic optimization for facial analysis by appearance model
    • A. Sattar and R. Seguier, "Hmoam: hybrid multi-objective genetic optimization for facial analysis by appearance model," Memetic Computing, vol. 2, no. 1, pp. 25-46, 2010.
    • (2010) Memetic Computing , vol.2 , Issue.1 , pp. 25-46
    • Sattar, A.1    Seguier, R.2
  • 19
  • 23
    • 65149102896 scopus 로고    scopus 로고
    • Memetic algorithms for solving job-shop scheduling problems
    • S. M. K. Hasan, R. Sarker, D. Essam, and D. Cornforth, "Memetic algorithms for solving job-shop scheduling problems," Memetic Computing, vol. 1, no. 1, pp. 69-83, 2008.
    • (2008) Memetic Computing , vol.1 , Issue.1 , pp. 69-83
    • Hasan, S.M.K.1    Sarker, R.2    Essam, D.3    Cornforth, D.4
  • 25
    • 40649098482 scopus 로고    scopus 로고
    • Parallel memetic algorithm with delective local search for large scale quadratic assignment problems
    • J. Tang, M. H. Lim, and Y. S. Ong, "Parallel memetic algorithm with delective local search for large scale quadratic assignment problems," International Journal of Innovative Computing, Information and Control, vol. 2, no. 6, pp. 1399-1416, 2006.
    • (2006) International Journal of Innovative Computing, Information and Control , vol.2 , Issue.6 , pp. 1399-1416
    • Tang, J.1    Lim, M.H.2    Ong, Y.S.3
  • 26
    • 34247380230 scopus 로고    scopus 로고
    • Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems
    • -, "Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems," Soft Computing Journal, vol. 11, no. 9, pp. 873-888, 2007.
    • (2007) Soft Computing Journal , vol.11 , Issue.9 , pp. 873-888
    • Tang, J.1    Lim, M.H.2    Ong, Y.S.3
  • 29
    • 4544245255 scopus 로고    scopus 로고
    • Real-coded memetic algorithms with crossover hill-climbing
    • M. Lozano, F. Herrera, N. Krasnogor, and D. Molina, "Real-coded memetic algorithms with crossover hill-climbing," Evolutionary Computation, vol. 12, no. 3, pp. 273-302, 2004.
    • (2004) Evolutionary Computation , vol.12 , Issue.3 , pp. 273-302
    • Lozano, M.1    Herrera, F.2    Krasnogor, N.3    Molina, D.4
  • 31
    • 0033730795 scopus 로고    scopus 로고
    • A study of the lamarckian evolution of recurrent neural networks
    • K. W. C. Ku, M. W. Mak, and W. C. Siu, "A study of the lamarckian evolution of recurrent neural networks," IEEE Transactions on Evolutionary Computation, vol. 4, no. 1, pp. 31-42, 2000.
    • (2000) IEEE Transactions on Evolutionary Computation , vol.4 , Issue.1 , pp. 31-42
    • Ku, K.W.C.1    Mak, M.W.2    Siu, W.C.3
  • 35
    • 33846108436 scopus 로고    scopus 로고
    • Distance measures based on the edit distance for permutation-type representations
    • K. Sörensen, "Distance measures based on the edit distance for permutation-type representations," J. Heuristics, vol. 13, no. 1, pp. 35-47, 2007.
    • (2007) J. Heuristics , vol.13 , Issue.1 , pp. 35-47
    • Sörensen, K.1
  • 36
  • 38
    • 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
  • 39
    • 4444297780 scopus 로고    scopus 로고
    • A tabu search based heuristic for arc routing with a capacity constraint and time deadline
    • I. H. Osman and J. P. Kelly, Eds. Boston: Kluwer Academic Publishers
    • R. W. Eglese and L. Y. O. Li, "A tabu search based heuristic for arc routing with a capacity constraint and time deadline," in Metaheuristics: theory and applications, I. H. Osman and J. P. Kelly, Eds. Boston: Kluwer Academic Publishers, pp. 633-650, 1996.
    • (1996) Metaheuristics: Theory and Applications , pp. 633-650
    • Eglese, R.W.1    Li, L.Y.O.2
  • 40
    • 0030086498 scopus 로고    scopus 로고
    • An interactive algorithm for vehicle routing for winter-gritting
    • L. Y. O. Li and R. W. Eglese, "An interactive algorithm for vehicle routing for winter-gritting," Journal of the Operational Research Society, vol. 47, no. 2, pp. 217-228, 1996.
    • (1996) Journal of the Operational Research Society , vol.47 , Issue.2 , pp. 217-228
    • Li, L.Y.O.1    Eglese, R.W.2


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