The travelling salesman problem with neighbourhoods: MINLP solution

Optimization Methods and Software

Volumn 28, Issue 2, 2013, Pages 364-378

  Gentilini, Iacopo ^a   Margot, Franois ^b   Shimada, Kenji ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

non convex and nonlinear optimization; spatial branch and bound; travelling salesman problem with neighbourhoods

Indexed keywords

BRANCH AND BOUNDS; COMPUTATIONAL RESULTS; DISTANCE METRICS; EUCLIDEAN NORM; EXACT SOLUTION; INTEGER VALUES; INTEGER VARIABLES; MIXED-INTEGER; NON-LINEAR OPTIMIZATION; NP-HARD; OPTIMIZATION PROBLEMS; OPTIMIZERS; ORDERS OF MAGNITUDE; TECHNICAL FIELDS; TRAVELLING SALESMAN PROBLEM; UTILITY MANAGEMENT;

PILE FOUNDATIONS;

TRAVELING SALESMAN PROBLEM;

EID: 84870885722     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556788.2011.648932     Document Type: Article

References (23)

1. Applegate, D., Bixby, R., Chvátal, V., and, Cook, W. 2006. The Traveling Salesman Problem: A Computational Study, Princeton, NJ: Princeton University Press.
2. Applegate, D., Bixby, R., Chvátal, V., and, Cook, W. On the solution of traveling salesman problems. 645-656. Documenta Mathematica, extra volume III ICM Berlin (1998)
3. Arkin, E., and, Hassin, R. 1994. Approximation algorithms for the geometric covering salesman problem. Discrete Applied Mathematics, 55: 197-218.
4. Belotti, P., Lee, J., Liberti, L., Margot, F., and, Wchter, A. 2009. Branching and bound tightening techniques for nonconvex MINLPs. Optim. Methods Softw., 24: 597-634.
5. Bonami, P., Biegler, L., Conn, A., Cornuéjols, G., Grossmann, I., Laird, C., Lee, J., Lodi, A., Margot, F., Sawaya, N., and, Wchter, A. 2008. An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim., 5: 186-204.
6. COIN-OR. Computational infrastructure for operations research project. Available at http://www.coin-or.org/.
7. CPLEX. 2011. Available at http://www-01.ibm.com/software/integration/ optimization/cplex-optimizer/.
8. Dong, J., Yang, N., and, Chen, M. 2007. Heuristic approaches for a TSP variant: The automatic meter reading shortest tour problem. In Extending the Horizons: Advances in Computing, Optimization, and Decision Technologies, Edited by: Baker, E. K., Joseph, A., Mehrotra, A., Trick, M. A., Sharda, R. and Vo, S. 145-163. Berlin: Springer. Operations Research/Computer Science Interfaces Series Vol. 37
9. Elbassioni, K., Fishkin, A., and, Sitters, R. 2009. Approximation algorithms for euclidean traveling salesman problem with discrete and continuous neighborhoods. Int. J. Comput. Geom. Appl., 19: 173-193.
10. Fourer, R., Gay, D., and, Kernighan, B. 2003. AMPL: A Modeling Language for Mathematical Programming. Pacific Grove, CA, USA: Brookes/Cole Publishing.
11. Gentilini, I., Margot, F., and, Shimada, K. STSPN Instances. Available at http://wpweb2.tepper.cmu.edu/fmargot/ampl.html.
12. Gueta, L., Chiba, R., Ota, J., Ueyama, T., and, Arai, T. 2008. Coordinated Motion Control of a Robot Arm and a Positioning Table With Arrangement of Multiple Goals. Proceedings of the 2008 IEEE International Conference on Robotics and Automation (ICRA 2008). May 19-23 2008, Pasadena, USA. pp. 2252-2258.
13. Gutin, G., and, Punnen, A. 2002. The Traveling Salesman Problem and Its Variations. Dordrecht: Kluwer Academic.
14. Hong, S. 1972. A linear programming approach for the travelling salesman problem. Baltimore, MD: Johns Hopkins University. Ph.D. thesis
15. LINDO. Solver Suite. Available at http://www.lindo.com/.
16. Mennell, W. 2009. Heuristics for solving three routing problems: Close-enough traveling salesman problem, close-enough vehicle routing problem, sequence-dependent team orienteering problem. College Park: University of Maryland. Ph.D. thesis
17. Miller, C., Tucker, A., and, Zemlin, R. 1960. Integer programming formulation of traveling salesman problems. J. ACM, 7: 326-329.
18. Orman, A., and, Williams, H. 2007. A survey of different integer programming formulations of the travelling salesman problem. In Optimisation, Econometric and Financial Analysis, 91-104. Berlin: Springer. Advances in Computational Management Science Vol. 9
19. Padberg, M., and, Rinaldi, G. 1991. A branch-and-cut algorithm for the resolution of large scale symmetric travelling salesman problems. SIAM Rev., 33: 60-100.
20. Sahinidis, N. 1996. B aron: A general purpose global optimization software package. J. Global Optim., 8: 201-205.
21. Vásquez-Gómez, J., López-Damian, E., and, Sucar, L. 2009. View planning for 3D object reconstruction. 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2009). October 11-15 2009, St. Louis, USA. pp. 4015-4020.
22. Wchter, A., and, Biegler, L. 2006. On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program., 106: 25-57.
23. Wang, P., Krishnamurti, R., and, Gupta, K. 2007. View planning problem with combined view and traveling cost. 2007 IEEE International Conference on Robotics and Automation (ICRA 2007). April 10-14 2007, Roma, Italy. pp. 711-716.