A differential evolution algorithm for the median cycle problem

This paper extends the applications of differential evolution algorithms to the Median Cycle Problem. The median cycle problem is concerned with constructing a simple cycle composed of a subset of vertices of a mixed graph. The objective is to minimize the cost of the cycle and the cost of assigning vertices not on the cycle to the nearest vertex on the cycle. A unique solution representation is presented for the differential evolution algorithm in order to solve the median cycle problem. To the best of our knowledge, this is the first reported application of differential evolution algorithms to the median cycle problem in the literature. No local search is employed in order to see the performance of the pure differential evolution algorithm. The differential evolution algorithm is tested on a set of benchmark instances from the literature. For comparisons, a continuous genetic algorithm is also developed. The computational results show that the differential evolution algorithm was superior to the genetic algorithm. In addition, the computational results also show that the differential evolution algorithm is very promising in solving the median cycle problem when compared to the best performing algorithms from the literature. Ultimately, given the fact that no local search is employed, the DE algorithm was able to further improve the 5 out of 20 instances.

[1]  G. Laporte,et al.  A Branch-and-Cut Algorithm for the Undirected Selective Traveling Salesman Problem , 1998 .

[2]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[3]  Inmaculada Rodríguez Martín,et al.  The Ring Star Problem: Polyhedral analysis and exact algorithm , 2004, Networks.

[4]  Godfrey C. Onwubolu,et al.  New optimization techniques in engineering , 2004, Studies in Fuzziness and Soft Computing.

[5]  Gilbert Laporte,et al.  The selective travelling salesman problem , 1990, Discret. Appl. Math..

[6]  Matteo Fischetti,et al.  Solving the Orienteering Problem through Branch-and-Cut , 1998, INFORMS J. Comput..

[7]  Inmaculada Rodríguez Martín,et al.  Variable neighborhood tabu search and its application to the median cycle problem , 2003, Eur. J. Oper. Res..

[8]  Gilbert Laporte,et al.  A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem , 1996, INFORMS J. Comput..

[9]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

[10]  Gilbert Laporte,et al.  Efficient heuristics for Median Cycle Problems , 2004, J. Oper. Res. Soc..

[11]  Inmaculada Rodríguez Martín,et al.  Locating median cycles in networks , 2005, Eur. J. Oper. Res..

[12]  Michel Gendreau,et al.  The Covering Tour Problem , 1997, Oper. Res..

[13]  R. Storn,et al.  Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .

[14]  Zvi Drezner,et al.  Telecommunication and location , 2002 .

[15]  R. Storn,et al.  Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

[16]  Juan José Salazar González,et al.  The Median Cycle Problem , 2001 .

[17]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[18]  Gilbert Laporte,et al.  Location routing problems , 1987 .

[19]  Lucídio dos Anjos Formiga Cabral,et al.  An Efficient Heuristic for the Ring Star Problem , 2006, WEA.

[20]  Roy Jonker,et al.  On Some Generalizations of the Travelling-Salesman Problem , 1987 .

[21]  Gilbert Laporte,et al.  Path, Tree and Cycle Location , 1998 .

[22]  Petra Bauer.  The Circuit Polytope: Facets , 1997, Math. Oper. Res..

[23]  J. G. Klincewicz,et al.  HUB LOCATION IN BACKBONE/TRIBUTARY NETWORK DESIGN: A REVIEW , 1998 .

[24]  W. Spears,et al.  On the Virtues of Parameterized Uniform Crossover , 1995 .

[25]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[26]  G. Laporte,et al.  Maximizing user convenience and postal service efficiency in post box location , 1986 .

[27]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[28]  P. N. Suganthan,et al.  Differential Evolution: A Survey of the State-of-the-Art , 2011, IEEE Transactions on Evolutionary Computation.