Skip to main content

Research Repository

Advanced Search

A Memetic Random Key Algorithm for the Balanced Travelling Salesman Problem

Aslan, Ayse

Authors



Abstract

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.

Citation

Aslan, A. (2021). A Memetic Random Key Algorithm for the Balanced Travelling Salesman Problem. In Metaheuristics for Combinatorial Optimization: MESS 2018 (16-22). https://doi.org/10.1007/978-3-030-68520-1_2

Conference Name Metaheuristics Summer School (MESS 2018)
Conference Location Taormina, Italy
Start Date Apr 15, 2018
Online Publication Date Feb 14, 2021
Publication Date 2021
Deposit Date Jan 25, 2023
Publisher Springer
Pages 16-22
Series Title Advances in Intelligent Systems and Computing
Series Number 1332
Book Title Metaheuristics for Combinatorial Optimization: MESS 2018
ISBN 978-3-030-68519-5
DOI https://doi.org/10.1007/978-3-030-68520-1_2
Keywords Memetic algorithms, Local search, Travelling salesman problem