Partitioning of transportation networks under disruption

Abstract 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.

[1]  Mark S. Daskin,et al.  Planning for Disruptions in Supply Chain Networks , 2006 .

[2]  Tu Truong,et al.  An Application of Simulation Modelling and Optimization in Fisheries Management , 2010 .

[3]  K ÇetinkayaEgemen,et al.  Evaluation of network resilience, survivability, and disruption tolerance , 2013 .

[4]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[5]  Thomas Sauerwald,et al.  A new diffusion-based multilevel algorithm for computing graph partitions of very high quality , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[6]  Chuanyi Ji,et al.  Large-Scale Inference of Network-Service Disruption upon Natural Disasters , 2008, KDD Workshop on Knowledge Discovery from Sensor Data.

[7]  Taieb Znati,et al.  On Approximation of New Optimization Methods for Assessing Network Vulnerability , 2010, 2010 Proceedings IEEE INFOCOM.

[8]  Robert van Engelen,et al.  Graph Partitioning for High Performance Scienti c Simulations , 2000 .

[9]  Haodong Li,et al.  Optimal feeder service plan design of cargo express train in railway hub , 2016 .

[10]  Bruce Hendrickson,et al.  An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations , 1995, SIAM J. Sci. Comput..

[11]  Karen Dragon Devine,et al.  Partitioning and Dynamic Load Balancing for the Numerical Solution of Partial Differential Equations , 2006 .

[12]  Rupak Biswas,et al.  HARP: a fast spectral partitioner , 1997, SPAA '97.

[13]  Fan Chung Graham,et al.  Local Graph Partitioning using PageRank Vectors , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[14]  Gary L. Miller,et al.  Geometric Mesh Partitioning: Implementation and Experiments , 1998, SIAM J. Sci. Comput..

[15]  S. M. Shahidehpour,et al.  Fuzzy Approach to Optimal Generation Scheduling for Gencos in Competitive Electricity Markets , 2010 .

[16]  S. Teng,et al.  A Cartesian Parallel Nested Dissection Algorithm , 1994 .

[17]  Leonid Oliker,et al.  PLUM: Parallel Load Balancing for Adaptive Unstructured Meshes , 1998, J. Parallel Distributed Comput..

[18]  Michel Parent,et al.  Algorithms for partitioning of large routing networks , 2010, J. Oper. Res. Soc..

[19]  Ralf Diekmann,et al.  PARTY - A Software Library for Graph Partitioning , 1997 .

[20]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[21]  Yongsheng Ding,et al.  Immune co-evolutionary algorithm based partition balancing optimization for tobacco distribution system , 2009, Expert Syst. Appl..

[22]  Nick Feamster,et al.  Diagnosing network disruptions with network-wide analysis , 2007, SIGMETRICS '07.

[23]  Anjali Awasthi,et al.  A system dynamics based simulation model to evaluate regulatory policies for sustainable transportation planning , 2017 .

[24]  Shahid H. Bokhari,et al.  A Partitioning Strategy for Nonuniform Problems on Multiprocessors , 1987, IEEE Transactions on Computers.

[25]  Vipin Kumar,et al.  Multilevel Algorithms for Multi-Constraint Graph Partitioning , 1998, Proceedings of the IEEE/ACM SC98 Conference.

[26]  Timothy A. Davis,et al.  The university of Florida sparse matrix collection , 2011, TOMS.

[27]  KarypisGeorge,et al.  Multilevelk-way Partitioning Scheme for Irregular Graphs , 1998 .

[28]  L. Ayala,et al.  Multivariate Production Optimization of a Natural Gas Field , 2011 .

[29]  Rupak Biswas,et al.  Parallel Load Balancing for Adaptive Unstructured Meshes , 1998 .

[30]  Jean Roman,et al.  SCOTCH: A Software Package for Static Mapping by Dual Recursive Bipartitioning of Process and Architecture Graphs , 1996, HPCN Europe.

[31]  Gary L. Miller,et al.  Automatic Mesh Partitioning , 1992 .

[32]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[33]  Ümit V. Çatalyürek,et al.  Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication , 1999, IEEE Trans. Parallel Distributed Syst..