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

    Fingerprint

    Temperature
    Traveling salesman problem
    Simulated annealing algorithm
    Approximation
    Objective function
    Order picking
    Empirical investigation
    NP-hard
    Evaluation
    Optimization problem
    Combinatorial optimization

    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

    Cite this

    Efficient approximation of melting temperature in simulated annealing algorithms applied to Chebyshev travelling salesman problem. / Al-Araidah, Omar; Shgair, Khaleel Abu; Batayneh, Wafa; Diabat, Ali.

    In: International Journal of Business Performance and Supply Chain Modelling, Vol. 4, No. 2, 01.01.2012, p. 145-163.

    Research output: Contribution to journalArticle

    @article{b213d3121a6747de802ba040cd1a1fb2,
    title = "Efficient approximation of melting temperature in simulated annealing algorithms applied to Chebyshev travelling salesman problem",
    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.",
    keywords = "Algorithm, Chebyshev, Heuristic, Melting temperature, Metaheuristics, Simulated annealing, Travelling salesman",
    author = "Omar Al-Araidah and Shgair, {Khaleel Abu} and Wafa Batayneh and Ali Diabat",
    year = "2012",
    month = "1",
    day = "1",
    doi = "10.1504/IJBPSCM.2012.048304",
    language = "English (US)",
    volume = "4",
    pages = "145--163",
    journal = "International Journal of Business Performance and Supply Chain Modelling",
    issn = "1758-9401",
    publisher = "Inderscience Enterprises Ltd",
    number = "2",

    }

    TY - JOUR

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

    AU - Al-Araidah, Omar

    AU - Shgair, Khaleel Abu

    AU - Batayneh, Wafa

    AU - Diabat, Ali

    PY - 2012/1/1

    Y1 - 2012/1/1

    N2 - 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.

    AB - 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.

    KW - Algorithm

    KW - Chebyshev

    KW - Heuristic

    KW - Melting temperature

    KW - Metaheuristics

    KW - Simulated annealing

    KW - Travelling salesman

    UR - http://www.scopus.com/inward/record.url?scp=85027396072&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85027396072&partnerID=8YFLogxK

    U2 - 10.1504/IJBPSCM.2012.048304

    DO - 10.1504/IJBPSCM.2012.048304

    M3 - Article

    AN - SCOPUS:85027396072

    VL - 4

    SP - 145

    EP - 163

    JO - International Journal of Business Performance and Supply Chain Modelling

    JF - International Journal of Business Performance and Supply Chain Modelling

    SN - 1758-9401

    IS - 2

    ER -