Concerning a Decision-Diagram-Based Solution to the Generalized Directed Rural Postman Problem

• المؤلفون الرئيسيون: Tan, Renzo Roel P, Kawahara, Jun, Ikeda, Kazushi, Garciano, Agnes, See, Kyle Stephen S
• التنسيق: text
• منشور في: Archīum Ateneo 2020
• الموضوعات: enumeration algorithm; generalized directed rural postman; subgraph optimization; zero-suppressed binary decision diagram; Mathematics
• الوصول للمادة أونلاين: https://archium.ateneo.edu/mathematics-faculty-pubs/145; https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1144&context=mathematics-faculty-pubs
• المؤسسة: Ateneo De Manila University

Decision-diagram-based solutions for discrete optimization have been persistently studied. Among these is the use of the zero-suppressed binary decision diagram, a compact graph-based representation for a specified family of sets. Such a diagram may work out combinatorial problems by efficient enumeration. In brief, an extension to the frontierbased search approach for zero-suppressed binary decision diagram construction is proposed. The modification allows for the inclusion of a class-determined constraint in formulation. Variations of the generalized directed rural postman problem, proven to be nondeterministic polynomial-time hard, are solved on some rapid transit systems as illustration. Lastly, results are juxtaposed against standard integer programming in establishing the relative superiority of the new technique.