A Zero-Suppressed Binary Decision Diagram Approach for Constrained Path Enumeration

Combinatorial optimization over graphs has been the subject of research. Recently, the solution of such problems by enumeration using a compact data structure called the zero-suppressed binary decision diagram was proposed and studied. The paper augments the existing frontier-based search method of...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Lecture notes in engineering and computer science Ročník 2240; s. 132
Hlavní autoři: Tan, Renzo, Kawahara, Jun, Garciano, Agnes, Sin, Immanuel
Médium: Journal Article
Jazyk:angličtina
Vydáno: Hong Kong International Association of Engineers 03.07.2019
Témata:
Algorithms
Combinatorial analysis
Constraints
Data structures
Enumeration
Integer programming
Optimization
Subways
ISSN:2078-0958, 2078-0966
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Combinatorial optimization over graphs has been the subject of research. Recently, the solution of such problems by enumeration using a compact data structure called the zero-suppressed binary decision diagram was proposed and studied. The paper augments the existing frontier-based search method of construction and puts forth a technique for accommodating additional constraints during computation. The shortest and longest path problems for the Osaka Metro transit network are simultaneously solved as demonstration. Furthermore, a comparison of the approach with a conventional integer programming method is presented towards justifying the effectiveness of the algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2078-0958
2078-0966