An enhanced Benders decomposition method for unique shortest path routing

Changyong Zhang ()
Additional contact information
Changyong Zhang: Curtin University

OPSEARCH, 2024, vol. 61, issue 3, No 1, 989-1012

Abstract: Abstract With the aim of looking into a comparatively more efficient solution approach for the unique shortest path routing problem, an alternative problem formulation to a counterpart is first introduced. The model is mathematically equivalent to the counterpart concerning both the feasibility and optimality of the problem. By exploring the constraint structures and model sizes of the two formulations, the former is identified to be a more appropriate one for a decomposition algorithm to solve the problem. An enhanced Benders decomposition method, embedded with redundancy generation strategy, is then proposed, based on the study of problem properties of network flow problems.

Keywords: Shortest path routing; Mathematical modeling; Constraint structure; Benders decomposition; Redundancy generation (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12597-023-00718-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:61:y:2024:i:3:d:10.1007_s12597-023-00718-0

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-023-00718-0

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().