Randomized heuristics for the family traveling salesperson problem
暂无分享,去创建一个
Mauricio G. C. Resende | José Luis González Velarde | L. F. Morán-Mirabal | M. Resende | J. L. G. Velarde | L. Morán-Mirabal
[1] Mauricio G. C. Resende,et al. Randomized heuristics for handover minimization in mobility networks , 2013, J. Heuristics.
[2] Celso C. Ribeiro,et al. Path-relinking intensification methods for stochastic local search algorithms , 2012, J. Heuristics.
[3] Kurt Hornik,et al. Introduction to TSP – Infrastructure for the Traveling Salesperson Problem , 2007 .
[4] Mauricio G. C. Resende,et al. Biased and unbiased random-key genetic algorithms : An experimental analysis ⋆ , 2012 .
[5] Mauricio G. C. Resende,et al. Automatic Tuning of GRASP with Evolutionary Path-Relinking , 2013, Hybrid Metaheuristics.
[6] Fred Glover,et al. Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .
[7] Kees Jan Roodbergen,et al. Design and control of warehouse order picking: A literature review , 2006, Eur. J. Oper. Res..
[8] J. Monnot,et al. The Traveling Salesman Problem and its Variations , 2014 .
[9] M. Resende,et al. A probabilistic heuristic for a computationally difficult set covering problem , 1989 .
[10] Mauricio G. C. Resende,et al. A Hybrid Heuristic for the p-Median Problem , 2004, J. Heuristics.
[11] Birger Raa,et al. Using a TSP heuristic for routing order pickers in warehouses , 2010, Eur. J. Oper. Res..
[12] Mauricio G. C. Resende,et al. Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..
[13] Celso C. Ribeiro,et al. Restart strategies for GRASP with path-relinking heuristics , 2011, Optim. Lett..
[14] Juliane Jung,et al. The Traveling Salesman Problem: A Computational Study , 2007 .
[15] Panos M. Pardalos,et al. GRASP with Path Relinking for Three-Index Assignment , 2005, INFORMS J. Comput..
[16] Mauricio G. C. Resende,et al. A C++application programming interface for biased random-key genetic algorithms , 2015, Optim. Methods Softw..
[17] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[18] Gilbert Laporte,et al. Generalized network design problems , 2003, Eur. J. Oper. Res..
[19] Paolo Toth,et al. The Generalized Covering Salesman Problem , 2012, INFORMS J. Comput..
[20] Gilbert Laporte,et al. Generalized travelling salesman problem through n sets of nodes: the asymmetrical case , 1987, Discret. Appl. Math..
[21] Celso C. Ribeiro,et al. Scatter Search and Path-Relinking: Fundamentals, Advances, and Applications , 2010 .
[22] W. Spears,et al. On the Virtues of Parameterized Uniform Crossover , 1995 .
[23] Mauricio G. C. Resende,et al. Biased random-key genetic algorithms for combinatorial optimization , 2011, J. Heuristics.
[24] Panos M. Pardalos,et al. Randomized heuristics for the Max-Cut problem , 2002, Optim. Methods Softw..
[25] William J. Cook,et al. The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) , 2007 .
[26] John N. Tsitsiklis,et al. Special cases of traveling salesman and repairman problems with time windows , 1992, Networks.
[27] H. D. Ratliff,et al. Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem , 1983, Oper. Res..
[28] James C. Bean,et al. Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..
[29] Rafael Martí,et al. GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..
[30] Michael Hahsler,et al. TSPInfrastructure for the Traveling Salesperson Problem , 2007 .
[31] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[32] Takuji Nishimura,et al. Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.
[33] Celso C. Ribeiro,et al. Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment , 2000, INFORMS J. Comput..
[34] Lawrence V. Snyder,et al. A random-key genetic algorithm for the generalized traveling salesman problem , 2006, Eur. J. Oper. Res..