Solving the Longest Simple Path Problem with Constraint-Based Techniques

The longest simple path problem on graphs arises in a variety of context, e.g., information retrieval, VLSI design, robot patrolling. Given an undirected weighted graph G =(V ,E ), the problem consists of finding the longest simple path (i.e., no vertex occurs more than once) on G . We propose in this paper an exact and a tabu search algorithm for solving this problem. We show that our techniques give competitive results on different kinds of graphs, compared with recent genetic algorithms.

[1]  Irwin King,et al.  Information retrieval in P2P networks using genetic algorithm , 2005, WWW '05.

[2]  Pham Quang Dung.  LS(Graph): a constraint-based local search framework for constrained optimum tree and path problems on graphs , 2011 .

[3]  Yves Deville,et al.  CP(Graph): Introducing a Graph Computation Domain in Constraint Programming , 2005, CP.

[4]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[5]  I-Lun Tseng,et al.  Obstacle-Aware Longest-Path Routing with Parallel MILP Solvers , 2010 .

[6]  Meinolf Sellmann,et al.  Cost-Based Filtering for Shorter Path Constraints , 2003, CP.

[7]  Grégoire Dooms,et al.  The CP(Graph) computation domain in constraint programming , 2006 .

[8]  Laurence A. Wolsey,et al.  Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings , 2007, CPAIOR.

[9]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[10]  Ece Guran Schmidt,et al.  A longest-path problem for evaluating the worst-case packet delay of switched ethernet , 2010, International Symposium on Industrial Embedded System (SIES).

[11]  Francesca Rossi,et al.  Principles and Practice of Constraint Programming – CP 2003 , 2003, Lecture Notes in Computer Science.

[12]  David R. Karger,et al.  On approximating the longest path in a graph , 1997, Algorithmica.

[13]  Pascal Van Hentenryck,et al.  Constraint-Based Local Search for Constrained Optimum Paths Problems , 2010, CPAIOR.

[14]  David Portugal,et al.  A study of genetic algorithms for approximating the longest path in generic graphs , 2010, 2010 IEEE International Conference on Systems, Man and Cybernetics.

[15]  Willem Jan van Hoeve,et al.  The alldifferent Constraint: A Survey , 2001, ArXiv.

[16]  Michel Minoux,et al.  Graphes et algorithmes , 1995 .

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  David Portugal,et al.  MSP algorithm: multi-robot patrolling based on territory allocation using balanced graph partitioning , 2010, SAC '10.

[19]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[20]  Michel Gendreau,et al.  An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.