Heuristiques pour le Problème du Vendeur m-Péripatétique

Le Probleme du Vendeur m -Peripatetique ( m -PVP) est defini sur un graphe non oriente G=(V,E) ou V = {1,...,n} est l'ensemble des sommets, E = {(i,j) : i,j ∈ V,i est l'ensemble des aretes et (c ij ) est une matrice de couts definie sur E . Le m -PVP consiste a determiner m cycles hamiltoniens sur G n'ayant aucune arete en commun et dont le cout total est minimal. Cet article decrit sept nouvelles heuristiques pour le m -PVP et les compare a celle qui a ete proposee par Krarup en 1975.

[1]  J. Krarup.  The Peripatetic Salesman and Some Related Unsolved Problems , 1995 .

[2]  J. D. Kort,et al.  A branch and bound algorithm for symmetric 2-Peripatetic Salesman Problems , 1993 .

[3]  Gilbert Laporte,et al.  The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms , 2007, Oper. Res..

[4]  Mark H. Karwan,et al.  The equity constrained shortest path problem , 1990, Comput. Oper. Res..

[5]  J. D. Kort.  Lower bounds for symmetric K-peripatetic salesman problems , 1991 .

[6]  William J. Cook,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.

[7]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[8]  Rajan Batta,et al.  Equitable Sequencing of a Given Set of Hazardous Materials Shipments , 1991, Transp. Sci..

[9]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

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

[11]  Jeroen B. J. M. De Kort.  Sensitivity analysis for symmetric 2-peripatetic salesman problems , 1993, Oper. Res. Lett..

[12]  Gilbert Laporte,et al.  Branch-and-cut algorithms for the undirected m , 2005, Eur. J. Oper. Res..

[13]  Roberto Cordone,et al.  A heuristic approach to the overnight security service problem , 2003, Comput. Oper. Res..

[14]  M. A. Venkataramanan,et al.  A branch‐and‐bound algorithm for flow‐path design of automated guided vehicle systems , 1991 .

[15]  Gerd Finke,et al.  Vehicle scheduling in two-cycle flexible manufacturing systems , 1994 .