ABSTRACT
The traveling thief problem (TTP) is fast gaining attention for being a challenging combinatorial optimization problem. A number of algorithms have been proposed for solving this problem in the recent past. Despite being a challenging problem, it is often argued if TTP is realistic enough because of its formulation, which only allows a single thief to travel across hundreds or thousands of cities to collect (steal) items. In addition, the thief is required to visit all cities, regardless of whether an item is stolen there or not. In this paper we discuss the shortcomings of the current formulation and present a relaxed version of the problem which allows multiple thieves to travel across different cities with the aim of maximizing the group's collective profit. A number of fast heuristics for solving the newly proposed multiple traveling thieves problem (MTTP) are also proposed and evaluated.
- D. Applegate, W. J. Cook, and A. Rohe. Chained Lin-Kernighan for large traveling salesman problems. INFORMS Journal on Computing, 15 (1): 82--92, 2003. Google ScholarDigital Library
- D. Black, R. Eglese, and S. Wohlk. The time-dependent prize-collecting arc routing problem. Computers and Operations Research, 40 (2): 526 -- 535, 2013. Google ScholarDigital Library
- M. R. Bonyadi, Z. Michalewicz, and L. Barone. The travelling thief problem: The first step in the transition from theoretical problems to realistic problems. In IEEE CEC, pages 1037--1044, 2013.Google ScholarCross Ref
- M. R. Bonyadi, Z. Michalewicz, M. R. Przybylek, and A. Wierzbicki. Socially inspired algorithms for the TTP. In GECCO, pages 421--428. ACM, 2014. Google ScholarDigital Library
- G. B. Dantzig and J. H. Ramser. The truck dispatching problem. Management Science, 6 (1): 80--91, 1959. Google ScholarDigital Library
- H. Faulkner, S. Polyakovskiy, T. Schultz, and M. Wagner. Approximate approaches to the traveling thief problem. In GECCO, pages 385--392. ACM, 2015. Google ScholarDigital Library
- R. Kulkarni and P. Bhave. Integer programming formulations of vehicle routing problems. European Journal of Operational Research, 20 (1): 58 -- 67, 1985.Google ScholarCross Ref
- G. Laporte. The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research, 59 (3): 345 -- 358, 1992.Google ScholarCross Ref
- C. Lin, K. Choy, G. Ho, S. Chung, and H. Lam. Survey of green vehicle routing problem: Past and future trends. Expert Systems with Applications, 41 (4, Part 1): 1118 -- 1138, 2014. Google ScholarDigital Library
- S. Martello, D. Pisinger, and P. Toth. Dynamic programming and strong bounds for the 0--1 knapsack problem. Management Science, 45 (3): 414--424, Mar. 1999.Google ScholarDigital Library
- Y. Mei, X. Li, and X. Yao. On investigation of interdependence between sub-problems of the travelling thief problem. Soft Computing, 20 (1): 157--172, 2014. Google ScholarDigital Library
- J. R. Montoya-Torres, J. L. Franco, S. N. Isaza, H. F. Jimenez, and N. Herazo-Padilla. A literature review on the vehicle routing problem with multiple depots. Computers & Industrial Engineering, 79: 115 -- 129, 2015.Google Scholar
- S. Nallaperuma, M. Wagner, F. Neumann, B. Bischl, O. Mersmann, and H. Trautmann. A feature-based comparison of local search and the Christofides algorithm for the travelling salesperson problem. In FOGA, pages 147--160. ACM, 2013. Google ScholarDigital Library
- S. Nallaperuma, M. Wagner, and F. Neumann. Parameter prediction based on features of evolved instances for ant colony optimization and the traveling salesperson problem. In PPSN, pages 100--109. Springer, 2014.Google ScholarCross Ref
- S. Polyakovskiy, M. R. Bonyadi, M. Wagner, Z. Michalewicz, and F. Neumann. A comprehensive benchmark set and heuristics for the traveling thief problem. In GECCO, pages 477--484. ACM, 2014. Google ScholarDigital Library
- H. Psaraftis. Dynamic vehicle routing: Status and prospects. Annals of Op. Res., 61 (1): 143--164, 1995.Google ScholarCross Ref
- S. Raff. Routing and scheduling of vehicles and crews: The state of the art. Computers & Operations Research, 10 (2): 63 -- 211, 1983.Google ScholarCross Ref
- G. Reinelt. TSPLIB - A Traveling Salesman Problem Library. ORSA J. on Computing, 3 (4): 376--384, 1991.Google ScholarCross Ref
- M. M. Solomon. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35 (2): 254--265, 1987.Google ScholarCross Ref
- C.-K. Ting and X.-L. Liao. The selective pickup and delivery problem: Formulation and a memetic algorithm. Production Economics, 141 (1): 199 -- 211, 2013.Google ScholarCross Ref
- M. Wagner. Stealing items more efficiently with ants: a swarm intelligence approach to the traveling thief problem. 2016. Internal technical report.Google Scholar
- J. Wu, S. Polyakovskiy, and F. Neumann. On the impact of the renting rate for the unconstrained nonlinear knapsack problem. In GECCO, 2016. To appear. Google ScholarDigital Library
Index Terms
- Fast Heuristics for the Multiple Traveling Thieves Problem
Recommendations
Socially inspired algorithms for the travelling thief problem
GECCO '14: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary ComputationMany real-world problems are composed of two or more problems that are interdependent on each other. The interaction of such problems usually is quite complex and solving each problem separately cannot guarantee the optimal solution for the overall ...
A comprehensive benchmark set and heuristics for the traveling thief problem
GECCO '14: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary ComputationReal-world optimization problems often consist of several NP-hard optimization problems that interact with each other. The goal of this paper is to provide a benchmark suite that promotes a research of the interaction between problems and their mutual ...
Doubly-rooted stem-and-cycle ejection chain algorithm for the asymmetric traveling salesman problem
Ejection chain methods, which include the classical Lin-Kernighan LK procedure and the Stem-and-Cycle S&C reference structure, have been the source of the currently leading algorithms for large scale symmetric traveling salesman problems STSP. Although ...
Comments