An analytical approach to the protection planning of a rail intermodal terminal network

DOI10.1016/j.ejor.2016.07.036zbMath1394.90394OpenAlexW2487821311MaRDI QIDQ1752835

Manish Verma, David M. Tulett, Hassan Sarhadi

Publication date: 24 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.07.036

zbMATH Keywords

decomposition heuristicfortificationmixed-integer program(O) transportation(T) logistics

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (7)

A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption ⋮ Location and transportation of intermodal Hazmat considering equipment capacity and congestion impact: elastic method and sub-population genetic algorithm ⋮ An exact method for binary fortification games ⋮ Optimizing fortification plan of capacitated facilities with maximum distance limits ⋮ A simple game theoretical analysis for incentivizing multi-modal transportation in freight supply chains ⋮ Managing rail-truck intermodal transportation for hazardous materials with random yard disruptions ⋮ Tri-level mixed-binary linear programming: solution approaches and application in defending critical infrastructure

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Multimodal freight transportation planning: a literature review
• Optimizing dynamic investment decisions for railway systems protection
• A trilevel programming approach for electric grid defense planning
• Protection issues for supply systems involving random attacks
• The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm
• Optimizing system resilience: a facility protection model with recovery time
• An \(s\)-\(t\) connection problem with adaptability
• Designing robust coverage networks to hedge against worst-case facility losses
• The budget constrained \(r\)-interdiction median problem with capacity expansion
• Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
• A lead-time based approach for planning rail-truck intermodal transportation of dangerous goods
• Partitioning procedures for solving mixed-variables programming problems
• Opportunities for OR in intermodal freight transport research: A review.
• Foundations of bilevel programming
• Deterministic network interdiction
• A bilevel mixed-integer program for critical infrastructure protection planning
• An exact solution approach for the interdiction median problem with fortification
• Balancing Terrorism and Natural Disasters—Defensive Strategy with Endogenous Attacker Effort
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• Shortest-path network interdiction
• A Benders decomposition method for discretely-constrained mathematical programs with equilibrium constraints
• Removing Arcs from a Network

This page was built for publication: An analytical approach to the protection planning of a rail intermodal terminal network