Efficient approximation of melting temperature in simulated annealing algorithms applied to Chebyshev travelling salesman problem

Omar Al-Araidah, Khaleel Abu Shgair, Wafa Batayneh, Ali Diabat

Research output: Contribution to journalArticle

Abstract

Simulated annealing algorithms are widely used for solving NP-hard combinatorial optimisation problems including the travelling salesman problem (TSP). This article presents results of an empirical investigation for estimating the melting temperature for the simulated annealing algorithm based on the objective function value. We limit our search to Chebyshev order-picking systems with unequal horizontal and vertical speeds. The article utilises 90 randomly generated order-picking problems with densities ranging from 10 to 800 stops per tour. For each investigated problem, we utilise different seed values to generate and to solve ten replicates of the problem. Results show that quality melting temperature values can be estimated based on the statistical characteristics of the search space. This study helps to arrive at quality solutions with significantly fewer re-evaluations of the objective function.

Original languageEnglish (US)
Pages (from-to)145-163
Number of pages19
JournalInternational Journal of Business Performance and Supply Chain Modelling
Volume4
Issue number2
DOIs
StatePublished - Jan 1 2012

Keywords

  • Algorithm
  • Chebyshev
  • Heuristic
  • Melting temperature
  • Metaheuristics
  • Simulated annealing
  • Travelling salesman

ASJC Scopus subject areas

  • Business and International Management
  • Strategy and Management
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'Efficient approximation of melting temperature in simulated annealing algorithms applied to Chebyshev travelling salesman problem'. Together they form a unique fingerprint.

  • Cite this