Efficiently solving the traveling thief problem using hill climbing and simulated annealing
DOI10.1016/J.INS.2017.12.011zbMATH Open1436.90121OpenAlexW2771632251MaRDI QIDQ781909FDOQ781909
Authors: Mohamed El Yafrani, Belaïd Ahiod 
Publication date: 20 July 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2017.12.011
Recommendations
- A genetic algorithm for multi-component optimization problems: the case of the travelling thief problem
- A weighted-sum method for solving the bi-objective traveling thief problem
- A novel list-constrained randomized VND approach in GPU for the traveling thief problem
- Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach
- A simulated annealing and hill-climbing algorithm for the traveling tournament problem
simulated annealingcombinatorial optimizationlocal searchlarge-scale optimizationinterdependencetraveling thief problem
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Large-scale problems in mathematical programming (90C06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- Title not available (Why is that?)
- Tabu Search—Part I
- A method for solving traveling-salesman problems
- Routing problems with loading constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Euclidean traveling salesman problem is NP-complete
- Tabu Search—Part II
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- Chained Lin-Kernighan for large traveling salesman problems
- Computer Solutions of the Traveling Salesman Problem
- Title not available (Why is that?)
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- The packing while traveling problem
- Packing while traveling: mixed integer programming for a class of nonlinear knapsack problems
Cited In (5)
- A decomposition-based algorithm for the double row layout problem
- A genetic algorithm for multi-component optimization problems: the case of the travelling thief problem
- A novel list-constrained randomized VND approach in GPU for the traveling thief problem
- A weighted-sum method for solving the bi-objective traveling thief problem
- Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach
Uses Software
This page was built for publication: Efficiently solving the traveling thief problem using hill climbing and simulated annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q781909)
