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 2014-11-18 15:00
[Poster Presentation] Enumerating all the optimal solutions of multiple travelling salesman problem by using simpath algorithm
Masashi Ogawa, Masato Inoue (Waseda Univ.) IBISML2014-78
Abstract (in Japanese) (See Japanese page) 
(in English) In this manuscript, we propose an exact method which answers all the optimal solutions of "multiple traveling salesman problem." In this problem, we have several salespersons and several towns. All the salespersons start from a depot and come back to the depot after visiting several towns. Each town should be visited by only one of the salespersons. In such situation, we have to minimize the longest trip. We utilize zero-suppressed binary decision diagram (ZDD) and simpath algorithm and succeeded enumerating all the optimal paths effectively.
Keyword (in Japanese) (See Japanese page) 
(in English) multiple traveling salesman problem / zero-suppressed binary decision diagram (ZDD) / searching optimal solutions / enumerating all solutions / / / /  
Reference Info. IEICE Tech. Rep., vol. 114, no. 306, IBISML2014-78, pp. 321-328, Nov. 2014.
Paper # IBISML2014-78 
Date of Issue 2014-11-10 (IBISML) 
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 IBISML2014-78

Conference Information
Committee IBISML  
Conference Date 2014-11-17 - 2014-11-19 
Place (in Japanese) (See Japanese page) 
Place (in English) Nagoya Univ. 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To IBISML 
Conference Code 2014-11-IBISML 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Enumerating all the optimal solutions of multiple travelling salesman problem by using simpath algorithm 
Sub Title (in English)  
Keyword(1) multiple traveling salesman problem  
Keyword(2) zero-suppressed binary decision diagram (ZDD)  
Keyword(3) searching optimal solutions  
Keyword(4) enumerating all solutions  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Masashi Ogawa  
1st Author's Affiliation Waseda University (Waseda Univ.)
2nd Author's Name Masato Inoue  
2nd Author's Affiliation Waseda University (Waseda Univ.)
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
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 Author-1 
Date Time 2014-11-18 15:00:00 
Presentation Time 180 minutes 
Registration for IBISML 
Paper # IBISML2014-78 
Volume (vol) vol.114 
Number (no) no.306 
Page pp.321-328 
#Pages
Date of Issue 2014-11-10 (IBISML) 


[Return to Top Page]

[Return to IEICE Web Page]


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