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

DOI10.1016/J.INS.2017.12.011MaRDI QIDQ781909zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

simulated annealingcombinatorial optimizationlocal searchlarge-scale optimizationinterdependencetraveling thief problem

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 5829047 (Why is no real title available?)
• scientific article; zbMATH DE number 4104743 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 41891 (Why is no real title available?)
• A method for solving traveling-salesman problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Chained Lin-Kernighan for large traveling salesman problems
• Computer Solutions of the Traveling Salesman Problem
• Packing while traveling: mixed integer programming for a class of nonlinear knapsack problems
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Routing problems with loading constraints
• TSPLIB—A Traveling Salesman Problem Library
• Tabu Search—Part I
• Tabu Search—Part II
• The Euclidean traveling salesman problem is NP-complete
• The packing while traveling problem
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing

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

Describes a project that uses

Uses Software

• irace
• SPOT
• Genocop
• TSPLIB

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)