Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
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 2010-09-29 10:00
Run-time Analysis of Ant Colony Optimization over the Cheapest Path with a Context-dependent Cost
Atsushi Murata, Yoshinori Takei (Nagaoka Univ. of Tech.) COMP2010-24
Abstract (in Japanese) (See Japanese page) 
(in English) Since Ant Colony Optimization (ACO) was introduced by Dorigo and his colleagues in the early 1990s, it has been worked as a scheme for finding (heuristic) algorithms for a number of hard combinatorial optimization problems. On the other hand, even to a problem which has a known efficient
algorithm, it is important to analyze the application of ACO algorithm for understanding intrinsic nature of ACO. For the single destination shortest path problem (SDSP), Attiratanasunthron and Fakcharoenphol presented the first ACO algorithm with an explicit run-time upper bound, for directed acyclic graphs. For the problem, Horoba and Sudholt showed an improved upper bound $O(n^{3}+(n\log n)/\rho)$ iterations, where $n$ is the number of vertices in the graph, $\rho$ is a parameter called as the pheromone evapolation rate. In the shortest path problem, the cost of passing an edge is constant for that edge, usually called as distance. However, in some application, it is required that the cost of passing an edge depends on the context that the edge is used as a part of the path.
In this paper, we consider the application of ACO algorithm of Horoba and Sudholt to a generalized SDSP in which the cost of an ant traversing an edge is weighted in a certain manner depending on the path that the ant used to approach the edge. We show that, without major change of the algorithm, the run-time for the generalized case is essentially the same as that of the original shortest path problem if the dependence of the weight on the context satisfies a certain multiplicative functional equation and any cheapest path with respect to the cost is of finite length.
Keyword (in Japanese) (See Japanese page) 
(in English) ant colony optimization / metaheuristics / run-time / shortest path problem / / / /  
Reference Info. IEICE Tech. Rep., vol. 110, no. 214, COMP2010-24, pp. 1-8, Sept. 2010.
Paper # COMP2010-24 
Date of Issue 2010-09-22 (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 COMP2010-24

Conference Information
Committee COMP  
Conference Date 2010-09-29 - 2010-09-29 
Place (in Japanese) (See Japanese page) 
Place (in English) Nagaoka Univ. of Tech. 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2010-09-COMP 
Language English (Japanese title is available) 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Run-time Analysis of Ant Colony Optimization over the Cheapest Path with a Context-dependent Cost 
Sub Title (in English)  
Keyword(1) ant colony optimization  
Keyword(2) metaheuristics  
Keyword(3) run-time  
Keyword(4) shortest path problem  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Atsushi Murata  
1st Author's Affiliation Nagaoka University of Technology (Nagaoka Univ. of Tech.)
2nd Author's Name Yoshinori Takei  
2nd Author's Affiliation Nagaoka University of Technology (Nagaoka Univ. of Tech.)
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 ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2010-09-29 10:00:00 
Presentation Time 35 minutes 
Registration for COMP 
Paper # COMP2010-24 
Volume (vol) vol.110 
Number (no) no.214 
Page pp.1-8 
#Pages 8 
Date of Issue 2010-09-22 (COMP) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan