Mohamed El Yafrani
Belaïd Ahiod
ABSTRACT
The Travelling Thief Problem (TTP) is an optimization problem introduced in order to provide a more realistic model for real-world optimization problems. The problem combines the Travelling Salesman Problem and the Knapsack Problem and introduces the notion of interdependence between sub-problems. In this paper, we study and compare different approaches for solving the TTP from a metaheuristics perspective. Two heuristic algorithms are proposed. The first is a Memetic Algorithm, and the second is a single-solution heuristic empowered by Hill Climbing and Simulated Annealing. Two other state-of-the-art algorithms are briefly revisited, analyzed, and compared to our algorithms. The obtained results prove that our algorithms are very efficient for many TTP instances.
- D. Applegate, W. Cook, and A. Rohe. Chained lin-kernighan for large traveling salesman problems. INFORMS Journal on Computing, 15(1):82--92, 2003. Google Scholar
Digital Library
- A. Beham, J. Fechter, M. Kommenda, S. Wagner, S. M. Winkler, and M. Affenzeller. Optimization strategies for integrated knapsack and traveling salesman problems. In Computer Aided Systems Theory--EUROCAST 2015, pages 359--366. Springer, 2015.Google ScholarCross Ref
- 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 Evolutionary Computation (CEC), 2013 IEEE Congress on, pages 1037--1044. IEEE, 2013.Google ScholarCross Ref
- M. R. Bonyadi, Z. Michalewicz, M. Roman Przybyoek, and A. Wierzbicki. Socially inspired algorithms for the travelling thief problem. In Proceedings of the 2014 conference on Genetic and evolutionary computation, pages 421--428. ACM, 2014. Google ScholarDigital Library
- B. Delaunay. Sur la sphere vide. Izv. Akad. Nauk SSSR, Otdelenie Matematicheskii i Estestvennyka Nauk, 7(793--800):1--2, 1934.Google Scholar
- J. Dzubera and D. Whitley. Advanced correlation analysis of operators for the traveling salesman problem. In Parallel Problem Solving from Nature-PPSN III, pages 68--77. Springer, 1994. Google ScholarDigital Library
- H. Faulkner, S. Polyakovskiy, T. Schultz, and M. Wagner. Approximate approaches to the traveling thief problem. In Proceedings of the 2015 on Genetic and Evolutionary Computation Conference, pages 385--392. ACM, 2015. Google ScholarDigital Library
- D. E. Goldberg and R. Lingle. Alleles, loci, and the traveling salesman problem. In Proceedings of the first international conference on genetic algorithms and their applications, pages 154--159. Lawrence Erlbaum Associates, Publishers, 1985. Google ScholarDigital Library
- L. Guibas and J. Stolfi. Primitives for the manipulation of general subdivisions and the computation of voronoi. ACM transactions on graphics (TOG), 4(2):74--123, 1985. Google ScholarDigital Library
- J.-Q. Hu and B. Leida. Traffic grooming, routing, and wavelength assignment in optical wdm mesh networks. In INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, volume 1. IEEE, 2004.Google ScholarCross Ref
- M. Ibrahimov, A. Mohais, S. Schellenberg, and Z. Michalewicz. Evolutionary approaches for supply chain optimisation: part i: single and two-component supply chains. International Journal of Intelligent Computing and Cybernetics, 5(4):444--472, 2012.Google ScholarCross Ref
- M. Ibrahimov, A. Mohais, S. Schellenberg, and Z. Michalewicz. Evolutionary approaches for supply chain optimisation. part ii: multi-silo supply chains. International Journal of Intelligent Computing and Cybernetics, 5(4):473--499, 2012.Google ScholarCross Ref
- M. Iori and S. Martello. Routing problems with loading constraints. Top, 18(1):4--27, 2010.Google ScholarCross Ref
- S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi, et al. Optimization by simulated annealing. science, 220(4598):671--680, 1983.Google Scholar
- Y. Mei, X. Li, F. Salim, and X. Yao. Heuristic evolution with genetic programming for traveling thief problem. In Evolutionary Computation (CEC), 2015 IEEE Congress on, pages 2753--2760. IEEE, 2015.Google ScholarCross Ref
- Y. Mei, X. Li, and X. Yao. Improving efficiency of heuristics for the large scale traveling thief problem. In Simulated Evolution and Learning, pages 631--643. Springer, 2014. Google ScholarDigital Library
- Y. Mei, X. Li, and X. Yao. On investigation of interdependence between sub-problems of the travelling thief problem. Soft Computing, pages 1--16, 2014. Google ScholarDigital Library
- Z. Michalewicz and D. B. Fogel. How to solve it: modern heuristics. Springer Science & Business Media, 2013.Google Scholar
- H. Muhlenbein. Evolution in time and space-the parallel genetic algorithm. In Foundations of genetic algorithms. Citeseer, 1991.Google Scholar
- J. Perl and M. S. Daskin. A warehouse location-routing problem. Transportation Research Part B: Methodological, 19(5):381--396, 1985.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 Proceedings of the 2014 conference on Genetic and evolutionary computation, pages 477--484. ACM, 2014. Google ScholarDigital Library
- D. Whitley, D. Hains, and A. Howe. Tunneling between optima: partition crossover for the traveling salesman problem. In Proceedings of the 11th Annual conference on Genetic and evolutionary computation, pages 915--922. ACM, 2009. Google ScholarDigital Library
- D. Whitley, D. Hains, and A. Howe. A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover. In Parallel Problem Solving from Nature, PPSN XI, pages 566--575. Springer, 2010. Google ScholarDigital Library
- D. Whitley, T. Starkweather, and D. Shaner. The traveling salesman and sequence scheduling: Quality solutions using genetic edge recombination. Citeseer, 1991.Google Scholar
Index Terms
- Population-based vs. Single-solution Heuristics for the Travelling Thief 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 local search based approach for solving the Travelling Thief Problem
Graphical abstractDisplay Omitted HighlightsInvestigate the interdependence in real-world optimization problems.Propose a local search based approach to solve efficiently TTP instances.The proposed algorithms are designed to exploit particular search ...
Improved Tabu search heuristics for the dynamic space allocation problem
The dynamic space allocation problem (DSAP) presented in this paper considers the task of assigning items (resources) to locations during a multi-period planning horizon such that the cost of rearranging the items is minimized. Three tabu search ...
Comments