A study of genetic algorithms for approximating the longest path in generic graphs

Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

Volumn , Issue , 2010, Pages 2539-2544

  Portugal, David ^a   Antunes, Carlos Henggeler ^b   Rocha, Rui ^a  

^a UNIVERSITY OF COIMBRA   (Portugal)

^b INESC COIMBRA   (Portugal)

Author keywords

Genetic algorithms; Graph theory; Longest path problem

Indexed keywords

LONGEST PATH; LONGEST PATH PROBLEMS; MUTATION MECHANISM; NP COMPLETE; SIMULATION EXPERIMENTS; UNDIRECTED GRAPH;

COMPUTER SIMULATION; CYBERNETICS; GENETIC ALGORITHMS; GRAPH THEORY;

PROBLEM SOLVING;

EID: 78751474128     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSMC.2010.5641920     Document Type: Conference Paper

References (21)

1. D. Karger, R. Montwani, and G. Ramkumar, On approximating the longest path in a graph, Algorithmica, Vol. 18, No. 1, 92-98, May, 1997.
2. H. Gabow, Finding paths and cycles of super poly logarithmic length, In Proceedings of the 36th annual ACM symposium on Theory of computing (STOC'04), 407-416, Chicago, Illinois, U.S.A., 2004.
3. D. Portugal and R. Rocha, MSP Algorithm: Multi-Robot Patrolling based on Territory Allocation using Balanced Graph Partitioning, In Proceedings of 25th ACM Symposium on Applied Computing, Special Track on Intelligent Robotic Systems, 1271-1276, Sierre, Switzerland, March 22-26, 2010.
4. B. Monien, How to find long paths efficiently, Annals of Discrete Mathematics, Vol. 25, 239-254, 1985.
5. H. Bodlaender, On linear time minor tests and depth first search, In Proceedings of Workshop on Algorithms and Data Structures (WADS'89), 577-590, Springer-Verlag, Lecture Notes in Computer Science, Vol. 382, Ottawa, Canada, August 17-19, 1989.
6. N. Alon, R. Yuster and U. Zwick, Color-coding, Journal of the ACM (JACM), Vol. 42, Issue 4, 844-856, July, 1995.
7. E. Ando, T. Nakata, and M. Yamashita, Approximating the Longest Path Length of a Stochastic DAG by a Normal Distribution in Linear Time, Journal of Discrete Algorithms, Vol. 7, No. 4, 420-438, December, 2009.
8. Wagner A, Reconstructing pathways in large genetic networks from genetic perturbations, Journal of Computational Biology, Vol. 11, No. 1, 53-60, 2004.
9. R. Uehara and Y. Uno, Efficient algorithms for the longest path problem, Lecture Notes in Computer Science, Vol. 3341, Springer-Verlag, 871-883, 2004.
10. K. Ioannidou, G. Mertzios and S. Nikolopoulos, The Longest Path Problem Is Polynomial on Interval Graphs, In Proceedings of the 34th Int. Symposium on Mathematical Foundations of Computer Science, Springer-Verlag, 403-414, Novy Smokovec, High Tatras, Slovakia, 2009.
11. Y. Hsu, S. Sun and D. Du, Finding The Longest Simple Path in Cyclic Combinational Circuits, IEEE Int. Conference on Computer Design, IEEE Computer Society, 530-535, Austin, Texas, U.S. A., 1998.
12. W. Wong, T. Lau and I. King, Information retrieval in P2P networks using genetic algorithm, In Proceedings of the 14th Int. World Wide Web Conference, Special interest tracks and posters, 922-923, Chiba, Japan, May 10-14, 2005.
13. S. Prager, and W. Spears, A hybrid evolutionary-graph approach for finding junctional network paths, In Proceedings of the 17th ACM GIS Int. Conference on Advances in Geographic Information Systems, ACM, 306-315, Seattle, Washington, U.S.A., November 4-6, 2009.
14. T. Nair and K. Sooda, Comparison of Genetic Algorithm and Simulated Annealing Technique for Optimal Path Selection In Network Routing, In Proceedings of the National Conference on VLSI and Networks (NCVN-09), 47-53, Chennai, Tamil Nadu, India, 2009.
15. E. Gelenbe, P. Liu and J. Laine, Genetic algorithms for route discovery, IEEE Transaction on Systems, Man and Cybernetics (SMC 2006), Vol. 36, No. 6, 1247-1254, Taipei, Taiwan, October 8-11, 2006.
16. A. Kumar, J. Arunadevi and V. Mohan, Intelligent Transport Route Planning Using Genetic Algorithms in Path Computation Algorithms, European Journal of Scientific Research, Vol. 25, No. 3, 463-468, 2009.
17. J. Solano and D. Jones, Generation of collision-free paths, a genetic approach, In Proceedings of the IEEE Colloquium on Genetic Algorithms for Control and Systems Engineering, 5/1-5/6, London, 1993.
18. T. Davies and A. Jnifene, Path Planning and Trajectory Control of Collaborative Mobile Robots Using Hybrid Control Architecture, Journal of Systemics, Cybernetics and Informatics, Vol. 6, No. 4, 42-48, 2008.
19. E. Talbi and P. Bessière, A parallel Genetic Algorithm for the Graph Partitioning Problem, In Proceedings of the 5th ACM Int. Conference on Supercomputing (ICS91), 312-320, Cologne, Germany, 1991.
20. E. Scheinerman, Matgraph: A MATLAB Toolbox for Graph Theory. Available: http://www.ams.jhu.edu/~ers/matgraph/matgraph.pdf [June 2010]
21. J. Kennedy and R. C. Eberhart, Particle Swarm Optimization, In Proceedings of the IEEE International Conference on Neural Networks, Perth, Australia, IEEE Service Center, 12-13, 1995.