Efficiently solving the traveling thief problem using hill climbing and simulated annealing

DOI10.1016/j.ins.2017.12.011zbMath1436.90121OpenAlexW2771632251MaRDI QIDQ781909

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

zbMATH Keywords

large-scale optimizationcombinatorial optimizationsimulated annealinglocal searchinterdependencetraveling thief problem

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

A weighted-sum method for solving the bi-objective traveling thief problem ⋮ A decomposition-based algorithm for the double row layout problem

Uses Software

• TSPLIB
• Genocop
• SPOT
• irace

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Routing problems with loading constraints
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• The Euclidean traveling salesman problem is NP-complete
• The packing while traveling problem
• Chained Lin-Kernighan for Large Traveling Salesman Problems
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• TSPLIB—A Traveling Salesman Problem Library
• Tabu Search—Part I
• Tabu Search—Part II
• A Method for Solving Traveling-Salesman Problems
• Computer Solutions of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems