A tabu search algorithm for the min-max k-Chinese postman problem

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  Stephen J. Garland,et al.  Algorithm 97: Shortest path , 1962, Commun. ACM.

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

[4]  Jack Edmonds,et al.  Matching, Euler tours and the Chinese postman , 1973, Math. Program..

[5]  Chul E. Kim,et al.  Approximation algorithms for some routing problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[6]  Jan Karel Lenstra,et al.  On general routing problems , 1976, Networks.

[7]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[8]  Chul E. Kim,et al.  Approximation Algorithms for Some Routing Problems , 1978, SIAM J. Comput..

[9]  R. Jonker,et al.  The symmetric traveling salesman problem and edge exchanges in minimal 1-trees , 1983 .

[10]  Bruce L. Golden,et al.  Computational experiments with algorithms for a class of routing problems , 1983, Comput. Oper. Res..

[11]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[12]  Ángel Corberán,et al.  An algorithm for the Rural Postman problem on a directed graph , 1986 .

[13]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[14]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[15]  Paulo Morelato França,et al.  VEHICLE ROUTING PROBLEMS VIA TABU SEARCH METAHEURISTIC , 1991 .

[16]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[17]  Ángel Corberán,et al.  The Capacitated Arc Routing Problem: Lower bounds , 1992, Networks.

[18]  Gilbert Laporte,et al.  New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..

[19]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[20]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[21]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.

[22]  Richard W. Eglese,et al.  Routeing Winter Gritting Vehicles , 1994, Discret. Appl. Math..

[23]  Á. Corberán,et al.  A polyhedral approach to the rural postman problem , 1994 .

[24]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[25]  Wen Lea Pearn,et al.  Algorithms for the rural postman problem , 1995, Comput. Oper. Res..

[26]  Michel Gendreau,et al.  The m-Traveling Salesman Problem with Minmax Objective , 1995, Transp. Sci..

[27]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[28]  Ulrich Derigs,et al.  Operations Research Proceedings 1994 , 1995 .

[29]  Peter Greistorfer,et al.  Computational Experiments with Heuristics for a Capacitated Arc Routing Problem , 1995 .

[30]  Richard W. Eglese,et al.  An Interactive Algorithm for Vehicle Routeing for Winter — Gritting , 1996 .

[31]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[32]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[33]  Gilbert Laporte,et al.  An adaptive memory heuristic for a class of vehicle routing problems with minmax objective , 1997, Comput. Oper. Res..

[34]  Gilbert Laporte,et al.  Improvement Procedures for the Undirected Rural Postman Problem , 1999, INFORMS J. Comput..

[35]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Capacitated Arc Routing Problem , 2000, Oper. Res..

[36]  Philippe Lacomme,et al.  A Genetic Algorithm for the Capacitated Arc Routing Problem and Its Extensions , 2001, EvoWorkshops.

[37]  Adam N. Letchford,et al.  General Routing Problem , 2001, Encyclopedia of Optimization.

[38]  Ángel Corberán,et al.  A cutting plane algorithm for the General Routing Problem , 2001, Math. Program..

[39]  Alain Hertz,et al.  A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem , 2001, Transp. Sci..

[40]  Gerhard Reinelt,et al.  New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem , 2002, ESA.

[41]  Michel Gendreau,et al.  Metaheuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[42]  Paolo Toth,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

[43]  Peter Greistorfer,et al.  A Tabu Scatter Search Metaheuristic for the Arc Routing Problem , 2002 .

[44]  Luc Muyldermans,et al.  A guided local search heuristic for the capacitated arc routing problem , 2003, Eur. J. Oper. Res..

[45]  Philippe Lacomme,et al.  Competitive Memetic Algorithms for Arc Routing Problems , 2004, Ann. Oper. Res..