Arc Routing Based on the Zero-Suppressed Binary Decision Diagram
A wide range of problems in operations research falls under arc routing problems, a domain which focuses on arc or edge features rather than node or vertex attributes. The undirected rural postman problem is a well-known problem in arc routing that seeks to determine a minimum cost walk that travers...
Saved in:
Main Authors: | , , , |
---|---|
Format: | text |
Published: |
Archīum Ateneo
2020
|
Subjects: | |
Online Access: | https://archium.ateneo.edu/mathematics-faculty-pubs/167 https://link.springer.com/chapter/10.1007/978-981-15-8273-8_9 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Ateneo De Manila University |
id |
ph-ateneo-arc.mathematics-faculty-pubs-1171 |
---|---|
record_format |
eprints |
spelling |
ph-ateneo-arc.mathematics-faculty-pubs-11712022-02-04T01:52:21Z Arc Routing Based on the Zero-Suppressed Binary Decision Diagram Tan, Renzo Roel P Sikora, Florian Ikeda, Kazushi See, Kyle Stephen S A wide range of problems in operations research falls under arc routing problems, a domain which focuses on arc or edge features rather than node or vertex attributes. The undirected rural postman problem is a well-known problem in arc routing that seeks to determine a minimum cost walk that traverses a certain set of required edges on a given graph. The problem, arising in numerous real-world applications, is nondeterministic polynomial-time hard. The chapter presents a solution to the undirected rural postman problem based on the zero-suppressed binary decision diagram, a compact data structure that represents a family of sets. Through an extension to the frontier-based search method of diagram construction, the approach solves the problem by efficient enumeration, producing all feasible routes in addition to the optimal route. Instances of the problem put forward in literature are then solved as benchmark for the decision-diagram-based solution. As reasonable time is consumed, the method proves to be a practicable candidate in solving the undirected rural postman problem. 2020-10-25T07:00:00Z text https://archium.ateneo.edu/mathematics-faculty-pubs/167 https://link.springer.com/chapter/10.1007/978-981-15-8273-8_9 Mathematics Faculty Publications Archīum Ateneo arc routing enumeration algorithm frontier-based search graph optimization rural postman problem zero-suppressed binary decision diagram Mathematics |
institution |
Ateneo De Manila University |
building |
Ateneo De Manila University Library |
continent |
Asia |
country |
Philippines Philippines |
content_provider |
Ateneo De Manila University Library |
collection |
archium.Ateneo Institutional Repository |
topic |
arc routing enumeration algorithm frontier-based search graph optimization rural postman problem zero-suppressed binary decision diagram Mathematics |
spellingShingle |
arc routing enumeration algorithm frontier-based search graph optimization rural postman problem zero-suppressed binary decision diagram Mathematics Tan, Renzo Roel P Sikora, Florian Ikeda, Kazushi See, Kyle Stephen S Arc Routing Based on the Zero-Suppressed Binary Decision Diagram |
description |
A wide range of problems in operations research falls under arc routing problems, a domain which focuses on arc or edge features rather than node or vertex attributes. The undirected rural postman problem is a well-known problem in arc routing that seeks to determine a minimum cost walk that traverses a certain set of required edges on a given graph. The problem, arising in numerous real-world applications, is nondeterministic polynomial-time hard. The chapter presents a solution to the undirected rural postman problem based on the zero-suppressed binary decision diagram, a compact data structure that represents a family of sets. Through an extension to the frontier-based search method of diagram construction, the approach solves the problem by efficient enumeration, producing all feasible routes in addition to the optimal route. Instances of the problem put forward in literature are then solved as benchmark for the decision-diagram-based solution. As reasonable time is consumed, the method proves to be a practicable candidate in solving the undirected rural postman problem. |
format |
text |
author |
Tan, Renzo Roel P Sikora, Florian Ikeda, Kazushi See, Kyle Stephen S |
author_facet |
Tan, Renzo Roel P Sikora, Florian Ikeda, Kazushi See, Kyle Stephen S |
author_sort |
Tan, Renzo Roel P |
title |
Arc Routing Based on the Zero-Suppressed Binary Decision Diagram |
title_short |
Arc Routing Based on the Zero-Suppressed Binary Decision Diagram |
title_full |
Arc Routing Based on the Zero-Suppressed Binary Decision Diagram |
title_fullStr |
Arc Routing Based on the Zero-Suppressed Binary Decision Diagram |
title_full_unstemmed |
Arc Routing Based on the Zero-Suppressed Binary Decision Diagram |
title_sort |
arc routing based on the zero-suppressed binary decision diagram |
publisher |
Archīum Ateneo |
publishDate |
2020 |
url |
https://archium.ateneo.edu/mathematics-faculty-pubs/167 https://link.springer.com/chapter/10.1007/978-981-15-8273-8_9 |
_version_ |
1724079167891308544 |