Loading…

Partitioning of transportation networks under disruption

Graph partitioning is an optimization problem that deals with dividing a large geographical transportation network into subnetworks in favor of balancing the workload and minimizing the communication among them. Over the past decades, various models have been developed in such a way to satisfy a mul...

Full description

Saved in:
Bibliographic Details
Published in:International journal of modelling & simulation 2017-07, Vol.37 (3), p.131-139
Main Authors: Ghavidelsyooki, Mona, Awasthi, Anjali, Allouche, M., Berger, J., Mitrovic Minic, Snezana
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Graph partitioning is an optimization problem that deals with dividing a large geographical transportation network into subnetworks in favor of balancing the workload and minimizing the communication among them. Over the past decades, various models have been developed in such a way to satisfy a multi-objective problem such as delivery time and managerial cost. In real life, because of inevitable changes during network's lifetime, it is vital to offer survivability and resilience in the existence of network failure and disruption. This paper proposes a partitioning technique called Hierarchical recursive progression1 + (HRP1 + ) that is scalable and can deal with large and complex networks. The HRP1 + method is an extension of the HRP1 algorithm. The approach is tested on benchmark data-sets using different disruption scenarios, including partial and complete disruptions on network edges and nodes.
ISSN:0228-6203
1925-7082
DOI:10.1080/02286203.2017.1297652