Development of Evolutionary Algorithms for Determining the k most Vital Arcs in Shortest Path Problem

최단경로문제에서 k-치명호를 결정하는 진화 알고리듬의 개발

  • Published : 2001.06.01

Abstract

The purpose of this study is to present methods for determining the k most vital arcs (k-MVAs) in shortest path problem (SPP) using evolutionary algorithms. The problem of finding the k-MVAs in SPP is to find a set of k arcs whose simultaneous removal from the network causes the greatest increase in the shortest distance between two specified nodes. Generally, the problem of determining the k-MVAs in SPP has been known as NP-hard. Therefore, to deal with problems of the real world, heuristic algorithms are needed. In this study we present three kinds of evolutionary algorithms for finding the k-MVAs in SPP, and then to evaluate the performance of proposed algorithms.

Keywords

References

  1. 메타휴리스틱 - 유전알고리듬,시뮬레이티드 어닐링, 타부서치 김여근;윤복식;이상복
  2. 한국경영과학회지 v.23 no.4 최단경로문제에서 k개의 치명호를 찾는 방법 안재근;정호연;박순달
  3. 한국군사운영분석학회지 v.25 no.2 최대유통문제에서 k-MVA를 결정하는 방법 정호연
  4. Network Flows: Theory, Algorithms, and Applications Ahuja, R.J.;T.L. Magnanti;J.B. Orin
  5. Operations Research Letters v.8 Finding the Most Vital Arcs in a Networks Ball M.O.;B.L. Golden;R.V. Vohra
  6. Univ. of Maryland Technical Reports The Complexity of Finding Most Vital Arcs and Nodes Bar-Noy A.;S. Khuller;B. Schieber
  7. Operations Research Letters v.1 no.4 Most Vital Links and Nodes in Weighted Networks Corley JR. H.W.;D.Y. Sha
  8. DIMACS
  9. Goldberg A.V.
  10. Naval Research Logistic Quarterly v.18 no.4 Determining the Most Vital Link in a Flow Network Lubore, S.H.;H.D. Ratliff;G.T. Sicilia
  11. Operations Research Letters v.8 The k Most Vital Arcs in the Shortest Path Problem Malik K.;A.K. Mittal;S.K. Gupta
  12. Management Science v.21 no.5 Finding the n Most Vital Links in a Flow Network Ratliff H.D.;S.H. Lubore;G.T. Sicilia
  13. ICGA A Genetic Algorithm Applied to the Maximum Flow Problem Munakata;D.J. Hashier