Research Output
A Memetic Random Key Algorithm for the Balanced Travelling Salesman Problem
  This paper considers a variant of the well-known travelling salesman problem. In this variant, the cost of travelling from a vertex to another is an arbitrary value on the real line and the objective is finding a tour with minimum absolute value cost. We propose a memetic random key algorithm for this problem and experiment with different settings of the algorithm. The experiments explore the use of a flexible decoding mechanism and also the frequency of applying local search within the random key algorithm.

  • Date:

    14 February 2021

  • Publication Status:

    Published

  • Publisher

    Springer

  • DOI:

    10.1007/978-3-030-68520-1_2

  • Funders:

    Historic Funder (pre-Worktribe)

Citation

Aslan, A. (2018, April). A Memetic Random Key Algorithm for the Balanced Travelling Salesman Problem. Presented at Metaheuristics Summer School (MESS 2018), Taormina, Italy

Authors

Keywords

Memetic algorithms, Local search, Travelling salesman problem

Monthly Views:

Available Documents