A multi-objective, bilevel programming methodology to identify spatiotemporal transportation distribution network vulnerabilities

Authors

Carson G. Long, Air Force Institute of Technology
Brian J. Lunday, Air Force Institute of TechnologyFollow
Phillip R. Jenkins, Air Force Institute of TechnologyFollow

Document Type

Article

Publication Date

4-8-2025

Abstract

Excerpt: This research formulates and examines the bilevel material routing problem, wherein an upper-level problem identifies the respective times and locations for a limited number of fixed-duration attacks on arcs within a distribution network, and a lower-level problem subsequently routes shipments over the network between respective origins and destinations.

Comments

This article is available through subscription or purchase from the publisher, Springer, using the DOI link below.

The article is published online as an article of Annals of Operations Research, ahead of inclusion in an issue of the journal. The citation on this page will be updated when it is incorporated into a future issue.

DOI

10.1007/s10479-025-06590-z

Source Publication

Annals of Operations Research (ISSN 0254-5330 | eISSN 1572-9338)

Recommended Citation

Long, C.G., Lunday, B.J. & Jenkins, P.R. A multi-objective, bilevel programming methodology to identify spatiotemporal transportation distribution network vulnerabilities. Ann Oper Res (2025). https://doi.org/10.1007/s10479-025-06590-z