@inproceedings { , title = {A Memetic Random Key Algorithm for the Balanced Travelling Salesman Problem}, 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.}, conference = {Metaheuristics Summer School (MESS 2018)}, doi = {10.1007/978-3-030-68520-1\_2}, isbn = {978-3-030-68519-5}, pages = {16-22}, publicationstatus = {Published}, publisher = {Springer}, keyword = {Memetic algorithms, Local search, Travelling salesman problem}, year = {2024}, author = {Aslan, Ayse} }