Capacitated path-aggregation constraint model for arc disruption in networks. (January 2018)

• Record Type: Journal Article
• Authors: Karakose, Gokhan; McGarvey, Ronald G.
• Is Part Of: Transportation research. Volume 109(2018)
• Page Start: 225
• Page End: 238
• Publication Date: 2018-01
• Subjects: Network disruption models -- Network flow models -- Mixed-integer linear programming; Logistics -- Periodicals; Transportation -- Periodicals; 388.011
• DOI: 10.1016/j.tre.2017.11.012
• Languages: English
• ISSNs: 1366-5545

Abstract

Highlights: Extends path-aggregation constraint concept to arc-capacitated networks. Presents computationally-efficient models for arc deletion on capacitated networks. Avoids suboptimal solutions obtained by uncapacitated models on such networks. Abstract: Path-aggregation constraint (PAC) models can be used to represent flows across networks with specific origin-destination demand pairs without requiring explicit enumeration of all potential paths, greatly reducing the computational burden needed analyze a network's performance in the event of arc disruptions. This paper presents new PAC models for examining arc disruptions on networks, providing the first known models to extend such PACs to capacitated arcs. Extensive computational testing demonstrates that these novel arc-capacitated models do not significantly increase computational burden beyond that required by arc-uncapacitated models, while avoiding the suboptimal performance achieved when uncapacitated models are applied to arc-capacitated networks.