IDENTIFYING THE MOST CRITICAL p-NODES IN ARC CAPACITATED s-t FLOW NETWORKS UNDER LOCAL ATTACK CONSTRAINTS

Gökhan Karaköse; Elif Karaköse

Makale detayları

IDENTIFYING THE MOST CRITICAL p-NODES IN ARC CAPACITATED s-t FLOW NETWORKS UNDER LOCAL ATTACK CONSTRAINTS

Yazarlar:

Gökhan Karaköse | Elif Karaköse

Yayıncı:

Bartin University

Ana Başlıklar:

Modelleme ve Simülasyon

Dergi:

Akıllı Sistemler Dergisi Vol.2 Issue 1, pp.16-24

Belge Tipi:

Makale

Yayın Tarihi:

12/2023

Belge Dili:

Türkçe

Document ID (Org No.):

2001307209

pISSN:

3023-6150

Anahtar kelimeler:

Özet:

 This paper presents a novel network interdiction problem, the optimal removal of non-adjacent p-nodes for s-t flow networks such that the blocked flow between specific sources and destinations is maximized. First, the transformed model that modifies the recent best-performing arc disrupted model of the literature is presented to exactly address the studied problem here. Second, for the sake of computational improvements, a reduced model i.e., a model having significantly reducing constraints-and-variables specifically designed for this problem is introduced. The superiority of the reduced model over the transformed model was observed on the well-known relatively large size network. In particular, it was observed that the reduced formulation returned the best non-adjacent node combinations for all p values within a reasonable period of time, whereas the transformed model could not return optimal values for many p values even in three hour time frame.

 This paper presents a novel network interdiction problem, the optimal removal of non-adjacent p-nodes for s-t flow networks such that the blocked flow between specific sources and destinations is maximized. First, the transformed model that modifies the recent best-performing arc disrupted model of the literature is presented to exactly address the studied problem here. Second, for the sake of computational improvements, a reduced model i.e., a model having significantly reducing constraints-and-variables specifically designed for this problem is introduced. The superiority of the reduced model over the transformed model was observed on the well-known relatively large size network. In particular, it was observed that the reduced formulation returned the best non-adjacent node combinations for all p values within a reasonable period of time, whereas the transformed model could not return optimal values for many p values even in three hour time frame.

 This paper presents a novel network interdiction problem, the optimal removal of non-adjacent p-nodes for s-t flow networks such that the blocked flow between specific sources and destinations is maximized. First, the transformed model that modifies the recent best-performing arc disrupted model of the literature is presented to exactly address the studied problem here. Second, for the sake of computational improvements, a reduced model i.e., a model having significantly reducing constraints-and-variables specifically designed for this problem is introduced. The superiority of the reduced model over the transformed model was observed on the well-known relatively large size network. In particular, it was observed that the reduced formulation returned the best non-adjacent node combinations for all p values within a reasonable period of time, whereas the transformed model could not return optimal values for many p values even in three hour time frame.

 Bu makale, belirli kaynaklar ve hedefler arasındaki engellenen akışı en büyükleyecek şekilde s-t akış ağları için bitişik olmayan p-düğümlerinin optimum şekilde kaldırılmasını içeren yeni bir ağ kırılma problemi sunmaktadır. İlk olarak, literatürdeki en iyi performans gösteren ayrıt kırılması modelini değiştiren dönüştürülmüş model, burada incelenen problemi tam olarak ele almak için sunulmuştur. İkinci olarak, hesaplama iyileştirmeleri uğruna, bu problem için özel olarak tasarlanmış indirgenmiş bir model yani, önemli ölçüde azaltılmış kısıtlamalara ve değişkenlere sahip model tanıtılmıştır. İndirgenmiş modelin dönüştürülmüş modele göre üstünlüğü, iyi bilinen nispeten büyük boyutlu ulaşım ağı üzerinde gözlemlenmiştir. Özellikle, indirgenmiş formülasyonun tüm p değerleri için en iyi bitişik olmayan düğüm kombinasyonlarını makul bir süre içinde döndürdüğü, dönüştürülmüş modelin ise birçok p değeri için üç-saatlik zaman diliminde dahi optimum değerleri döndüremediği gözlemlenmiştir.

Makale detayları

IDENTIFYING THE MOST CRITICAL p-NODES IN ARC CAPACITATED s-t FLOW NETWORKS UNDER LOCAL ATTACK CONSTRAINTS

Yazarlar:

Gökhan Karaköse | Elif Karaköse

Yayıncı:

Bartin University

Ana Başlıklar:

Modelleme ve Simülasyon

Dergi:

Akıllı Sistemler Dergisi Vol.2 Issue 1, pp.16-24

Belge Tipi:

Makale

Yayın Tarihi:

12/2023

Belge Dili:

Türkçe

Document ID (Org No.):

2001307209

pISSN:

3023-6150

Optimization

critical node detection

network interdiction

local protection

arc-capacitated flow networkOptimizasyon

kritik düğüm tespiti

ağ kırılma

yerel koruma

ayrıt kapasiteli akış ağı

Sayı

Makale detayları

Yazarlar: Gökhan Karaköse | Elif Karaköse

Yayıncı: Bartin University

Ana Başlıklar: Modelleme ve Simülasyon

Dergi: Akıllı Sistemler Dergisi Vol.2 Issue 1, pp.16-24

Belge Tipi: Makale

Yayın Tarihi: 12/2023

Belge Dili: Türkçe

Document ID (Org No.): 2001307209

pISSN: 3023-6150

Sayı

Yazarlar:

Gökhan Karaköse | Elif Karaköse

Yayıncı:

Bartin University

Ana Başlıklar:

Modelleme ve Simülasyon

Dergi:

Akıllı Sistemler Dergisi Vol.2 Issue 1, pp.16-24

Belge Tipi:

Makale

Yayın Tarihi:

12/2023

Belge Dili:

Türkçe

Document ID (Org No.):

2001307209

pISSN:

3023-6150