메뉴 건너뛰기




Volumn , Issue , 2006, Pages 420-427

Particle Swarm Optimization for the Bi-objective degree-constrained minimum spanning tree

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; EVOLUTIONARY ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL OPERATORS; PROBLEM SOLVING;

EID: 34547374320     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (13)

References (23)
  • 1
    • 0035400652 scopus 로고    scopus 로고
    • Minimum-weight spanning tree algorithms a survey and empirical study
    • C. F. Bazlamaçci and K. S. Hindi. "Minimum-weight spanning tree algorithms a survey and empirical study," Computers and Operations Research, vol. 28, pp. 767-785, 2001.
    • (2001) Computers and Operations Research , vol.28 , pp. 767-785
    • Bazlamaçci, C.F.1    Hindi, K.S.2
  • 3
    • 0035364338 scopus 로고    scopus 로고
    • Genetic algorithms for communications network design - An empirical study if the factors that influence performance
    • June
    • H. Chou, G. Premkumar, and C-H. Chu. "Genetic algorithms for communications network design - An empirical study if the factors that influence performance," IEEE Transactions on Evolutionary Computation, vol. 4, no. 3, pp. 236-249, June 2001.
    • (2001) IEEE Transactions on Evolutionary Computation , vol.4 , Issue.3 , pp. 236-249
    • Chou, H.1    Premkumar, G.2    Chu, C.-H.3
  • 4
    • 85133775397 scopus 로고    scopus 로고
    • A comprehensive survey of evolutionary-based multiobjective optimization techniques
    • C.A. Coello. "A comprehensive survey of evolutionary-based multiobjective optimization techniques," Knowledge and Information Systems, vol.1, pp. 269-308, 1999.
    • (1999) Knowledge and Information Systems , vol.1 , pp. 269-308
    • Coello, C.A.1
  • 5
    • 84875225856 scopus 로고    scopus 로고
    • Approximation algorithms for combinatorial multicriteria optimization problems
    • M. Ehrgott. "Approximation algorithms for combinatorial multicriteria optimization problems," International Transactions in Operational Research, vol. 7, pp. 5-31, 2000.
    • (2000) International Transactions in Operational Research , vol.7 , pp. 5-31
    • Ehrgott, M.1
  • 6
    • 0001322778 scopus 로고    scopus 로고
    • A survey and annotated bibliography of multiobjective combinatorial optimization
    • M. Ehrgott, and X. Gandibleux. "A survey and annotated bibliography of multiobjective combinatorial optimization," OR Spektrum, vol. 22, pp. 425-460, 2000.
    • (2000) OR Spektrum , vol.22 , pp. 425-460
    • Ehrgott, M.1    Gandibleux, X.2
  • 7
    • 24644495446 scopus 로고    scopus 로고
    • Approximative solution methods for multiobjective combinatorial optimization
    • M. Ehrgott, and X. Gandibleux. "Approximative solution methods for multiobjective combinatorial optimization," Top, vol. 12, no. 1, pp. 1-89, 2004.
    • (2004) Top , vol.12 , Issue.1 , pp. 1-89
    • Ehrgott, M.1    Gandibleux, X.2
  • 9
    • 34547256964 scopus 로고    scopus 로고
    • F. Glover. Parametric combinations of local job shop rules, Chapter IV, ONR Research Memorandum N. 117, GSIA, Carnegie Mellon University, Pittsburgh, PA, 1963.
    • F. Glover. "Parametric combinations of local job shop rules," Chapter IV, ONR Research Memorandum N. 117, GSIA, Carnegie Mellon University, Pittsburgh, PA, 1963.
  • 10
    • 0347899800 scopus 로고    scopus 로고
    • Fundamentals of scatter search and path relinking
    • F. Glover, M. Laguna, and R. Marti. "Fundamentals of scatter search and path relinking," Control and Cybernetics, vol. 29, no. 3, pp. 653-684, 2000.
    • (2000) Control and Cybernetics , vol.29 , Issue.3 , pp. 653-684
    • Glover, F.1    Laguna, M.2    Marti, R.3
  • 11
    • 0002726668 scopus 로고
    • On the history of the minimum spanning tree problem
    • R. L. Graham and P. Hell. "On the history of the minimum spanning tree problem," Ann. History of Comp., vol. 7, pp. 43-57, 1985.
    • (1985) Ann. History of Comp , vol.7 , pp. 43-57
    • Graham, R.L.1    Hell, P.2
  • 12
    • 0002585030 scopus 로고
    • A stochastic nonlinear model for coordinated bird flocks
    • S. Krasner, Ed, AAAS Publications, Washington, DC
    • F. Heppner, and U. Grenander. "A stochastic nonlinear model for coordinated bird flocks," in The Ubiquity of Caos, S. Krasner, Ed., AAAS Publications, Washington, DC, 1990.
    • (1990) The Ubiquity of Caos
    • Heppner, F.1    Grenander, U.2
  • 14
    • 0037952131 scopus 로고    scopus 로고
    • Local-search and hybrid evolutionary algorithms for Pareto optimization,
    • PhD dissertation, Department of Computer Science, University of Reading, Reading, UK
    • J.D. Knowles. "Local-search and hybrid evolutionary algorithms for Pareto optimization," PhD dissertation, Department of Computer Science, University of Reading, Reading, UK, 2002.
    • (2002)
    • Knowles, J.D.1
  • 16
    • 70350674995 scopus 로고
    • On the shortest spanning subtree of a graph and the travelling salesman problem
    • J. B. Kruskal. "On the shortest spanning subtree of a graph and the travelling salesman problem," Prie. AMS, vol. 7, pp. 48-50, 1956.
    • (1956) Prie. AMS , vol.7 , pp. 48-50
    • Kruskal, J.B.1
  • 17
    • 1342287329 scopus 로고    scopus 로고
    • Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization
    • G.C Onwubulu, M. Clerc. "Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization," International Journal of Production Research, vol. 42, no. 3, pp. 473-491, 2004.
    • (2004) International Journal of Production Research , vol.42 , Issue.3 , pp. 473-491
    • Onwubulu, G.C.1    Clerc, M.2
  • 19
    • 84911584312 scopus 로고
    • Shortest connection networks and some generalizations
    • R. C. Prim. "Shortest connection networks and some generalizations,". Bell Systems Techn. J., vol. 36, pp. 1389-1401, 1957.
    • (1957) Bell Systems Techn. J , vol.36 , pp. 1389-1401
    • Prim, R.C.1
  • 20
    • 0038479945 scopus 로고    scopus 로고
    • Edge sets: An efficient evolutionary coding of spanning trees
    • G. Raidl, and B.A. Julstrom. "Edge sets: an efficient evolutionary coding of spanning trees," IEEE Transactions on Evolutionary Computation, vol. 7, no. 3, pp. 225-239, 2003.
    • (2003) IEEE Transactions on Evolutionary Computation , vol.7 , Issue.3 , pp. 225-239
    • Raidl, G.1    Julstrom, B.A.2
  • 21
    • 0020779822 scopus 로고
    • Particle systems technique for modeling a class of fuzzy objects
    • W.T. Reeves. "Particle systems technique for modeling a class of fuzzy objects," Computer Graphics, vol. 17, no. 3, pp. 359-376, 1983.
    • (1983) Computer Graphics , vol.17 , Issue.3 , pp. 359-376
    • Reeves, W.T.1
  • 22
    • 0023379184 scopus 로고
    • Flocks, herds and schools: A distributed behavioral model
    • C.W. Reynolds. "Flocks, herds and schools: a distributed behavioral model," Computer Graphics, vol. 21, no. 4, pp. 24-34, 1987.
    • (1987) Computer Graphics , vol.21 , Issue.4 , pp. 24-34
    • Reynolds, C.W.1


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