메뉴 건너뛰기




Volumn 18, Issue 4, 2000, Pages 51-65

Advanced multi-objective evolutionary algorithms applied to two problems in telecommunications

(3)  Knowles, J a   Oates, M a   Corne, D a  

a NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DISTRIBUTED DATABASE SYSTEMS; OPTIMIZATION; RELIABILITY;

EID: 0034427832     PISSN: 13583948     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1026754608572     Document Type: Article
Times cited : (28)

References (28)
  • 5
    • 0000852513 scopus 로고
    • Multi-objective optmisation using nondominated sorting in genetic algorithms
    • Srinivas N and Deb K: 'Multi-objective optmisation using nondominated sorting in genetic algorithms'. Evolutionary Computation. 2, No 3, pp 221-248 (1994).
    • (1994) Evolutionary Computation , vol.2 , Issue.3 , pp. 221-248
    • Srinivas, N.1    Deb, K.2
  • 6
    • 0009455948 scopus 로고
    • Multi-objective optimisation using the niched Pareto genetic algorithm
    • Illinois Genetic Algorithms Laboratory, University of Illinois
    • Horn J and Nafpliotis N: 'Multi-objective optimisation using the niched Pareto genetic algorithm'. IlliGAL. Report 93005. Illinois Genetic Algorithms Laboratory, University of Illinois (1994).
    • (1994) IlliGAL. Report 93005
    • Horn, J.1    Nafpliotis, N.2
  • 7
    • 84958962366 scopus 로고    scopus 로고
    • On the performance assessment and comparison of stochastic multi-objective optimisers
    • Voigt H M. Ebeling W. Rechenberg I and Schwefel II P (Eds). Springer Verlag Lecture Notes in Computer Science. Springer
    • Fonseca C M and Fleming P J: 'On the performance assessment and comparison of stochastic multi-objective optimisers', in Voigt H M. Ebeling W. Rechenberg I and Schwefel II P (Eds): 'Parallel Problem Solving from Nature - PPSN IV'. Springer Verlag Lecture Notes in Computer Science. Springer, pp 584-593 (1996).
    • (1996) Parallel Problem Solving from Nature - PPSN IV , pp. 584-593
    • Fonseca, C.M.1    Fleming, P.J.2
  • 11
    • 0742283316 scopus 로고    scopus 로고
    • A comparison of heuristics for telecommunications traffic routing
    • Rayward-Smith V J. Osman I H. Reeves C R and Smith G D (Eds). John Wiley and Sons Ltd
    • Mann J W and Smith G D: 'A comparison of heuristics for telecommunications traffic routing', in Rayward-Smith V J. Osman I H. Reeves C R and Smith G D (Eds): 'Modern Heuristic Search Methods'. John Wiley and Sons Ltd (1996).
    • (1996) Modern Heuristic Search Methods
    • Mann, J.W.1    Smith, G.D.2
  • 13
    • 2242462784 scopus 로고    scopus 로고
    • Exploring Evolutionary approaches to distributed database management
    • Corne D W. Oates M J and Smith G D (Eds). John Wiley and Sons Ltd.
    • Oates M J and Corne D W: 'Exploring Evolutionary approaches to distributed database management', in Corne D W. Oates M J and Smith G D (Eds): 'Telecommunications Optimisation: heuristic and adaptive techniques'. John Wiley and Sons Ltd. pp 235-264 (2000).
    • (2000) Telecommunications Optimisation: Heuristic and Adaptive Techniques , pp. 235-264
    • Oates, M.J.1    Corne, D.W.2
  • 15
    • 85018104842 scopus 로고    scopus 로고
    • Pareto simulated annealing, a metheuristic technique for multiple-objective combinatorial optimisation
    • Czyzak P and Jaszkiewicz A: 'Pareto simulated annealing, a metheuristic technique for multiple-objective combinatorial optimisation'. Journal of Multi-Criteria Decision Analysis. 3, No 1, pp 34-17 (1998).
    • (1998) Journal of Multi-Criteria Decision Analysis , vol.3 , Issue.1 , pp. 34-117
    • Czyzak, P.1    Jaszkiewicz, A.2
  • 16
    • 0012646087 scopus 로고    scopus 로고
    • A tabu search procedure to solve multi-objective combinatorial optimisation problems
    • Caballero R and Steuer R (Eds). Springer Verlag
    • Gandibleux X. Mezdaoui N. and Fréville A: 'A tabu search procedure to solve multi-objective combinatorial optimisation problems'. in Caballero R and Steuer R (Eds): 'Proceedings volume of MOPGP'96. Springer Verlag, pp 291-300 (1996).
    • (1996) Proceedings Volume of MOPGP'96 , pp. 291-300
    • Gandibleux, X.1    Mezdaoui, N.2    Fréville, A.3
  • 18
    • 0028585530 scopus 로고
    • A niched Pareto genetic algorithm for multy-objective optimisation
    • IEEE World Congress on Computational Intelligence. I. Piscataway
    • Horn J. Nafpliotis N and Goldberg D E: 'A niched Pareto genetic algorithm for multy-objective optimisation', in Proceedings of the First IEEE Conference un Evolutionary Computation. IEEE World Congress on Computational Intelligence. I. Piscataway, pp 67-72 (1994).
    • (1994) Proceedings of the First IEEE Conference un Evolutionary Computation , pp. 67-72
    • Horn, J.1    Nafpliotis, N.2    Goldberg, D.E.3
  • 19
    • 0033318858 scopus 로고    scopus 로고
    • Multi-objective evolutionary algorithms: A comparative case study and the strength Pareto approach
    • Zitzler E and Thiele L: 'Multi-objective evolutionary algorithms: a comparative case study and the strength Pareto approach'. IEEE Transactions on Evolutionary Computation. 3, No 4, pp 257-271 (1999).
    • (1999) IEEE Transactions on Evolutionary Computation , vol.3 , Issue.4 , pp. 257-271
    • Zitzler, E.1    Thiele, L.2
  • 20
    • 0034199912 scopus 로고    scopus 로고
    • Approximating the nondominated front using the Pareto archieved evolution strtegy
    • Knowles J D and Corne DW: 'Approximating the nondominated front using the Pareto archieved evolution strtegy'. Evolutionary Computation. 8, No 2, pp 149-172 (2000).
    • (2000) Evolutionary Computation , vol.8 , Issue.2 , pp. 149-172
    • Knowles, J.D.1    Corne, D.W.2
  • 23
    • 0002345223 scopus 로고    scopus 로고
    • Memetic algorithms: An introduction
    • Corne D. Dorigo M and Glover F-' (Eds). McGraw-Hill
    • Moscato P: 'Memetic algorithms: an introduction'. in Corne D. Dorigo M and Glover F-' (Eds): 'New Ideas in Optimisation'. McGraw-Hill (1999).
    • (1999) New Ideas in Optimisation
    • Moscato, P.1
  • 24
    • 0000663732 scopus 로고
    • Finding the K shortest loopless paths in a network
    • Yen J Y. 'Finding the K shortest loopless paths in a network'. Management Science. 17, No 11 (1971).
    • (1971) Management Science , vol.17 , Issue.11
    • Yen, J.Y.1
  • 26
    • 0019280027 scopus 로고
    • Degree constrained minimum spanning tree
    • Narula S C and Ho C A: 'Degree constrained minimum spanning tree'. Computers and operations research 7, No 4, pp . 39-49 (1980).
    • (1980) Computers and Operations Research , vol.7 , Issue.4 , pp. 39-49
    • Narula, S.C.1    Ho, C.A.2


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