Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches
暂无分享,去创建一个
[1] G. Reinelt,et al. Optimal control of plotting and drilling machines: A case study , 1991, ZOR Methods Model. Oper. Res..
[2] G. Laporte. The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .
[3] Keld Helsgaun,et al. An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..
[4] Gilbert Laporte,et al. A Cutting Planes Algorithm for the m-Salesmen Problem , 1980 .
[5] P. Miliotis,et al. Using cutting planes to solve the symmetric Travelling Salesman problem , 1978, Math. Program..
[6] Eleni Hadjiconstantinou,et al. Routing under Uncertainty: An Application in the Scheduling of Field Service Engineers , 2002, The Vehicle Routing Problem.
[7] Abraham P. Punnen,et al. The traveling salesman problem and its variations , 2007 .
[8] Ted K. Ralphs,et al. Parallel branch and cut for capacitated vehicle routing , 2003, Parallel Comput..
[9] Paolo Toth,et al. Algorithms and codes for dense assignment problems: the state of the art , 2000, Discret. Appl. Math..
[10] Corso Elvezia,et al. Ant colonies for the traveling salesman problem , 1997 .
[11] David S. Johnson,et al. The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .
[12] Richard H. Warren,et al. Special cases of the traveling salesman problem , 1994 .
[13] Richard H Mole,et al. Combinatorial analysis for route first-cluster second vehicle routing , 1983 .
[14] William R. Pulleyblank,et al. Clique Tree Inequalities and the Symmetric Travelling Salesman Problem , 1986, Math. Oper. Res..
[15] Gilbert Laporte,et al. The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .
[16] Cathy Macharis,et al. Opportunities for OR in intermodal freight transport research: A review , 2004, Eur. J. Oper. Res..
[17] Chau-Yun Hsu,et al. A study of feature-mapped approach to the multiple travelling salesmen problem , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.
[18] Bezalel Gavish,et al. Note---A Note on “The Formulation of the M-Salesman Traveling Salesman Problem” , 1976 .
[19] T. Glenn Bailey,et al. Reactive Tabu Search in unmanned aerial reconnaissance simulations , 1998, 1998 Winter Simulation Conference. Proceedings (Cat. No.98CH36274).
[20] Kenneth C. Gilbert,et al. A New Multiperiod Multiple Traveling Salesman Problem with Heuristic and Application to a Scheduling Problem , 1992 .
[21] P. Toth,et al. Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem , 1980 .
[22] Hussain Aziz Saleh,et al. The design of the global navigation satellite system surveying networks using genetic algorithms , 2004, Eng. Appl. Artif. Intell..
[23] William J. Cook,et al. The Traveling Salesman Problem: A Computational Study , 2007 .
[24] Gilbert Laporte,et al. Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows , 2004 .
[25] P. Miliotis,et al. Integer programming approaches to the travelling salesman problem , 1976, Math. Program..
[26] William J. Cook,et al. Certification of an optimal TSP tour through 85, 900 cities , 2009, Oper. Res. Lett..
[27] Takao Enkawa,et al. Competition-based neural network for the multiple travelling salesmen problem with minmax objective , 1999, Comput. Oper. Res..
[28] William J. Cook,et al. Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003, INFORMS Journal on Computing.
[29] Robert A. Russell,et al. Technical Note - An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions , 1977, Oper. Res..
[30] Barry Brumitt,et al. GRAMMPS: a generalized mission planner for multiple mobile robots in unstructured environments , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).
[31] N. S. Barnett,et al. Private communication , 1969 .
[32] Timothy J. Lowe,et al. The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic , 1987, Oper. Res..
[33] Andrew B. Whinston,et al. Computer-Assisted School Bus Scheduling , 1972 .
[34] R. A. Zemlin,et al. Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.
[35] William A. Gruver,et al. Team scheduling by genetic search , 1999, Proceedings of the Second International Conference on Intelligent Processing and Manufacturing of Materials. IPMM'99 (Cat. No.99EX296).
[36] Gérard Cornuéjols,et al. The traveling salesman problem on a graph and some related integer polyhedra , 1985, Math. Program..
[37] Vasek Chvátal,et al. Edmonds polytopes and weakly hamiltonian graphs , 1973, Math. Program..
[38] Giovanni Rinaldi,et al. A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..
[39] P. Bhave,et al. Integer programming formulations of vehicle routing problems , 1985 .
[40] Bruce L. Golden,et al. Solving vehicle routing problems using elastic nets , 1994, Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94).
[41] A. Land,et al. An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.
[42] Barry Brumitt,et al. Dynamic mission planning for multiple mobile robots , 1996, Proceedings of IEEE International Conference on Robotics and Automation.
[43] Gilbert Laporte,et al. Optimal Routing under Capacity and Distance Restrictions , 1985, Oper. Res..
[44] William J. Cook,et al. Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems , 2003, Math. Program..
[45] H. D. Ratliff,et al. Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem , 1983, Oper. Res..
[46] Gu Guochang,et al. An implementation of evolutionary computation for path planning of cooperative mobile robots , 2002, Proceedings of the 4th World Congress on Intelligent Control and Automation (Cat. No.02EX527).
[47] Manfred W. Padberg,et al. On the symmetric travelling salesman problem: A computational study , 1980 .
[48] Fernando José Von Zuben,et al. Multiple criteria optimization based on unsupervised learning and fuzzy inference applied to the vehicle routing problem , 2002, J. Intell. Fuzzy Syst..
[49] J. A. Gromicho Dos Santos,et al. Exact Solution of Multiple Traveling Salesman Problem , 1992 .
[50] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[51] J. Svestka,et al. Computational Experience with an M-Salesman Traveling Salesman Algorithm , 1973 .
[52] R. Bland,et al. Large travelling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation , 1989 .
[53] David S. Johnson,et al. Experimental Analysis of Heuristics for the STSP , 2007 .
[54] M. Padberg,et al. Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .
[55] Roberto Cordone,et al. A heuristic approach to the overnight security service problem , 2003, Comput. Oper. Res..
[56] S. Gorenstein. Printing Press Scheduling for Multi-Edition Periodicals , 1970 .
[57] Lixin Tang,et al. A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex , 2000, Eur. J. Oper. Res..
[58] C. Okonjo-Adigwe. An effective method of balancing the workload amongst salesmen , 1988 .
[59] Kap Hwan Kim,et al. A crane scheduling method for port container terminals , 2004, Eur. J. Oper. Res..
[60] William J. Cook,et al. Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.
[61] Paolo Toth,et al. Exact solution of large-scale, asymmetric traveling salesman problems , 1995, TOMS.
[62] Kenneth DeJong,et al. Evolutionary Computational Approaches to Solving the Multiple Traveling Salesman Problem Using a Neighborhood Attractor Schema , 2002, EvoWorkshops.
[63] K. Ruland,et al. The pickup and delivery problem: Faces and branch-and-cut algorithm , 1997 .
[64] Matteo Fischetti,et al. An additive bounding procedure for the asymmetric travelling salesman problem , 1992, Math. Program..
[65] N. Biggs,et al. Graph Theory 1736-1936 , 1976 .
[66] Chi-Hwa Song,et al. Extended simulated annealing for augmented TSP and multi-salesmen TSP , 2003, Proceedings of the International Joint Conference on Neural Networks, 2003..
[67] H. Crowder,et al. Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .
[68] Denis Naddef,et al. Polyhedral Theory and Branch-and-Cut Algorithms for the Symmetric TSP , 2007 .
[69] Paolo Toth,et al. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..
[70] AroraSanjeev. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998 .
[71] Paolo Toth,et al. Branch-And-Bound Algorithms for the Capacitated VRP , 2002, The Vehicle Routing Problem.
[72] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .
[73] Jean-Yves Potvin,et al. A Generalized K-Opt Exchange Procedure For The MTSP , 1989 .
[74] Sanjeev Arora,et al. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.
[75] Agha Iqbal Ali,et al. The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm , 1986, Discret. Appl. Math..
[76] H. P. Williams,et al. A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem , 2007 .
[77] D. H. Bartley,et al. The implementation of , 1986 .
[78] N. Biggs. THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .
[79] Takao Enkawa,et al. A competitive neural network algorithm for solving vehicle routing problem , 1997 .
[80] Cliff T. Ragsdale,et al. Scheduling pre-printed newspaper advertising inserts using genetic algorithms , 2002 .
[81] Anup Basu,et al. Efficient coordinated motion , 2000 .
[82] T. Bektaş. The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .
[83] Amelia C. Regan,et al. Local truckload pickup and delivery with hard time window constraints , 2002 .
[84] M Dorigo,et al. Ant colonies for the travelling salesman problem. , 1997, Bio Systems.
[85] Philip Wolfe,et al. Recent Advances in Mathematical Programming , 2011 .
[86] E. Lawler,et al. Erratum: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1986 .
[87] William J. Cook,et al. Combinatorial optimization , 1997 .
[88] David S. Johnson,et al. Asymptotic experimental analysis for the Held-Karp traveling salesman bound , 1996, SODA '96.
[89] Takao Enkawa,et al. A self‐organizing neural network approach for multiple traveling salesman and vehicle routing problems , 1999 .
[90] ATSPDavid S. JohnsonAT. Experimental Analysis of Heuristics for the Stsp , 2001 .
[91] Stephen P. Boyd,et al. Branch and Bound Methods , 1987 .
[92] Gregory Gutin,et al. The traveling salesman problem , 2006, Discret. Optim..
[93] Temel Öncan,et al. A comparative analysis of several asymmetric traveling salesman problem formulations , 2009, Comput. Oper. Res..
[94] Paolo Toth,et al. The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.
[95] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[96] Paolo Toth,et al. Primal-dual algrorithms for the assignment problem , 1987, Discret. Appl. Math..
[97] Matteo Fischetti,et al. Exact Methods for the Asymmetric Traveling Salesman Problem , 2007 .
[98] Bezalel Gavish,et al. An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems , 1986, Oper. Res..
[99] Jan Karel Lenstra,et al. Some Simple Applications of the Travelling Salesman Problem , 1975 .
[100] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .
[101] Martin Grötschel,et al. Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..
[102] Mauro Dell'Amico,et al. Assignment Problems , 1998, IFIP Congress: Fundamentals - Foundations of Computer Science.
[103] E. Wacholder,et al. A neural network algorithm for the multiple traveling salesmen problem , 1989, Biological Cybernetics.