Browse > Article
http://dx.doi.org/10.9708/jksci.2019.24.11.119

Partial Inverse Traveling Salesman Problems on the Line  

Chung, Yerim (School of Business, Yonsei University)
Park, Myoung-Ju (Dept. of Industrial and Management Systems Engineering, Kyung Hee University)
Abstract
The partial inverse optimization problem is an interesting variant of the inverse optimization problem in which the given instance of an optimization problem need to be modified so that a prescribed partial solution can constitute a part of an optimal solution in the modified instance. In this paper, we consider the traveling salesman problem defined on the line (TSP on the line) which has many applications such as item delivery systems, the collection of objects from storage shelves, and so on. It is worth studying the partial inverse TSP on the line, defined as follows. We are given n requests on the line, and a sequence of k requests that need to be served consecutively. Each request has a specific position on the real line and should be served by the server traveling on the line. The task is to modify as little as possible the position vector associated with n requests so that the prescribed sequence can constitute a part of the optimal solution (minimum Hamiltonian cycle) of TSP on the line. In this paper, we show that the partial inverse TSP on the line and its variant can be solved in polynomial time when the sever is equiped with a specific internal algorithm Forward Trip or with a general optimal algorithm.
Keywords
Inverse Optimization; Partial Inverse Problem; Traveling Salesman Problem; Poly-time Algorithm; TSP on the Line;
Citations & Related Records
연도 인용수 순위
  • Reference
1 R. K. Ahuja and J. B. Orlin, "Inverse Optimization, Operations Research," Vol. 49, No. 5, pp. 771-783, October 2001. DOI: 10.1287/opre.49.5.771.10607   DOI
2 C. Heuberger, “Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results,” Journal of Combinatorial Optimization, Vol. 8, No. 3, pp. 329-361, September 2004. DOI: 10.1023/B:JOCO.0000038914.26975.9b   DOI
3 J. Zhang and Z. Liu, “A General Model of Some Inverse Combinatorial Optimization Problems and its Solution Method under $l{\infty}$-norm,” Journal of Combinatorial Optimization, Vol. 6, No. 2, pp. 207-227, June 2002. DOI: 10.1023/A:1013807829021   DOI
4 S. Xu and J. Zhang, “An Inverse Problem of the Weighted Shortest Path Problem,” Japan Journal of Industrial and Applied Mathematics, Vol. 12, No. 1, pp. 47-59, February 1995. DOI: 10.1007/BF03167381   DOI
5 R.K. Ahuja and J.B. Orlin, “A Faster Algorithm for the Inverse Spanning Tree Problem,” Journal of Algorithms, Vol. 34, No. 1, pp. 177-193, January 2000. DOI: 10.1006/jagm.1999.1052   DOI
6 Y. Chung, and M. Demange, "The 0-1 Inverse Maximum Stable Set Problem," Discrete Applied Mathematics, Vol. 156, No. 13, pp. 2501-2516, July 2008. DOI: 10.1016/j.dam.2008.03.015   DOI
7 Y. Chung, J.F. Culus, and M. Demange, "Inverse Chromatic Number Problems in Interval and Permutation Graphs," European Journal of Operational Research Vol. 243, pp. 763-773, June 2015. DOI: 10.1016/j.ejor.2014.12.028   DOI
8 A. Aswani, Z.-J. Shen, A. Siddiq, “Inverse Optimization with Noisy Data,” Operations Research, Vol. 66, No. 3, pp. 597-892, May-June 2018. DOI: 10.1287/opre.2017.1705   DOI
9 Y. Chung, and M. Demange, "On Inverse Traveling Salesman Problems," 4OR - A Quarterly Journal of Operations Research, Vol. 10, pp. 193-209, June 2012. DOI: 10.1007/s10288-011-0194-4   DOI
10 D. Bertsimas, V. Gupa and I.Ch. Paschlidis, "Inverse Optimization: A New Perspecive on the Black-Litterman Model," Operations Research, Vol. 60, No. 6, pp. 1389-1403, November-December 2012. DOI: 10.1287/opre.1120.1115   DOI
11 T.C.Y. Chan, T. Lee, D. Terekhov, "Inverse optimization: Closed-form solutions, geometry, and goodness of fit," Management Science, Vol. 65, No. 3, pp. 955-1453, March 2019. DOI: 10.1287/mnsc.2017.2992   DOI
12 P. M Esfahani, S. Shafieezadeh-Abadeh, G.A. Hanasusanto, D. Kuhn, “Data-driven inverse optimization with imperfect information,” Mathematical Programming, Vol. 167, No. 1, pp. 191-234, January 2018. DOI: 10.1007/s10107-017-1216-6   DOI
13 Lai T.C., Orlin J.B., "The Complexity of Preprocessing," Research Report of Sloan School of Management, MIT, November 2003.
14 K. Ghobadi, T. Lee, H. Mahmoudzadeh, D. Terekhov, “Robust inverse optimization,” Operations Research Letters, Vol. 46, No. 3, pp. 339-344, May 2018. DOI: 10.1016/j.orl.2018.03.007   DOI
15 J. Zhang and X. Yang, “Partial Inverse Assignment Problem under L1-Norm,” Operations Research Letters, Vol. 35, No. 1, pp. 23-28, January 2007. DOI: 10.1016/j.orl.2005.12.003   DOI
16 X.G. Yang, “Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem,” RAIRO Opereations Research, Vol. 35, No. 1, pp. 117-126, January March 2001. DOI: 10.1051/ro:2001106   DOI
17 Y. Chung, and M. Park, "Partial Inverse Traveling Salesman Problem," accepted at Journal of the KORMS Society, October 2019.
18 N. Chakravarti, “Isotonic Median Regression: a Linear Programming Approach,” Mathematics of Operations Research, Vol. 14, No. 2, pp. 303-308, May 1989. DOI: 10.1287/moor.14.2.303   DOI
19 M.R. Garey, and D.S. Johnson, "Computers and Intractability - A Guide to The Theory of NP-completeness," San Francisco, Freeman, 1979.
20 S. Angelov, B. Harb, S. Kannan, and L.S. Wang, "Weighted Isotonic Regression under the l1-Norm," In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 783-791, January 2006.
21 T. Robertson and F. Wright, “Algorithms in Order Restricted Statistical Inference and the Cauchy Mean Value Property,” Annals of Statistics, Vol. 8, No. 3, pp. 645-651, May 1980. DOI: 10.1214/aos/1176345014   DOI