IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2015-12-01 10:30
A Fast Method for Solving Constrained Shortest Path Problems on Directed Acyclic Graphs
Fumito Takeuchi (Hokkaido Univ.), Masaaki Nishino (NTT), Norihito Yasuda (Hokkaido Univ.), Takuya Akiba (NII), Shin-ichi Minato (Hokkaido Univ.), Masaaki Nagata (NTT) COMP2015-31
Abstract (in Japanese) (See Japanese page) 
(in English) This paper deals with shortest path problems on directed acyclic graphs (DAGs), under logical constraints posed between edges. In this setting, a shortest path to each intermediate node does not always appear in a graph-wide shortest path that contains the node. Thus naive approaches will suffer from exponentially many paths. To avoid this problem, an algorithm called BDD-Constraint Search (BCS) is known. This method represents logical constraints as a Binary Decision Diagram (BDD), and solves the problem by refering BDDs to merge equivalent candidate partial paths. However, since BCS has to generate all possible combinations of DAG nodes and BDD nodes, it becomes slow when the BDD representing constraints is large. Since the shortest path problem without logical constraints is a relaxed problem of the constrained one, we propose an A* search method for BCS that exploits solutions of the original shortest path problem as a heuristic function. Moreover, since the shortest path problem on the BDD is also a relaxation of the constrained shortest path problem, our A* search method can also use the solutions of the shortest path problem on a BDD as a heuristic function. We can use the combination of the above two heuristic functions as another heuristic function.
Keyword (in Japanese) (See Japanese page) 
(in English) directed acyclic graph / shortest path / A* search / Binary Decision Diagram / dynamic programming / / /  
Reference Info. IEICE Tech. Rep., vol. 115, no. 344, COMP2015-31, pp. 9-16, Dec. 2015.
Paper # COMP2015-31 
Date of Issue 2015-11-24 (COMP) 
ISSN Print edition: ISSN 0913-5685  Online edition: ISSN 2432-6380
Copyright
and
reproduction
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF COMP2015-31

Conference Information
Committee COMP  
Conference Date 2015-12-01 - 2015-12-01 
Place (in Japanese) (See Japanese page) 
Place (in English)  
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2015-12-COMP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) A Fast Method for Solving Constrained Shortest Path Problems on Directed Acyclic Graphs 
Sub Title (in English)  
Keyword(1) directed acyclic graph  
Keyword(2) shortest path  
Keyword(3) A* search  
Keyword(4) Binary Decision Diagram  
Keyword(5) dynamic programming  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Fumito Takeuchi  
1st Author's Affiliation Hokkaido University (Hokkaido Univ.)
2nd Author's Name Masaaki Nishino  
2nd Author's Affiliation Nippon Telegraph and Telephone Corporation (NTT)
3rd Author's Name Norihito Yasuda  
3rd Author's Affiliation Hokkaido University (Hokkaido Univ.)
4th Author's Name Takuya Akiba  
4th Author's Affiliation National Institute of Informatics (NII)
5th Author's Name Shin-ichi Minato  
5th Author's Affiliation Hokkaido University (Hokkaido Univ.)
6th Author's Name Masaaki Nagata  
6th Author's Affiliation Nippon Telegraph and Telephone Corporation (NTT)
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Speaker
Date Time 2015-12-01 10:30:00 
Presentation Time 30 
Registration for COMP 
Paper # IEICE-COMP2015-31 
Volume (vol) IEICE-115 
Number (no) no.344 
Page pp.9-16 
#Pages IEICE-8 
Date of Issue IEICE-COMP-2015-11-24 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan